Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Dynamic-CBT and ChIPS—router support for improved multimedia performance on the Internet
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
BLUE: an alternative approach to active queue management
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
QoS-Sensitive Transport of Real-Time MPEG Video using Adaptive Forward Error Correction
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
IEEE Network: The Magazine of Global Internetworking
ABE: providing a low-delay service within best effort
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The Internet, which has traditionally supported throughput-sensitive applications such as email and file transfer, is increasingly supporting delay-sensitive multimedia applications such as interactive audio. These delay-sensitive applications would often rather sacrifice some throughput for lower delay. Unfortunately, the current Internet does not offer choices in the amount of delay or throughput an application receives, but instead provides monolithic best-effort service to all applications. This paper proposes and evaluates a new Active Queue Management (AQM) technique that employs source hints to provide service at network routers that is sensitive to the Quality of Service (QoS) expectations for a variety of applications. Applications indicate their delay or throughput sensitivity via a delay hint in their outgoing packets. The router, which we call RED-Boston, uses the delay hints to dynamically adjust the router to yield better delay performance for delay-sensitive applications and better throughput for throughput-sensitive applications. Using a new QoS metric, our simulations demonstrate that RED-Boston yields higher QoS than an adaptive version of RED for both throughput-sensitive flows and delay-sensitive flows. RED-Boston operates equally well in all traffic scenarios and fits the current best-effort Internet environment without requiring traffic monitoring.