ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A New Approach for Asynchronous Distributed Rate Control of Elastic Sessions in Integrated Packet Networks

Abraham, Santosh P and Kumar, Anurag (2001) A New Approach for Asynchronous Distributed Rate Control of Elastic Sessions in Integrated Packet Networks. In: IEEE ACM Transactions on Networking, 9 (1). pp. 15-30.

[img] PDF
a-new-approach.pdf - Published Version
Restricted to Registered users only

Download (859kB) | Request a copy
Official URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=1...


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., minimum cell rates in the ATM context), and, under this constraint, we seek to allocate the max-min 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-based equivalent service capacity (ESC)], The ESC is obtained so as to satisfy an overflow probability constraint on the buffer length. For fixed available capacity at each link, we show that the vector of max-min 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 on-line 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 on-line estimation of the ESC is utilized. We also propose techniques for handling large variations in the available capacity owing to the arrivals or departures of CBR/VBR sessions. Finally, simulation results are provided to demonstrate the performance of this class of algorithms in the local and wide area network contest.

Item Type: Journal Article
Publication: IEEE ACM Transactions on Networking
Publisher: IEEE
Additional Information: Copyright 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 22 Aug 2008
Last Modified: 23 Feb 2012 05:28
URI: http://eprints.iisc.ac.in/id/eprint/1892

Actions (login required)

View Item View Item