research-article

Free access

Multi-resource fair queueing for packet processing

Authors:

Ion StoicaAuthors Info & Claims

SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

Pages 1 - 12

https://doi.org/10.1145/2342356.2342358

Published: 13 August 2012 Publication History

Abstract

Middleboxes are ubiquitous in today's networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastly in their requirements for hardware resources (e.g., CPU cycles and memory bandwidth). Thus, depending on the functions they go through, different flows can consume different amounts of a middlebox's resources. While there is much literature on weighted fair sharing of link bandwidth to isolate flows, it is unclear how to schedule multiple resources in a middlebox to achieve similar guarantees. In this paper, we analyze several natural packet scheduling algorithms for multiple resources and show that they have undesirable properties. We propose a new algorithm, Dominant Resource Fair Queuing (DRFQ), that retains the attractive properties that fair sharing provides for one resource. In doing so, we generalize the concept of virtual time in classical fair queuing to multi-resource settings. The resulting algorithm is also applicable in other contexts where several resources need to be multiplexed in the time domain.

Supplementary Material

JPG File (sigcomm-i-01-multiresourcefairqueueingforpacketprocessing.jpg)

Download
24.14 KB

MP4 File (sigcomm-i-01-multiresourcefairqueueingforpacketprocessing.mp4)

Download
91.43 MB

References

