A distributed scheme for value-based bandwidth reconfiguration
Date
2009
Authors
Arvidsson A.
Gobel J.
Krzesinski A.
Taylor P.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper presents a scheme for reallocating bandwidth in path-oriented transport networks. At random time points, bandwidth is allocated to those paths that (possibly temporarily) value it most highly. The scheme acts according to local rules and without centralised control. The proposed scheme is thus distributed and scalable. Previous studies have shown that bandwidth reallocation, together with the provision of appropriate amounts of spare capacity on certain links, can be used to rapidly deploy and capacitate equivalent recovery routes in the event of network equipment failure. The purpose of this study is to determine if the same reallocation mechanism can also deal effectively with repeated, small scale random traffic fluctuations and with time varying traffics. We present a simulation model of a 30-node 46-link network which we use to evaluate the efficacy of the bandwidth reallocation scheme. The simulation study shows that bandwidth reconfiguration can substantially reduce the connection loss probabilities. © 2009 Springer Berlin Heidelberg.
Description
Keywords
Bandwidth prices, Bandwidth reallocation, Bandwidth reconfiguration, Connection loss, Distributed control, Distributed schemes, Local rules, Network equipment, Network planning and optimisation, Simulation model, Simulation studies, Small scale, Spare capacity, Time points, Time varying, Traffic fluctuations, Transport networks, Value-based, Internet, Scalability, Simulators, Bandwidth
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5464 LNCS
5464 LNCS