By Topic

A Distributed Algorithm for Resource Allocation for Delay Sensitive 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)
Kallitsis, M.G. ; Dept. of Electr. & Comput. Eng., NC State Univ., Raleigh, NC, USA ; Callaway, R.D. ; Devetsikiotis, M. ; Michailidis, G.

In this paper, we present a distributed algorithm that dynamically allocates the available resources of a service-oriented network to delay sensitive network services. Our algorithm is based on Gauss-Seidel type iterations. Thus, each node depends on its local information and sends/receives a small number of messages, until convergence is achieved. We use a utility-based framework to differentiate services based on both their relative profitability and quality-of-service requirements. Our performance metric is a network calculus driven, end-to-end delay that a service class experiences in the network. Finally, we evaluate the performance of our system under various scenarios, including an analysis with real instant messaging network traces.

Published in:

Computer Aided Modeling and Design of Communication Links and Networks, 2009. CAMAD '09. IEEE 14th International Workshop on

Date of Conference:

12-12 June 2009