Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers

A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proceedings of ACM SIGCOMM, Austin, TX, 1989, pp. 1–12. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated service networks—the single node case, in: Proceedings of the IEEE INFOCOM, Florence, Italy, 1992, pp. 915–924. Keshav, 1997 I. Stoica, H. Abdel-Wahab, K. Jeffay, S.K. Baruah, J.E. Gehrke, C.G. Plaxton, A proportional share resource allocation algorithm for real-time, time-shared systems, in: Proceedings of the IEEE Real-Time System Symposium, Washington, DC, 1996, pp. 288–299. Z. Cao, E.W. Zegura, Utility max–min: an application-oriented bandwidth allocation scheme, in: Proceedings of the IEEE INFOCOM, New York, NY, 1999, pp. 793–801. J.C.R. Bennett, H. Zhang, WF2Q: worst-case fair weighted fair queueing, in: Proceedings of the IEEE INFOCOM, San Francisco, CA, 1996, pp. 120–128. Shreedhar, 1996, Efficient fair queuing using deficit round-robin, IEEE/ACM Trans. Netw., 4, 375, 10.1109/90.502236 Elwalid, 1995, A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node, IEEE J. Sel. Areas Commun., 13, 1115, 10.1109/49.400666 R. Guérin, S. Kamat, V. Peris, R. Rajan, Scalable QoS provision through buffer management, in: Proceedings of the ACM SIGCOMM, Vancouver, Canada, 1998, pp. 29–40. Presti, 1999, Source time scale and optimal buffer/bandwidth tradeoff for heterogeneous regulated traffic in a network node, IEEE/ACM Trans. Netw., 7, 490, 10.1109/90.793004 J.M. Blanquer, B. Özden, Fair queuing for aggregated multiple links, in: Proceedings of the ACM SIGCOMM, San Diego, CA, 2001, pp. 189–197. G. Fayolle, A. de La Fortelle, J.-M. Lasgouttes, L. Massoulié, J. Roberts, Best-effort networks: modeling and performance analysis via large networks asymptotics, in: Proceedings of the IEEE INFOCOM, Anchorage, AK, 2001, pp. 709–716. Kamoun, 1980, Analysis of shared finite storage in a computer network node environment under general traffic, IEEE Trans. Commun. COM, 28, 992, 10.1109/TCOM.1980.1094756 Wu, 1995, A buffer allocation scheme for ATM networks: Complete sharing based on virtual partition, IEEE/ACM Trans. Netw., 3, 660, 10.1109/90.477712 Choudhury, 1998, Dynamic queue length thresholds for shared-memory packet switches, IEEE/ACM Trans. Netw., 6, 130, 10.1109/90.664262 Floyd, 1993, Random early detection gateways for congestion avoidance, IEEE/ACM Trans. Netw., 1, 397, 10.1109/90.251892 W.-J. Kim, B.G. Lee, The FB-RED algorithm for TCP over ATM, in: Proceedings of the IEEE GLOBECOM, Sydney, Australia, 1998, pp. 551–555. Y. Zhou, H. Sethu, On achieving fairness in the joint allocation of processing and bandwidth resources, in: Proceedings of the International Workshop QoS, Monterey, CA, 2003, pp. 97–114. NLANR, NLANR Network Traffic Packet Header Traces, http://pma.nlanr.net/Traces/Traces. T.N. Group, MPEG-4 and H.263 video traces for network performance evaluation, http://www-tkn.ee.tu-berlin.de/research/trace/trace.html. S. Floyd, RED: discussions of setting parameters, available at http://www.icir.org/floyd/REDparameters.txt, Nov. 1997.