Case analysis of a Cost-Optimal QoS aggregation policy for network mobility

• Published in: IEEE communications letters Vol. 12; no. 2; pp. 130 - 132
• Main Authors: Kamel, G., Mihailovic, A., Hamid Aghvami, A.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01-02-2008; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Access methods and protocols, osi model; Access protocols; Access routes; Agglomeration; Aggregates; Applied sciences; Bursting; Cost analysis; Cost engineering; Cost function; Diffusion tensor imaging; Exact sciences and technology; Government; Kirchhoff's Law; Multi-layer neural network; Networks; Operation, maintenance, reliability; Policies; Routers; Scalability; Switching and signalling; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Teletraffic; Vehicle dynamics; Writing; Performance evaluation; Cost minimization; Packet switching; Scalability; Teletraffic; Router; Waiting time; QoS aggregation policy; network mobility; Queueing system; Traffic management; Network protocol; Traffic control; Access network; Access protocol; Burst switching; Service quality
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2008.071662

The network mobility reservation protocol was proposed to increase the scalability of QoS provision in moving networks. However, its scalability is undermined when sessions are bursty and short-lived. QoS aggregation addresses this by holding requests at the mobile router for a time before sending a single aggregated reservation to the access network. This letter analyses a cost-optimal QoS aggregation policy under the case of bursty requests, and compares its expected cost efficiency and user waiting time with that of other previously proposed policies. It is shown that the C-policy reduces operator costs compared to other policies, whilst also reducing expected queueing times.