MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows (2002) [7 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Ming Zhang, Y Wang, Larry Peterson, Arvind Krishnamurthy
Proc. IEEE INFOCOM 2002
http://lambda.cs.yale.edu/~arvind/papers/ticket.ps
Add To MetaCart

Abstract:

This paper describes and evaluates a probabilistic packet scheduling algorithm for providing different level of service for TCP flows. With our approach, each router in the network defines its currency in terms of ticket, and assigns tickets to its inputs based on contractual agreements with its upstream routers. A flow is tagged with tickets to represent the relative share of bandwidth it should receive at each link. When multiple flows share the same bottleneck, the bandwidth that one flow obtains from the bottleneck link is proportional to the relative tickets of that flow. 1

Citations

1790 Congestion avoidance and control – Jacobson - 1988
1681 Random Early Detection Gateways for Congestion Avoidance – Floyd, Jacobson - 1993
939 Analysis and Simulation of a Fair Queueing Algorithm – Demers, Keshav, et al. - 1989
470 Integrated Services in the Internet Architecture: an Overview", RFC 1633 – Braden, Clark, et al. - 1994
390 Charging and rate control for elastic traffic – Kelly - 1997
335 Dynamics of random early detection – Lin, Morris - 1997
329 Lottery Scheduling: Flexible Proportional-Share Resource Management – Waldspurger, Weihl - 1994
321 Optimization flow control — I: basic algorithm and convergence – Low, Lapsley - 1999
297 Explicit Allocation of Best Effort Packet Delivery Service”, http:// www.ietf.org/html.charters/diffserv-charter.html – Clark
218 Providing Guaranteed Services Without Per Flow Management – Stoica, Zhang - 1999
171 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks – Stoica, Shenker, et al. - 1998
96 SRED: stabilized red – Ott, Lakshman, et al. - 1999
80 CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation – Pan, Prabhakar, et al. - 2000
78 An Approach to Service Allocation – Clark, Wroclawski - 1997
61 Oechslin Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP – Crowcroft, P - 1998
22 User-share differentiation (USD) scalable bandwidth allocation for differentiated services – Wang - 1997
21 bandwidth sharing among adaptive and nonadaptive flows in the Internet – Anjum, Tassiulas, et al. - 1999
18 Lottery scheduling: Flexible proportional share resource management – Waldspurger, Weihl - 1994
11 An approach to service allocation – Nichols, Jacobson, et al. - 1997
6 Integrated services in the Internet architecture: an overview. Internet RFC 1633 – Shenker, Braden, et al. - 1994