Deterministic packet marking for max-min flow control

This letter proposes a deterministic packet marking scheme that estimates the maximum link price on a communication path. The proposed scheme is simple and IP-compatible because it uses two-bit explicit congestion notification (ECN) field and IP identification (IPid) field in the standard IP header for the estimation. Through simulations using real IP packet traces, we show that our scheme indeed works as designed with small estimation errors, and thus enables existing max-min flow control algorithms to serve their purpose without the need of separate out-of-band control packets to carry link prices.

[1]  Mark Coates,et al.  Deterministic packet marking for congestion price estimation , 2004, IEEE INFOCOM 2004.

[2]  Steven M. Bellovin,et al.  A technique for counting natted hosts , 2002, IMW '02.

[3]  Jürgen Falb,et al.  The Internet Protocol , 2005, The Industrial Information Technology Handbook.

[4]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[5]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[6]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[7]  Donald F. Towsley,et al.  Estimation of congestion price using probabilistic packet marking , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Moshe Zukerman,et al.  MaxNet: a congestion control architecture , 2002, IEEE Communications Letters.

[9]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

[10]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.