Loading...
Please wait, while we are loading the content...
Similar Documents
Routing High-bandwidth Traffic in Max-min Fair Share Networks (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ma, Qingming Steenkiste, Peter Zhang, Hui |
| Description | 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... |
| File Format | |
| Language | English |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Minimal-hop Routing High-bandwidth Traffic Preferential Treatment Routing Algorithm Max-min Fair Share Semantics Large File Transfer Shortest-widest Path Congestion Control Max-min Fair Share Network Resource Allocation Extensive Set Congestion Information High-bandwidth Traffic Reservation-based Scheme |
| Content Type | Text |
| Resource Type | Article |
