Download:
|
by Haifeng Zhu, Aimin Sang, San-qi Li
Computer Communications
http://www.andrew.cmu.edu/~haifengz/scale-wfs/scale-wfs.ps.gz
Add To MetaCart
Abstract:
Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling- Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal Max-Min weighted fairness without per-flow management at core routers, in the context of differentiated service networks. Through extensive simulation and simple analysis, we show the performance problems with current solutions and propose SCALE-WFS to solve these problems. This scheme works effectively for different flow weights, RTTs, protocols (TCP and UDP), under the scenarios of different bandwidth provisioning and multiple congested gateways, all of which we consider the basic requirements for a practical solution. 2) Apart from “per-flow ” and completely “core-stateless”, SCALE represents a third management level---the label-based flow “aggregation ” level. It reduces the information redundancy in the “per-flow ” and surpasses the performance of the “core-stateless”. This is important to differentiated service networks where we try to avoid the non-scalability of per-flow management while keeping its good Quality of Services. In this paper, we show that SCALE-WFS is effective and scalable, robust and extensible.
Citations
|
939
|
Analysis and Simulation of a Fair Queueing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
335
|
Dynamics of random early detection
– Lin, Morris
- 1997
|
|
327
|
Specification of the Controlled-Load Network Element Service, RFC 2211
– Wroclawski
- 1997
|
|
297
|
Explicit Allocation of Best Effort Packet Delivery Service”, http:// www.ietf.org/html.charters/diffserv-charter.html
– Clark
|
|
171
|
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
– Stoica, Shenker, et al.
- 1998
|
|
106
|
An Expedited Forwarding
– Jacobson, Nichols, et al.
- 1999
|
|
103
|
The Use of RSVP with
– Wroclawski
- 1997
|
|
72
|
Specification of Guaranteed Quality of
– Service, Partridge, et al.
- 1997
|
|
71
|
Experiments with a layered transmission scheme over the Internet
– Turletti, Parisis, et al.
- 1997
|
|
42
|
Random early detection for congestion avoidance
– Floyd, Jacobson
- 1993
|
|
36
|
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
– Cao, Wang, et al.
- 2000
|
|
23
|
A Two Rate Three
– Heinanen, Finland, et al.
|
|
21
|
bandwidth sharing among adaptive and nonadaptive flows in the Internet
– Anjum, Tassiulas, et al.
- 1999
|
|
4
|
Narasimha Reddy, “Impact of marking strategy on aggregated flows in a differentiated services network
– Yeom, L
- 1999
|
|
2
|
Cnodder, “A Rate Adaptive Shaper for Differentiaed Services,” Internet
– Bonaventure, De
|
|
2
|
Techniques for Explicit Feedback
– Satyavolu, Duvedi, et al.
- 1999
|
|
1
|
How to Make Assured Service More Assured,” ICNP 99
– Lin, Zheng, et al.
- 1994
|
|
1
|
A Feedback Control Extension
– Chow, Leon-arcia
|
|
1
|
CHOKe, A statless active queue management scheme for approximating fair bandwidth allocation
– Pan, Prabhakar, et al.
- 2000
|
