Cart (Loading....) | Create Account
Close category search window

Network Decomposition in Practice: An Application to Optimal Resource Allocation

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

3 Author(s)
Kallitsis, M.G. ; Dept. of Stat., Univ. of Michigan, Ann Arbor, MI, USA ; Michailidis, G. ; Devetsikiotis, M.

In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates resources to network services with specific quality-of-service requirements. Finally, we evaluate our framework and compare its performance against a system utilizing deterministic bounds obtained from network calculus.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.