Fair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach

نویسندگان

  • Rahul Garg
  • Huzur Saran
چکیده

Virtual Private Networks (VPN) and link sharing are cost effective way 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 [1] and virtual private networks [2], their statistical multiplexing gains are limited. Recently capacity resizing of Virtual Leased Links (VLLs) has been proposed to obtain better statistical multiplexing gains. Carrying out capacity resizing naively may result into unfair distribution of capacities among different VPNs. This is a serious problem especially because the VPN customers who pay for the service expect a well defined grade of service and protection from other misbehaving customers sharing the same infrastructure. We propose a new scheme called Stochastic Fair Sharing (SFS) to carry out fair link sharing and fair sharing among VLLs. 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 case of multi-hop VLLs, capacity resizing requests are sent in the service proviers’s network which are admission controlled using SFS. Our simulations indicate that using SFS, 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Multi-beam Satellite Systems With A New Bandwidth Sharing Algorithm

An efficient resource allocation is important to guarantee the best performance with a fair distribution of multi-beam satellite capacity to provide satellite multimedia and broadcasting services. In this way, available bandwidth and capacity problems in new satellite system likes Multi-Input-Multi-Output (MIMO), exploring new techniques for enhancing spectral efficiency in satellite communicat...

متن کامل

Virtual private network bandwidth management with traffic prediction

Dynamic link resizing is an attractive approach for resource management in virtual private networks (VPNs) serving modern real-time and multimedia traffic. In this paper, we assess the use of linear traffic predictors to dynamically resize the bandwidth of VPN links. We present the results of performance comparisons of three predictors: Gaussian, autoregressive moving average (ARMA) and fractio...

متن کامل

Capacity dimensioning of VPN access links for elastic traffic

This paper discusses research into the capacity dimensioning of Virtual Private Network (VPN) access links for elastic traffic, such as the Web or ftp. Assuming that the coreVPN network is provisioned with a sufficiently large capacity, managing the capacity of the VPN access link comes to sharing the bandwidth for the elastic traffic of the two bottlenecks, the ingress and egress access links....

متن کامل

Bandwidth Scheduling for Wide - Area ATMNetworks Using Virtual

| This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area ATM networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buuers. Packetized generalized processor sharing is brieey discussed and a minimum-bandwidth result for self-clocked f...

متن کامل

Fair Virtual Bandwidth Allocation Model in Virtual Data Centers

Network virtualization opens a promising way to support diverse applications over a shared substrate by running multiple virtual networks. Current virtual data centers in cloud computing have flexible mechanisms to partition compute resources but provide little control over how tenants share the network. This paper proposes a utility-maximization model for bandwidth sharing between virtual netw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000