A path-aware rate policer: design and comparative evaluation

In the current Internet, congestion control is voluntary and not responding sufficiently to congestion is becoming a growing problem. Rate policers in the literature are based on the assumption of placement at a single bottleneck and a known minimum round trip time. We aim to characterise the limitations of these policers in many practical scenarios where we believe these assumptions break down. We present the design of a policer based on a novel feedback architecture that transcends these assumptions. The new arrangement places our policer at the interface with the sender. The sender is trapped into sending packets through the policer that honestly declare the congestion and round trip time of the whole downstream path. We compare the theoretical limits of these different classes of policers.

[1]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[2]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[4]  Sally Floyd,et al.  IAB Concerns Regarding Congestion Control for Voice Traffic in the Internet , 2004, RFC.

[5]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[6]  Smitha A. L. Narasimha Reddy.  LRU-RED: an active queue management scheme to contain high bandwidth flows at congested routers , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[7]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[8]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[9]  Rajeev Shorey,et al.  XCHOKe: malicious source control for congestion avoidance at Internet gateways , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[10]  Arnaud Jacquet,et al.  Policing congestion response in an internetwork using re-feedback , 2005, SIGCOMM '05.

[11]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[12]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).