Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multi-resource fair queueing for packet processing
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
2012 (English)In: SIGCOMM'12 - Proceedings of the ACM SIGCOMM 2012 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM , 2012, 1-12 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
ACM , 2012. 1-12 p.
Keyword [en]
fair queueing, fairness, middleboxes, scheduling, CPU cycles, Fair queuing, Fair sharing, Hardware resources, Link bandwidth, Memory bandwidths, Multi-resource, Multiple resources, Packet processing, Packet scheduling algorithm, Time domain, Virtual-time, Algorithms, Communication, Computer architecture, Distributed computer systems, Packet networks, Queueing theory, Network architecture
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-105329DOI: 10.1145/2342356.2342358Scopus ID: 2-s2.0-84866524258ISBN: 978-145031419-0 (print)OAI: oai:DiVA.org:kth-105329DiVA: diva2:570718
Conference
ACM SIGCOMM 2012 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2012, 13 August 2012 through 17 August 2012, Helsinki
Note

QC 20121120

Available from: 2012-11-20 Created: 2012-11-20 Last updated: 2014-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ghodsi, Ali
By organisation
Software and Computer systems, SCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 113 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf