Low complexity multi-resource fair queueing with bounded delay

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1914-1922

  Wang, Wei ^a   Liang, Ben ^a   Li, Baochun ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; PACKET NETWORKS; QUEUEING NETWORKS; QUEUEING THEORY;

BOUNDED DELAYS; CONTENT BASED FILTERING; FAIR QUEUEING; FAIR QUEUEING ALGORITHMS; LINK BANDWIDTH; MEMORY BANDWIDTHS; MULTI-RESOURCE; PACKET PROCESSING;

SCHEDULING;

EID: 84904443900     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848131     Document Type: Conference Paper

References (29)

1. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. ACM SIGCOMM, 1989.
2. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Netw., vol. 1, no. 3, pp. 344-357, 1993.
3. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM, 1994.
4. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, no. 10, pp. 1374-1396, 1995.
5. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round-robin," IEEE/ACM Trans. Netw., vol. 4, no. 3, pp. 375-385, 1996.
6. J. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM, 1996.
7. A. Greenhalgh, F. Huici, M. Hoerdt, P. Papadimitriou, M. Handley, and L. Mathy, "Flow processing and the rise of commodity network hardware," ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 2, pp. 20-26, 2009.
8. J. Sherry, S. Hasan, C. Scott, A. Krishnamurthy, S. Ratnasamy, and V. Sekar, "Making middleboxes someone else's problem: Network processing as a cloud service," in Proc. ACM SIGCOMM, 2012.
9. J. Anderson, R. Braud, R. Kapoor, G. Porter, and A. Vahdat, "xOMB: Extensible open middleboxes with commodity servers," in Proc. ACM/IEEE ANCS, 2012.
10. V. Sekar, N. Egi, S. Ratnasamy, M. Reiter, and G. Shi, "Design and implementation of a consolidated middlebox architecture," in Proc. USENIX NSDI, 2012.
11. A. Ghodsi, V. Sekar, M. Zaharia, and I. Stoica, "Multi-resource fair queueing for packet processing," in Proc. ACM SIGCOMM, 2012.
12. N. Egi, A. Greenhalgh, M. Handley, M. Hoerdt, F. Huici, and L. Mathy, "Towards high performance virtual routers on commodity hardware," in Proc. ACM CoNEXT, 2008.
13. H. Dreger, A. Feldmann, V. Paxson, and R. Sommer, "Predicting the resource consumption of network intrusion detection systems," in Recent Advances in Intrusion Detection (RAID), vol. 5230. Springer, 2008, pp. 135-154.
14. M. Honda, Y. Nishida, C. Raiciu, A. Greenhalgh, M. Handley, and H. Tokuda, "Is it still possible to extend TCP" in Proc. ACM IMC, 2011.
15. Z. Wang, Z. Qian, Q. Xu, Z. Mao, and M. Zhang, "An untold story of middleboxes in cellular networks," in Proc. SIGCOMM, 2011.
16. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica, "Dominant resource fairness: Fair allocation of multiple resource types," in Proc. USENIX NSDI, 2011.
17. W. Wang, B. Li, and B. Liang, "Multi-resource round robin: A low complexity packet scheduler with dominant resource fairness," in Proc. IEEE ICNP, 2013.
18. C. Joe-Wong, S. Sen, T. Lan, and M. Chiang, "Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework," in Proc. IEEE INFOCOM, 2012.
19. D. Parkes, A. Procaccia, and N. Shah, "Beyond dominant resource fairness: Extensions, limitations, and indivisibilities," in Proc. ACM EC, 2012.
20. W. Wang, B. Liang, and B. Li, "Multi-resource generalized processor sharing for packet processing," in Proc. ACM/IEEE IWQoS, 2013.
21. S. Ramabhadran and J. Pasquale, "Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay," in Proc. ACM SIGCOMM, 2003.
22. S. Kanhere, H. Sethu, and A. Parekh, "Fair and efficient packet scheduling using elastic round robin," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 324-336, 2002.
23. B. Caprita, J. Nieh, and W. C. Chan, "Group round robin: Improving the fairness and complexity of packet scheduling," in Proc. ACM ANCS, 2005.
24. X. Yuan and Z. Duan, "Fair round-robin: A low-complexity packet scheduler with proportional and worst-case fairness," IEEE Trans. Comput., 2009.
25. W. Wang, B. Liang, and B. Li, "Multi-resource fair queueing for packet processing with low complexity and bounded delay," University of Toronto, Tech. Rep., 2013. [Online]. Available: http://iqua.ece.toronto.edu/ weiwang/papers/gmr3.pdf
26. P. Goyal, H. Vin, and H. Cheng, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," IEEE/ACM Trans. Netw., vol. 5, no. 5, pp. 690-704, 1997.
27. S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 365-386, 1995.
28. S. Y. Cheung and C. S. Pencea, "BSFQ: Bin sort fair queueing," in Proc. IEEE INFOCOM, 2002.
29. C. Guo, "SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks," in Proc. ACM SIGCOMM, 2001.