On-line routing and bandwidth allocation for elastic traffic and for its restoration

Péter Laborczi, T. Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 centralised 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 centralised 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 utilisation and computational time. We show that they yield lower blocking ratio and higher network utilisation than conventional shortest path methods.

Original languageEnglish
Title of host publicationNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium
DOIs
Publication statusPublished - 2007
EventNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium - New Delhi, India
Duration: Nov 6 2006Nov 9 2006

Other

OtherNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium
CountryIndia
CityNew Delhi
Period11/6/0611/9/06

Fingerprint

Frequency allocation
Restoration
Bandwidth
Complex networks
Throughput
Availability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Laborczi, P., & Cinkler, T. (2007). On-line routing and bandwidth allocation for elastic traffic and for its restoration. In Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium [4082407] https://doi.org/10.1109/NETWKS.2006.300372

On-line routing and bandwidth allocation for elastic traffic and for its restoration. / Laborczi, Péter; Cinkler, T.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Laborczi, P & Cinkler, T 2007, On-line routing and bandwidth allocation for elastic traffic and for its restoration. in Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium., 4082407, Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium, New Delhi, India, 11/6/06. https://doi.org/10.1109/NETWKS.2006.300372
Laborczi P, Cinkler T. On-line routing and bandwidth allocation for elastic traffic and for its restoration. In Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. 2007. 4082407 https://doi.org/10.1109/NETWKS.2006.300372
Laborczi, Péter ; Cinkler, T. / On-line routing and bandwidth allocation for elastic traffic and for its restoration. Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. 2007.
@inproceedings{b2917b46112d4ed3bec3949b9b95c518,
title = "On-line routing and bandwidth allocation for elastic traffic and for its restoration",
abstract = "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 centralised 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 centralised 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 utilisation and computational time. We show that they yield lower blocking ratio and higher network utilisation than conventional shortest path methods.",
author = "P{\'e}ter Laborczi and T. Cinkler",
year = "2007",
doi = "10.1109/NETWKS.2006.300372",
language = "English",
isbn = "3800729997",
booktitle = "Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium",

}

TY - GEN

T1 - On-line routing and bandwidth allocation for elastic traffic and for its restoration

AU - Laborczi, Péter

AU - Cinkler, T.

PY - 2007

Y1 - 2007

N2 - 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 centralised 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 centralised 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 utilisation and computational time. We show that they yield lower blocking ratio and higher network utilisation than conventional shortest path methods.

AB - 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 centralised 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 centralised 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 utilisation and computational time. We show that they yield lower blocking ratio and higher network utilisation than conventional shortest path methods.

UR - http://www.scopus.com/inward/record.url?scp=44949222777&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44949222777&partnerID=8YFLogxK

U2 - 10.1109/NETWKS.2006.300372

DO - 10.1109/NETWKS.2006.300372

M3 - Conference contribution

SN - 3800729997

SN - 9783800729999

BT - Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium

ER -