DocumentCode :
1832713
Title :
Fair bandwidth sharing among virtual networks: a capacity resizing approach
Author :
Garg, Rahul ; Saran, Huzur
Author_Institution :
IBM Indian Res. Lab., Indian Inst. of Technol., Delhi, India
Volume :
1
fYear :
2000
fDate :
2000
Firstpage :
255
Abstract :
Virtual private networks (VPN) and link sharing are cost-effective ways of realizing corporate intranets. Corporate intranets will increasingly have to provide integrated services for voice and multimedia traffic. Although packet scheduling algorithms can be used to implement integrated services in link sharing and virtual private networks, their statistical multiplexing gains are limited. We propose a new scheme called stochastic fair sharing (SFS) to carry out fair link sharing and fair sharing among virtual leased links (VLL). In the link sharing environment, capacities allocated to different classes are adjusted dynamically as sessions arrive (or depart). The SFS admission control algorithm decides which sessions to accept and which to reject depending upon the current utilizations and provisioned capacities of the classes. SFS gives protection to classes with low session arrival rate against classes with high session arrival rates by ensuring them a low blocking probability. In the case of multi-hop VLL, capacity resizing requests are sent in the service providers´s network which are admission-controlled using SFS. Our simulations indicate that using SFS, the equivalent capacity of virtual links converge to their max-min fair capacity, with a fairness index of 0.97 in extreme situations. The average signaling load of the protocol was found to be reasonable. The scheme is simple to implement, efficient, and robust. The potential applications of SFS are fair and efficient resource sharing in telecommunication networks, ATM networks, virtual private networks (VPN) and integrated services or differentiated services-based IP networks
Keywords :
asynchronous transfer mode; bandwidth allocation; business communication; channel capacity; intranets; minimax techniques; multimedia communication; probability; protocols; quality of service; queueing theory; stochastic processes; telecommunication congestion control; telecommunication signalling; telecommunication traffic; voice communication; ATM networks; IP networks; VPN; admission control algorithm; blocking probability; capacity resizing; corporate intranets; differentiated services; dynamic allocation; fair bandwidth sharing; integrated services; link sharing; max-min fair capacity; multi-hop VLL; multimedia traffic; protocol; signaling load; stochastic fair sharing; telecommunication networks; virtual leased links; virtual private networks; voice traffic; Admission control; Bandwidth; Intserv networks; Protection; Protocols; Scheduling algorithm; Spread spectrum communication; Stochastic processes; Telecommunication traffic; Virtual private networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
Tel Aviv
ISSN :
0743-166X
Print_ISBN :
0-7803-5880-5
Type :
conf
DOI :
10.1109/INFCOM.2000.832195
Filename :
832195
Link To Document :
بازگشت