Multi-resource fair queueing for packet processing

SIGCOMM'12 - Proceedings of the ACM SIGCOMM 2012 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication

Volumn , Issue , 2012, Pages 1-12

  Ghodsi, Ali ^a,c   Sekar, Vyas ^b   Zaharia, Matei ^a   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTEL CORPORATION   (United States)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

fair queueing; fairness; middleboxes; scheduling

Indexed keywords

CPU CYCLES; FAIR QUEUEING; FAIR QUEUING; FAIR SHARING; FAIRNESS; HARDWARE RESOURCES; LINK BANDWIDTH; MEMORY BANDWIDTHS; MIDDLEBOXES; MULTI-RESOURCE; MULTIPLE RESOURCES; PACKET PROCESSING; PACKET SCHEDULING ALGORITHM; TIME DOMAIN; VIRTUAL-TIME;

ALGORITHMS; COMMUNICATION; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; PACKET NETWORKS; QUEUEING THEORY; SCHEDULING;

NETWORK ARCHITECTURE;

EID: 84866524258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2342356.2342358     Document Type: Conference Paper

References (33)

1. Crossbeam network consolidation. http://www.crossbeam.com/why-crossbeam/ consolidation/, June 2012.
2. F5 Networks products. http://www.f5.com/products/big-ip/, June 2012.
3. Intel perf. counter mon. http://software.intel.com/en-us/articles/intel- performance-counter-monitor/, June 2012.
4. M57 network traffic traces. https://domex.nps.edu/corp/scenarios/2009- m57/net/, Feb. 2012.
5. Palo alto networks. http://www.paloaltonetworks.com/, June 2012.
6. Vyatta Software Middlebox. http://www.vyatta.com, June 2012.
7. D. S. Alexander, P. B. Menage, A. D. Keromytis, W. A. Arbaugh, K. G. Anagnostakis, and J. M. Smith. The Price of Safety in An Active Network. JCN, 3(1):4-18, March 2001.
8. K. Argyraki, K. Fall, G. Iannaccone, A. Knies, M. Manesh, and S. Ratnasamy. Understanding the packet forwarding capability of general-purpose processors. Technical Report IRB-TR-08-44, Intel Research Berkeley, May 2008.
9. J. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In INFOCOM, 1996.
10. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM, pages 1-12, 1989.
11. D. Dolev, D. G. Feitelson, J. Y. Halpern, R. Kupferman, and N. Linial. No justified complaints: on fair sharing of multiple resources. In ITCS, pages 68-75, 2012.
12. H. Dreger, A. Feldmann, V. Paxson, and R. Sommer. Operational experiences with high-volume network intrusion detection. In ACM Conference on Computer and Communications Security, pages 2-11, 2004.
13. H. Dreger, A. Feldmann, V. Paxson, and R. Sommer. Predicting the resource consumption of network intrusion detection systems. In RAID, 2008.
14. N. Egi, A. Greenhalgh, M. Handley, G. Iannaccone, M. Manesh, L. Mathy, and S. Ratnasamy. Improved forwarding architecture and resource management for multi-core software routers. In NPC, pages 117-124, 2009.
15. A. Ghodsi, V. Sekar, M. Zaharia, and I. Stoica. Multi-resource fair queueing for packet processing. Technical Report UCB/EECS-2012-166, EECS Department, University of California, Berkeley, June 2012.
16. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, I. Stoica, and S. Shenker. Dominant resource fairness: Fair allocation of multiple resource types. In NSDI, 2011.
17. S. J. Golestani. A self-clocked fair queueing scheme for broadband applications. In INFOCOM, pages 636-646, 1994.
18. P. Goyal, H. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. ACM Transactions on Networking, 5(5):690-704, Oct. 1997.
19. A. Gutman and N. Nisan. Fair Allocation Without Trade. In AAMAS, June 2012.
20. M. Honda, Y. Nishida, C. Raiciu, A. Greenhalgh, M. Handley, and H. Tokuda. Is it still possible to extend TCP? In Proc. IMC, 2011.
21. C. Joe-Wong, S. Sen, T. Lan, and M. Chiang. Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. In INFOCOM, 2012.
22. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek. The Click modular router. ACM Trans. Comput. Syst., 18, August 2000.
23. M. Kounavis, X. Kang, K. Grewal, M. Eszenyi, S. Gueron, and D. Durham. Encrypting the Internet. In Proc. SIGCOMM, 2010.
24. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control - the single node case. ACM Transactions on Networking, 1(3):344-357, June 1993.
25. D. C. Parkes, A. D. Procaccia, and N. Shah. Beyond Dominant Resource Fairness: Extensions, Limitations, and Indivisibilities. In ACM Conference on Electronic Commerce, 2012.
26. M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Do incentives build robustness in bittorrent. In NSDI'07, 2007.
27. V. Sekar, N. Egi, S. Ratnasamy, M. Reiter, and G. Shi. Design and implementation of a consolidated middlebox architecture. In NSDI, 2012.
28. V. Sekar, S. Ratnasamy, M. Reiter, N. Egi, and G. Shi. The Middlebox Manifesto: Enabling Innovation in Middlebox Deployments. In HotNets 2011, Oct. 2011.
29. M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. ACM Transactions on Networking, 4(3):375-385, 1996.
30. R. Smith, N. Goyal, J. Ormont, K. Sankaralingam, and C. Estan. Signature Matching in Network Processing Using SIMD/GPU Architectures. In Int. Symp. on Performance Analysis of Systems and Software, 2009.
31. C. A. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional Share Resource Management. PhD thesis, MIT, Laboratory of Computer Science, Sept. 1995. MIT/LCS/TR-667.
32. Z. Wang, Z. Qian, Q. Xu, Z. M. Mao, and M. Zhang. An Untold Story of Middleboxes in Cellular Networks. In SIGCOMM, 2011.
33. L. Zhang. Virtual clock: a new traffic control algorithm for packet switching networks. SIGCOMM CCR, 20:19-29, August 1990.