[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.

Digital Library

[10]

A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM, pages 1--12, 1989.

Digital Library

[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.

Digital Library

[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.

Digital Library

[13]

H. Dreger, A. Feldmann, V. Paxson, and R. Sommer. Predicting the resource consumption of network intrusion detection systems. In RAID, 2008.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[19]

A. Gutman and N. Nisan. Fair Allocation Without Trade. In AAMAS, June 2012.

Digital Library

[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.

Digital Library

[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.

Digital Library

[23]

M. Kounavis, X. Kang, K. Grewal, M. Eszenyi, S. Gueron, and D. Durham. Encrypting the Internet. In Proc. SIGCOMM, 2010.

Digital Library

[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.

Digital Library

[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.

Digital Library

[26]

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Do incentives build robustness in bittorrent. In NSDI'07, 2007.

Digital Library

[27]

V. Sekar, N. Egi, S. Ratnasamy, M. Reiter, and G. Shi. Design and implementation of a consolidated middlebox architecture. In NSDI, 2012.

Digital Library

[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.

Digital Library

[29]

M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. ACM Transactions on Networking, 4(3):375--385, 1996.

Digital Library

[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.

Digital Library

[32]

Z. Wang, Z. Qian, Q. Xu, Z. M. Mao, and M. Zhang. An Untold Story of Middleboxes in Cellular Networks. In SIGCOMM, 2011.

Digital Library

[33]

L. Zhang. Virtual clock: a new traffic control algorithm for packet switching networks. SIGCOMM CCR, 20:19--29, August 1990.

Digital Library

Cited By

Lin WShan YKosta RKrishnamurthy AZhang YZhang ZPutnam A(2024)SuperNIC: An FPGA-Based, Cloud-Oriented SmartNICProceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3626202.3637564(130-141)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1145/3626202.3637564
Feng DKlaus BKlijn F(2024)Characterizing the Typewise Top-Trading-Cycles Mechanism for Multiple-Type Housing MarketsGames and Economic Behavior10.1016/j.geb.2024.04.010Online publication date: May-2024
https://doi.org/10.1016/j.geb.2024.04.010
Liang QHanafy WBashir NIrwin DShenoy PSha KBanerjee SChen J(2023)Energy Time Fairness: Balancing Fair Allocation of Energy and Time for GPU WorkloadsProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628435(53-66)Online publication date: 6-Dec-2023
https://dl.acm.org/doi/10.1145/3583740.3628435
Show More Cited By

Index Terms

Multi-resource fair queueing for packet processing
1. Networks
  1. Network components
  2. Network types
    1. Public Internet

Recommendations

Multi-resource fair queueing for packet processing
Special october issue SIGCOMM '12

Middleboxes are ubiquitous in today's networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastly in their requirements for hardware resources (e.g., CPU cycles and memory ...
Measurement Based Fair Queuing for Allocating Bandwidth to Virtual Machines
HotMIddlebox '16: Proceedings of the 2016 workshop on Hot topics in Middleboxes and Network Function Virtualization

We wish to allocate outgoing bandwidth at a server among customer VMs. The allocation for each VM is proportional to the bandwidth purchased for that VM by the customer, while allowing idle bandwidth to redistributed. Classical fair queuing in routers ...
Fair QoS multi-resource allocation for uplink traffic in WLAN

In wireless local area network (WLAN), improving the quality of service (QoS) of users is often at odd with striking fairness among users. In this work, we suggest that in WLAN, multiple types of network resources should be jointly allocated to users to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

August 2012

474 pages

ISBN:9781450314190

DOI:10.1145/2342356

General Chairs:
Lars Eggert
NetApp, Germany
,
Jörg Ott
Aalto University, Finland
,
Program Chairs:
Venkat Padmanabhan
Microsoft Research, India
,
George Varghese
UCSD, USA

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 August 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '12

Sponsor:

SIGCOMM

SIGCOMM '12: ACM SIGCOMM 2012 Conference

August 13 - 17, 2012

Helsinki, Finland

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

95
Total Citations
View Citations
1,962
Total Downloads

Downloads (Last 12 months)155
Downloads (Last 6 weeks)19

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lin WShan YKosta RKrishnamurthy AZhang YZhang ZPutnam A(2024)SuperNIC: An FPGA-Based, Cloud-Oriented SmartNICProceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3626202.3637564(130-141)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1145/3626202.3637564
Feng DKlaus BKlijn F(2024)Characterizing the Typewise Top-Trading-Cycles Mechanism for Multiple-Type Housing MarketsGames and Economic Behavior10.1016/j.geb.2024.04.010Online publication date: May-2024
https://doi.org/10.1016/j.geb.2024.04.010
Liang QHanafy WBashir NIrwin DShenoy PSha KBanerjee SChen J(2023)Energy Time Fairness: Balancing Fair Allocation of Energy and Time for GPU WorkloadsProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628435(53-66)Online publication date: 6-Dec-2023
https://dl.acm.org/doi/10.1145/3583740.3628435
You CZhao YFeng GQuek TLi L(2023)Hierarchical Multiresource Fair Queueing for Packet ProcessingIEEE Transactions on Network and Service Management10.1109/TNSM.2022.319774720:1(726-740)Online publication date: Mar-2023
https://doi.org/10.1109/TNSM.2022.3197747
Wang HSikdar SGuo XXia LCao YWang H(2023)Multi resource allocation with partial preferencesArtificial Intelligence10.1016/j.artint.2022.103824314(103824)Online publication date: Jan-2023
https://doi.org/10.1016/j.artint.2022.103824
Guo XSikdar SWang HXia LCao YWang HPelachaud CTaylor MFaliszewski PMascardi V(2022)Designing Efficient and Fair Mechanisms for Multi-Type Resource AllocationProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems10.5555/3535850.3536159(1938-1940)Online publication date: 9-May-2022
https://dl.acm.org/doi/10.5555/3535850.3536159
Atre NSadok HChiang EWang WSherry JKuipers FOrda A(2022)SurgeProtectorProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544250(723-738)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544250
Choi WUrgaonkar BKandemir MKesidis GBellavista PZhang KGherbi ABagchi SPatiño MDi Modica GGascon-Samson J(2022)Multi-resource fair allocation for consolidated flash-based caching systemsProceedings of the 23rd ACM/IFIP International Middleware Conference10.1145/3528535.3565245(202-215)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3528535.3565245
Sadok HCampista MCosta L(2021)Stateful DRF: Considering the Past in a Multi-Resource AllocationIEEE Transactions on Computers10.1109/TC.2020.300600770:7(1094-1105)Online publication date: 1-Jul-2021
https://doi.org/10.1109/TC.2020.3006007
Tang SChai QYu CLi YSun C(2020)Balancing Fairness and Efficiency for Cache Sharing in Semi-external Memory SystemProceedings of the 49th International Conference on Parallel Processing10.1145/3404397.3404450(1-11)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3404397.3404450
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents