A Distributed Scheme for Value-Based Bandwidth Reconfiguration

  • Åke Arvidsson
  • Johannes Göbel
  • Anthony Krzesinski
  • Peter Taylor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5464)


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.


bandwidth prices bandwidth reconfiguration distributed control network planning and optimisation scalability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Krzesinski, A., Müller, K.: A distributed scheme for bandwidth re-allocation between working and recovery paths. In: South African Institute for Computer Scientists and Information Technologists SAICSIT 2006, South Africa, October 2006, pp. 135–144 (2006)Google Scholar
  2. 2.
    Liu, Y., Tipper, D., Siripongwutikorn, P.: Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Transactions on Networking 13(1), 198–211 (2005)CrossRefGoogle Scholar
  3. 3.
    Lanning, S., Massey, W., Rider, B., Wang, Q.: Optimal pricing in queueing systems with quality of service constraints. In: 16th International Teletraffic Congress, pp. 747–756 (1999)Google Scholar
  4. 4.
    Fulp, E., Reeves, D.: QoS rewards and risks: A multi-market approach to resource allocation. In: Pujolle, G., Perros, H.G., Fdida, S., Körner, U., Stavrakakis, I. (eds.) NETWORKING 2000. LNCS, vol. 1815, pp. 945–956. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Kelly, F., Mualloo, A., Tan, D.: Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252 (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Low, S., Lapsley, D.: Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Trans. on Networking 7(6), 861–874 (1999)CrossRefGoogle Scholar
  7. 7.
    Chiera, B., Taylor, P.: What is a unit of capacity worth? Probability in the Engineering and Informational Sciences 16(4), 513–522 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chihara, T.: An Introduction to Orthogonal Polynomials. Gordon and Breach, Science Publishers Inc., Aachen, Germany (1978)Google Scholar
  9. 9.
    Chiera, B., Krzesinski, A., Taylor, P.: Some properties of the capacity value function. SIAM Journal on Applied Mathematics 65(4), 1407–1419 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Abate, J., Whitt, W.: Numerical inversion of laplace transforms of probability distributions. ORSA Journal on Computing 7(1), 36–43 (1995)CrossRefzbMATHGoogle Scholar
  11. 11.
    Arvidsson, Å., Krzesinski, A.: A model for TCP traffic. In: 15th International Teletraffic Congress Specialist Seminar, pp. 68–77 (2002)Google Scholar
  12. 12.
    Arvidsson, Å., Chiera, B., Krzesinski, A., Taylor, P.: A simulation of a bandwidth market. In: Technical Report, Department of Computer Science. University of Stellenbosch, 7600 Stellenbosch, South Africa (2006)Google Scholar
  13. 13.
    Arvidsson, Å.: High level B-ISDN/ATM traffic management in real time. In: Kouvatsos, D. (ed.) Performance Modelling and Evaluation of ATM Networks, vol. 1, pp. 177–207. Chapman & Hall, London (1994)Google Scholar
  14. 14.
    Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karslruhe, Germany, December 2003, pp. 313–324 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Åke Arvidsson
    • 1
  • Johannes Göbel
    • 2
  • Anthony Krzesinski
    • 3
  • Peter Taylor
    • 4
  1. 1.Ericsson AB, Packet Technologies ResearchStockholmSweden
  2. 2.Department of InformaticsUniversity of HamburgHamburgGermany
  3. 3.Department of Mathematical SciencesUniversity of StellenboschStellenboschSouth Africa
  4. 4.Department of Mathematics and StatisticsUniversity of MelbourneParkvilleAustralia

Personalised recommendations