Crimson - Traffic Aware Active Queue Management Mark Claypool WPI ABSTRACT: Internet routers increasingly carry traffic for applications with a wide range of delay and loss requirements and traffic that has a wide range of data rates and connection times. The diversity of traffic poses challenges for managing congestion since not all packet drops, the primary indicators of congestion, have an equal impact on overall performance and on the Quality of Service (QoS) of individual applications. Unfortunately, current Active Queue Management (AQM) techniques, which attempt to improve the performance over current Internet drop-tail routers, are not able to provide applications with a choice in QoS nor are they able to assess the impact on QoS or performance from the packets they drop. As a proposed solution, we have set forth the Crimson architecture in which end-hosts provide additional information called source hints inside each packet sent. Using these source hints, core routers can make informed decisions about the effects on QoS and performance of packet drops without the overhead of keeping per-flow state. Edge-routers, which typically can keep some per-flow state, monitor the source hints to prevent misbehaving hosts from obtaining an unfair performance advantage by using false hints. Simulations over a range of traffic conditions show Crimson provides a higher QoS than current AQM approaches for both traditional and interactive flows. In addition, Crimson protects short-lived flows from unnecessary timeouts, improving the response time characteristics for Web traffic during congestion, while not degrading overall network performance. ---------------------- Bio: Mark Claypool received his Ph.D. from the University of Minnesota in 1997. He is currently an Assistant Professor in the Computer Science Department of Worcester Polytechnic Institute. His research interestes include Multimedia Networking, Congestion Control and Information Filtering. In his spare time, Mark plays with his computers, his dog and his kids (not necessarily in that order).