A Distributed Scheme for Value-Based Bandwidth Reconfiguration

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.

[1]  Yutaka Yamauchi,et al.  Implementation issues on market-based QoS control , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[2]  Peter G. Taylor,et al.  WHAT IS A UNIT OF CAPACITY WORTH? , 2002, Probability in the Engineering and Informational Sciences.

[3]  Anthony E. Krzesinski,et al.  Some Properties of the Capacity Value Function , 2005, SIAM J. Appl. Math..

[4]  T. Chihara,et al.  An Introduction to Orthogonal Polynomials , 1979 .

[5]  Åke Arvidsson,et al.  High level B-ISDN/ATM traffic management in real time , 1994, Modelling and Evaluation of ATM Networks.

[6]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[7]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[8]  Demetres D. Kouvatsos.  Performance Modelling and Evaluation of ATM Networks , 2000, Comput. Networks.

[9]  Michael P. Wellman,et al.  A Market-Based Approach to Allocating QoS for Multimedia Applications , 1996 .

[10]  Peter G. Taylor,et al.  Dynamic reallocation of capacity in logically fully-connected networks , 2004 .

[11]  Qiong Wang,et al.  Optimal pricing in queueing systems with quality of service constraints , 1999 .

[12]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[13]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[14]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[15]  A. E. Krzesinski,et al.  A distributed scheme for bandwidth reallocation between working and recovery paths , 2006 .

[16]  Grzegorz W. KoŁodko,et al.  © Gordon and Breach, Science Publishers, Inc. , 1990 .

[17]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[18]  Douglas S. Reeves,et al.  QoS Rewards and Risks: A Multi-market Approach to Resource Allocation , 2000, NETWORKING.

[19]  Ward Whitt,et al.  Numerical Inversion of Laplace Transforms of Probability Distributions , 1995, INFORMS J. Comput..