Dynamic reallocation of capacity in logically fully-connected networks

ABSTRACT

We study the benefits that can be realised when capacity reallocation schemes are implemented in telecommunications networks. Our basic model consists of a (possibly sparse) physical network above which is overlaid a logically fully-connected network. This is achieved by reserving capacity on the physical links for exclusive use by each origin-destination pair. If the capacity allocated to the origin-destination pairs is fixed, then such a network is likely to produce poor performance due to restriction of multiplexing opportunities. However, this effect can be largely negated by employing a capacity reallocation scheme, where capacity is moved in a dynamic fashion to areas where congestion is occurring. For such a scheme to be scalable, it is essential that it be distributed in nature. In this paper, we present three distributed, dynamic capacity reallocation schemes and compare their performance using a simulation model.

REFERENCES

• 1: Fayaz A. Shaikh , Stan McClellan , Manpreet Singh , Sannedhi K. Chakravarthy, End-to-End Testing of IP QoS Mechanisms, Computer, v.35 n.5, p.80-87, May 2002 [doi>10.1109/MC.2002.999779]
• 2: Fayaz A. Shaikh , Stan McClellan, Evaluation of End-to-End QoS Mechanisms in IP Networks, Proceedings of the First International Conference on Networking-Part 2, p.579-589, July 09-13, 2001
• 3: Hong-Hsu Yen , Frank Yeong-Sung Lin, Backbone Network Design with QoS Requirements, Proceedings of the First International Conference on Networking-Part 2, p.148-157, July 09-13, 2001
• 4: R. Guérin , V. Peris, Quality-of-service in packet networks: basic mechanisms and directions, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.31 n.3, p.169-189, Feb. 11, 1999 [doi>10.1016/S0169-7552(98)00261-X]
• 5: 5. Chakravorty R, Kar S, Perman F. Issues and architectures for better quality of service (QoS) from the internet. In Proceedings of the 6th National Conference on Communications (NCC-2000), New Delhi, India, 2000; 181-187.
• 6: 6. Gleeson B, Lin A, Heinanen J, Armitage G, Malis A. A framework for IP based virtual private networks, IETF RFC 2764, February 2000. The authors are of Lucent Technologies and the paper may be located online at: http://www.ietf.org/rfc.
• 7: Seung H. Rhee , Jaewoo Yoon , Heonjun Choi , Insoo Choi, Dynamic Capacity Resizing of Virtual Backbone Networks, Proceedings of the First International Conference on Networking-Part 1, p.698-707, July 09-13, 2001
• 8: 8. Garg R, Saran H. Fair bandwidth sharing among virtual networks: a capacity resizing approach. In Proceedings of INFOCOM, Tel Aviv, Israel, March 2000;255-264.
• 9: N. G. Duffield , Pawan Goyal , Albert Greenberg , Partho Mishra , K. K. Ramakrishnan , Jacobus E. van der Merive, A flexible model for resource management in virtual private networks, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.95-108, August 30-September 03, 1999, Cambridge, Massachusetts, United States
• 10: 10. Hui JY. Resource allocation for broadband networks. IEEE Journal on Selected Areas in Communications 1988; SAC-6(9): 1598-1608.
• 11: 11. Kelly FP. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications, Kelly FP, Zachary S, Ziedins IB, (eds). Royal Statistical Society Lecture Notes Series 4, Oxford University Press, 1996; 141-168.
• 12: Anwar I. Elwalid , Debasis Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE/ACM Transactions on Networking (TON), v.1 n.3, p.329-343, June 1993 [doi>10.1109/90.234855]
• 13: Vern Paxson , Sally Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking (TON), v.3 n.3, p.226-244, June 1995 [doi>10.1109/90.392383]
• 14: Will E. Leland , Murad S. Taqqu , Walter Willinger , Daniel V. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking (TON), v.2 n.1, p.1-15, Feb. 1994 [doi>10.1109/90.282603]
• 15: 15. Hohn N, Veitch D, Abry P. Cluster processes, a natural language for network traffic. Technical report, Centre for Ultra-Broadband Information Networks, 19 Department of Electrical and Electronic Engineering, University of Melbourne, Victoria 3010, Australia.
• 16: 16. Awduche D, Berger L, Gan D, Li T, Srinivasan V, Swallow G. RSVP-TE: extensions to RSVP for LSP tunnels. IETF RFC 3209, December 2001, date of access January 2003.
• 17: 17. Arvidsson Å, de Kock JM, Krzesinski AE, Taylor PG. Cost-effective deployment of bandwidth partitioning in broadband networks, to appear in Telecommunications Systems.
• 18: 18. Kelly FP. Blocking probabilities in large circuit switched networks. Advances in Applied Probability 1986; 18: 473-505.
• 19: 19. Kelly FP. Loss networks. Annals of Applied Probability 1991; 1: 319-378.
• 20: 20. Whitt W. Blocking when service is required from several facilities simultaneously. AT&T Technical Journal 1985; 64: 1807-1856.
• 21: Keith W. Ross , Peter J. Hancock, Multiservice Loss Models for Broadband Telecommunication Networks, Springer-Verlag New York, Inc., Secaucus, NJ, 1995
• 22: 22. Cheng J, Qian C, Jamin S. Inet: Internet Topology Generator . Technical report, University of Michigan, Ann Arbor, MI 48109-2122, USA, 2000.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.3 Network Operations
          Subjects: Network management

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network topology
      C.2.6 Internetworking
          Subjects: Routers
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Reliability, availability, and serviceability

General Terms:
Experimentation, Management, Performance, Theory