M. Zhang, R. Y. Wang, L. Peterson, and A. Krishnamurthy.
Probabilistic Packet Scheduling:
Achieving Proportional Share Bandwidth Allocation.
Proc. INFOCOM 2002. June 2002.
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.