By Topic

On-line Routing and Bandwidth Allocation for Elastic Traffic and for its Restoration

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

2 Author(s)
Peter Laborczi ; Bay Zoltán Foundation for Applied Research, H-1116 Budapest, Fehérvári út 130., E-mail:, Phone: +36-1-463 0510 Fax: +36-1-463 0506 ; Tibor Cinkler

In infocommunications networks the amount of free network resources varies in time significantly. Furthermore, after a network failure a large amount of backup paths are built up and later torn down. To achieve the highest possible network throughput and availability while keeping the loss of data low and guaranteeing fairness, the bandwidth (rate) of sources should be adjusted accordingly in an elastic way. After a complex network failure the path of the demand should be changed (re-routed) as well as its bandwidth likely decreased. Existing papers study the case when the traffic matrix is given in advance and centralized management is assumed. In contrast to these we investigate the case of on-line (i.e., dynamic) routing when unpredictable backup or new demands arrive in an unforeseen sequence. For this purpose instead of the centralized management we use distributed control. We propose flexible methods that determine the bandwidth of elastic sources and the routes used by these demands simultaneously. We evaluate the algorithms according to the obtained blocking ratios, network utilization and computational time. We show that they yield lower blocking ratio and higher network utilization than conventional shortest path methods

Published in:

Networks 2006. 12th International Telecommunications Network Strategy and Planning Symposium

Date of Conference:

6-9 Nov. 2006