Abstract
This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies of distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max-min (GMM) and the generic weight-proportional max-min (WPMM) policies, both of which generalize the classical max-min rate allocation policy. For the design of distributed algorithms to achieve these two rate allocation policies, we focus on rate-based distributed flow control where special control packets are employed to achieve the information exchange between a source and the network. We categorize two broad classes of distributed rate calculation algorithms in the literature using live algorithms as illustrations. We compare the design tradeoffs between these two classes of algorithms in terms of performance objectives and implementation complexities and discuss important extensions within each class of algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 2-20 |
Number of pages | 19 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 3530 |
DOIs | |
State | Published - 1998 |
Event | Performance and Control of Network Systems II - Boston, MA, United States Duration: Nov 2 1998 → Nov 4 1998 |
Keywords
- ABR
- ATM
- Congestion and flow control algorithms
- Explicit rate feedback
- Max-min fairness
- Minimum rate
- Packet switching networks
- Peak rate
- Per flow accounting
- Per flow queuing
- Rate allocation policy
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering