151. The Asymmetric Best-Effort Service
- Author
-
Patrick Thiran, Paul Hurley, and J.-Y. Le Boudec
- Subjects
Router ,Earliest deadline first scheduling ,Computer science ,Real-time computing ,Throughput ,Random early detection ,TCP Friendliness ,Active queue management ,Scheduling (computing) ,Packet Admission Control ,Packet switching ,Packet loss ,Best-effort delivery ,Jitter ,Queueing theory ,Network packet ,business.industry ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,real-time traffic ,Admission control ,Differentiated services ,Asymmetric Best-Effort ,business ,Active Queue Management ,Computer network ,ABE - Abstract
We present the asymmetric best-effort (ABE), a novel service to provide a "throughput versus delay jitter" service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-time applications such as interactive audio, receive more losses during bouts of congestion than blue ones. In return, they-receive a smaller bounded queueing delay. Both green and blue services are best-effort. The incentive to choose one or other is based on the nature of one's traffic and on the traffic conditions. If applications are TCP-friendly, an application sending blue packets will receive more throughput but also more delay jitter, than it would if it sent green packets for a given network state and path. Service provision at each co-operating router can be achieved by packet admission control (PAC) and scheduling. We develop and simulate an initial algorithm that supports this service whose first results show the feasibility of the service.