Fair Network Bandwidth Allocation with Minimum Rate Guarantee and its ABR Implementations
نویسندگان
چکیده
A novel concept in available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) bandwidth guarantee for each connection. In this paper, we present a network bandwidth allocation policy to support each ABR connection’s MCR requirement, as well as its peak cell rate (PCR) constraint. Furthermore, we develop two explicit-rate (ER) based ABR algorithms consistent with the ATM Forum ABR traffic management framework to achieve this rate allocation policy. The first ABR implementation is a simple heuristic algorithm which does not require perlVC accounting. It requires minimal implementation complexity and offers satisfactory performance in a LAN environment. The second ABR implementation employs per-VC accounting and is proven to converge to our rate allocation policy for any network topology and any set of link distances.
منابع مشابه
On Fair Rate Allocation Policies with Minimum Cell Rate Guarantee for ABR Service in ATM Networks
A novel concept in available bit rate (ABR) service model as de ned by the ATM Forum is the minimum cell rate (MCR) support for each ABR virtual connection. In this paper, we present a fundamental study of rate allocation policies with MCR guarantee. In particular, we de ne three network bandwidth allocation policies that guarantee MCR requirements. For each policy, we present a centralized alg...
متن کاملA parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic
We consider the fair bandwidth allocation problem of ABR calls by a Connection Admission Controller (CAC) at call setup. Its general solution is given by applying the “max-min fairness allocation policy”. Extensions of this policy take into account the Minimum Cell Rate (MCR) and the Peak Cell Rate (PCR) traffic description parameters, which are essential for ABR. These extensions are distingui...
متن کاملMax-Min Fair Rate Control of ABR Connections with Nonzero MCRs
Traac sources that do not have intrinsic temporal characteristics are expected to be transported over ATM networks using the Available Bit Rate (ABR) service. These sources are amenable to reactive ow control and are expected to use bandwidth left over after servicing the guaranteed QoS services (CBR and VBR). Fair allocation of the available bandwidth to competing ABR connections is based on t...
متن کاملA Simple ABR Switch Algorithm for the Weighted Max - Min Fairness Policy *
An important concept in the A B R service model is the minimum cell rate ( M C R ) guarantee as well as the peak cell rate (PCR) constraint for each A B R virtual connection. Due to the M C R and P C R requirements, the well-known max-min fairness policy is not suficient to determine the fair rate allocation in the ABR service model. W e present the weighted max-min ( W M M ) fairness policy, w...
متن کاملAn Efficient Scheme of General Weighted Fair Allocation for Enhanced Best-Effort Service in High Speed Networks
This research is focused on enhanced best-effort service, which provides the minimum bandwidth guarantee and distributes the available bandwidth fairly to packet flows in a high speed network. These goals can be reached when the bandwidth allocation is general weighted (GW) fair among the flows. GW fairness ensures the minimum rate for every flow and, furthermore, allocates the excess bandwidth...
متن کامل