QoS in best-effort networks

The QoS of today's best-effort network does not deliver the performance required for a wide range of interactive and multimedia applications that have demanding delay and bandwidth requirements. We discuss how current research into congestion control has uncovered that best-effort networks, with just a few modifications to the existing equipment, can deliver the performance required for a range of applications. Furthermore, we describe how best-effort networks lead to a pricing mechanism that charges users in accordance to the stress they place on the network.

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

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

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

[4]  Derek McAuley,et al.  Differential QoS and pricing in networks: Where flow control meets game theory , 1999, IEE Proc. Softw..

[5]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[6]  Moshe Zukerman,et al.  GREEN: an active queue management algorithm for a self managed Internet , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).