By Topic

Distributed and Dynamic Resource Allocation for Delay Sensitive 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
$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)
Michael G. Kallitsis ; Dept. of Electr. & Comput. Eng., NC State Univ., Raleigh, NC ; Robert D. Callaway ; Michael Devetsikiotis ; George Michailidis

In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a utility-based framework to differentiate services based on both their relative profitability and quality-of-service requirements. Our performance metric is the end-to-end delay that a service class experiences in the network. We use network calculus to obtain a deterministic upper bound of this delay and we incorporate this information into our optimization problem formulation. We leverage a moving average control scheme to capture traffic shifts in real time, which makes our solution to react adaptively to traffic dynamics. Finally, we evaluate our system using real traces of instant messaging service traffic.

Published in:

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

Date of Conference:

Nov. 30 2008-Dec. 4 2008