By Topic

A self-sizing framework for adaptive resource allocation in label-switched 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
$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

2 Author(s)
Wentao Shen ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada ; Devetsikiotis, M.

For adaptive resource allocation to maintain its crucial timing requirements in large-scale networks, fast analysis and synthesis algorithms are required in order to process freshly collected traffic data. In this paper we build on previous work to introduce a general measurement-based self-sizing framework for resource allocation in label-switched networks. Furthermore, we study the scaling behavior of the simulated annealing variant used in the analysis and synthesis algorithm. We propose a hierarchical approach to improve adaptation performance for large networks and include extensive simulation results indicating significant improvement in performance as networks get larger.

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on

Date of Conference:

2002