by Qingming Ma, Peter Steenkiste, Hui Zhang
http://www.cs.cmu.edu/~qma/sigcomm96.ps
Add To MetaCart
Abstract:
We study how to improve the throughput of high-bandwidth traffic such as large file transfers in a network where resources are fairly shared among connections. While it is possible to devise priority or reservation-based schemes that give high-bandwidth traffic preferential treatment at the expense of other connections, we focus on the use of routing algorithms that improve resource allocation while maintaining max-min fair share semantics. In our approach, routing is closely coupled with congestion control in the sense that congestion information, such as the rates allocated to existing connections, is used by the routing algorithm. To reduce the amount of routing information that must be distributed, an abstraction of the congestion information is introduced. Using an extensive set of simulation, we identify a link-cost or cost metric for "shortest-path " routing that performs uniformly better than the minimal-hop routing and shortest-widest path routing algorithms. To further improve throughput without reducing the fair share of single-path connections, we propose a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths. This leads to a conservative extension of max-min fairness called prioritized multi-level max-min fairness. Simulation results confirm the advantages of our multi-path routing algorithm.
Citations
|
939
|
Analysis and Simulation of a Fair Queueing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
227
|
An Overview of the New Routing Algorithm for the ARPANET
– McQuillan, Richer, et al.
- 1995
|
|
159
|
Bottleneck flow control
– Jaffe
- 1981
|
|
130
|
The Rate-Based Flow Control Framework for the Available Bit Rate
– Bonomi, Fendick
- 1995
|
|
100
|
Congestion Control With Explicit Rate Indication
– Charny, Clark, et al.
- 1995
|
|
82
|
A Note on Two
– Dijkstra
|
|
74
|
QoS Routing for Supporting Resource Reservation
– Wang, Crowcroft
- 1996
|
|
57
|
A Scheduling Service Model and a Scheduling Architecture for an Integrated Service Packet Network
– Shenker, Clark, et al.
- 1993
|
|
47
|
Routing Techniques Used in Computer Communication Networks
– Schwartz, Stern
- 1980
|
|
45
|
The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical Routing
– Akinpelu
- 1984
|
|
41
|
Shortest Path First with Emergency Exits
– Wang, Crowcroft
- 1991
|
|
35
|
Adding Service Discrimination to the Internet
– Clark
- 1995
|
|
32
|
Dynamic Multipath Routing and How it Compares with Other Dynamic Routing Algorithms for High Speed Wide Area Networks
– Bahk, Elzarki
- 1992
|
|
32
|
Inter-Domain Policy Routing Protocol Speci�cation: Version 1
– Steenstrup
- 1992
|
|
30
|
Dynamic Alternative Routing | Modelling and Behaviour
– Gibbens, Kelley, et al.
- 1988
|
|
28
|
A Simulation Study of Adaptive Source Routing in Integrated Service Networks
– Breslau, Estrin, et al.
- 1993
|
|
27
|
Fast Bandwidth Reservation Scheme with Multi-link and Multi-path Routing in ATM Networks
– Suzuki, Tobagi
- 1992
|
|
22
|
Finding Near-Optimal Cuts: An Empirical Evaluation
– Lang, Rao
- 1993
|
|
17
|
Towards a universal data transport system
– Fraser
- 1983
|
|
15
|
Scalability Issues for Distributed Explicit Rate Allocation in ATM
– Charny, Ramakrishnan, et al.
- 1996
|
|
10
|
An Extended Least-hop Distributed Routing Algorithm
– Nelson, Sayood, et al.
- 1990
|
|
9
|
Scalable Routing Based on Link-State Vectors
– Distributed
- 1994
|
|
6
|
The Art of Computer Performance Analysis
– Jain
- 1991
|
|
5
|
A Multi-level Explicit Rate Control Scheme for ABR Traffic with Heterogeneous Service Requirements
– Liebeherr, Akyildiz, et al.
- 1996
|
|
1
|
Adaptive Multipath Routing of Connectionless Traffic in an ATM Network
– Sole-Pareta, Sarkar, et al.
- 1995
|
