By Topic

Extended Adaptive Rate Allocation for Distributed Flow Control of Multiclass Services in the Next Generation Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
G. Abbas ; Intell. & Distrib. Syst. Lab., Liverpool Hope Univ., Liverpool, UK ; A. K. Nagar ; H. Tawfik ; J. Y. Goulermas

Next Generation Networks (NGN) are envisaged to see a vast and inevitable convergence of diverse multimedia and mobile services with versatile bandwidth utilities. As such, a design challenge for NGN is to allow efficient rate allocation without compromising Quality of Service (QoS) provisioning to any service and thereby enable a global welfare gain. However, the traditional rate allocation schemes assume elasticity of application services and strict-concavity of utility functions. Such assumptions provide design simplicity, but in practice, limit the applicability of resulting protocols, in that severe QoS problems are encountered when bandwidth is shared by inelastic services with non-concave utility functions. As such, the current strict priority based schemes cannot maximize the overall network utility for NGN, and hence bring a significant global welfare loss. This paper presents an adaptive rate control algorithm to distributively allocate transmission rates to multiclass services. The proposed algorithm is based on the Lagrangian Relaxation for a dual formulation by decomposing the rate allocation problem into a master-slave framework. We use a novel surrogate subgradient method to solve the master problem. For the nonconvex subproblems, we compare the performance of a number of global optimization methods, where the objectives are to achieve fast convergence as well as accuracy.

Published in:

2009 Third International Conference on Next Generation Mobile Applications, Services and Technologies

Date of Conference:

15-18 Sept. 2009