By Topic

Delay guarantee and bandwidth allocation for network services

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
$31 $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)
Joutsensalo, J. ; Dept. of Math. Inf. Technol., Jyvaskyla Univ., Finland ; Hamalainen, T. ; Siltanen, J. ; Luostarinen, K.

This paper presents a packet scheduling scheme for ensuring delay and bandwidth as a quality of service (QoS) requirement. For customers, rightful service is given while optimizing revenue of the network service provider. A gradient and fixed point type algorithms for updating the weights of a packet scheduler are derived from a revenue-based optimization problem. In the linear pricing scenario, algorithms are simple to implement. We compared algorithms with optimal brute-force method. Especially fixed point algorithm converges very fast to the optimal solution, typically in one iteration and about 40 operations, when number of classes is three. The weight updating procedures are independent on the assumption of the connections' statistical behavior, and therefore they are robust against erroneous estimates of statistics. Also, a call admission control (CAC) is implemented in context of our scenario.

Published in:

Next Generation Internet Networks, 2005

Date of Conference:

18-20 April 2005