Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Probabilistic packet scheduling: achieving proportional share bandwidth allocation for TCP flows
2002 / IEEE / 0-7803-7476-2
This item was taken from the IEEE Conference ' Probabilistic packet scheduling: achieving proportional share bandwidth allocation for TCP flows ' This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router defines a local currency in terms of tickets 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 each flow obtains is proportional to the relative tickets assigned to that flow. Simulations show that PPS does a better job of proportionally allocating bandwidth than DiffServ and weighted CSFQ. In addition, PPS accommodates flows that cross multiple currency domains.
Quality Of Service
Telecommunication Congestion Control
Telecommunication Network Routing
Multiple Currency Domains
Probabilistic Packet Scheduling
Levels Of Service
Computer Network Management
Proportional Share Bandwidth Allocation