Results 1 
6 of
6
A New Approach for Asynchronous Distributed Rate Control of Elastic Sessions in Integrated Packet Networks
 IEEE/ACM Trans. Networking
"... We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., MCRs in the ATM context), and, under this constraint, we seek to allocate the maxmin f ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., MCRs in the ATM context), and, under this constraint, we seek to allocate the maxmin fair rates to the sessions. We capture the integrated network context by permitting the link bandwidths available to elastic sessions to be stochastically time varying. The available capacity of each link is viewed as some statistic of this stochastic process (e.g., a fraction of the mean, or a large deviations Equivalent Service Capacity (ESC)). For fixed available capacity at each link, we show that the vector of maxmin fair rates can be computed from the root of a certain vector equation. A distributed asynchronous stochastic approximation technique is then used to develop a provably convergent distributed algorithm for obtaining the root of the equation, even when the link flows and the ...
A Weighted MaxMin Fair Rate Allocation for Available Bit Rate Service
 in Proceedings of the IEEE GLOBECOM
, 1997
"... An important concept in the ABR service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each connection. Because of the MCR and PCR constraints, the classical maxmin policy no longer suffices to determine rate allocation since it does not support eit ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
An important concept in the ABR service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each connection. Because of the MCR and PCR constraints, the classical maxmin policy no longer suffices to determine rate allocation since it does not support either the MCR or the PCR.
A distributed stochastic approximation approach for maxmin fair rate control of flows in packet networks
, 2006
"... We consider a distributed stochastic approximation algorithm that computes maxmin fair rate allocations to several elastic flows sharing a network (an elastic flow is one that can adapt its sending rate to the rate that the network can provide it). The flows are assumed to traverse a fixed sequence ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We consider a distributed stochastic approximation algorithm that computes maxmin fair rate allocations to several elastic flows sharing a network (an elastic flow is one that can adapt its sending rate to the rate that the network can provide it). The flows are assumed to traverse a fixed sequence of links in the network. The available capacities at the network links are modeled as stochastic processes. Each session can request a minimum rate guarantee, hence we work with a notion of maxmin fairness with minimum rates. A major part of this paper is the proof that the rate allocation computed by the stochastic approximation iterations converges to maxmin rate. 1
A Rate Allocation Policy with MCR/PCR Support and Distributed ABR Implementation Using Explicit Rate Feedback
, 1997
"... An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the min imum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the wellknown maxrain fairness pol ..."
Abstract
 Add to MetaCart
An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the min imum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the wellknown maxrain fairness policy no longer suffices to determine rate allocation in the ABR service model. We introduce a network bandwidth assignment policy, MURadd, which supports both the MCR and PCR requirements for each ABR virtual connection. A centralized algorithm is presented to compute networkwide bandwidth allocation to achieve this policy. Further more, an explicitrate (ER) based ABR switch algo rithm is developed to achieve the MCRadd policy in the distributed ABR environment and its convergence proof is also given. The performance of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the ATM Forum.
A New Approach for Asynchronous Distributed Rate Control of Elastic Sessions in Integrated Packet Networks
"... Abstract — We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., MCRs in the ATM context), and, under this constraint, we seek to allocate th ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., MCRs in the ATM context), and, under this constraint, we seek to allocate the maxmin fair rates to the sessions. We capture the integrated network context by permitting the link bandwidths available to elastic sessions to be stochastically time varying. The available capacity of each link is viewed as some statistic of this stochastic process (e.g., a fraction of the mean, or a large deviations Equivalent Service Capacity (ESC)). For fixed available capacity at each link, we show that the vector of maxmin fair rates can be computed from the root of a certain vector equation. A distributed asynchronous stochastic approximation technique is then used to develop a provably convergent distributed algorithm for obtaining the root of the equation, even when the link flows and the available capacities are obtained from online measurements. The switch algorithm does not require per connection monitoring, nor does it require per connection marking of control packets. A virtual buffer based approach for online estimation of the ESC is utilised. We also propose techniques for handling large variations in the available capacity owing to the arrivals or departures of CBR/VBR sessions. Finally, simulations results are provided to demonstrate the performance of this class of algorithms in the local and wide area network context. I.
A Rate Allocation Policy with MCR/PCR Support and Distributed ABR Implementation Using Explicit Rate Feedback *
"... An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the wellknown maxmin fairness policy ..."
Abstract
 Add to MetaCart
An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the wellknown maxmin fairness policy no longer sufices to determine rate allocation in the ABR service model. We introduce a network bandwidth assignment policy, MCRadd, which supports both the MCR and PCR requirements for each ABR virtual connection. A centralized algorithm is presented to compute networkwide bandwidth allocation to achieve this policy. Furthermore, an explicitrate (ER) based ABR switch algorithm is developed to achieve the MCRadd policy in the distributed ABR environment and its convergence proof is also given. The performance of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the