Abstract
We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) flow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network configuration and any set of link distances.
Original language | English (US) |
---|---|
Pages (from-to) | 1366-1375 |
Number of pages | 10 |
Journal | Proceedings - IEEE INFOCOM |
Volume | 3 |
State | Published - 1998 |
Event | Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA Duration: Mar 29 1998 → Apr 2 1998 |
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering