NDLI: On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Please wait, while we are loading the content...

Analyzing and Boosting the Performance of Power-Line Communication Networks

MoFA: Mobility-aware Frame Aggregation in Wi-Fi

Cuckoo Filter: Practically Better Than Bloom

From Cells to Streets: Estimating Mobile Paths with Cellular-Side Data

FlowBender: Flow-level Adaptive Routing for Improved Latency and Throughput in Datacenter Networks

Tango: Simplifying SDN Control with Automatic Switch Property Inference, Abstraction, and Optimization

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Subsidization Competition: Vitalizing the Neutral Internet

PARCEL: Proxy Assisted BRowsing in Cellular networks for Energy and Latency reduction

SoftMoW: Recursive and Reconfigurable Cellular WAN Architecture

Filtering Noisy 802.11 Time-of-Flight Ranging Measurements

Bringing Mobility-Awareness to WLANs using PHY Layer Information

Sprinklers: A Randomized Variable-Size Striping Approach to Reordering-Free Load-Balanced Switching

The Cost of the "S" in HTTPS

Distributed Route Aggregation on the Global Network

Merlin: A Language for Provisioning Network Resources

NetAgg: Using Middleboxes for Application-specific On-path Aggregation in Data Centres

Pricing The Last Mile: Data Capping For Residential Broadband

Using Cooperation for Low Power Low Latency Cellular Connectivity

Democratic Resolution of Resource Conflicts Between SDN Control Programs

Communication Networks of Visible Light Emitting Diodes with Intra-Frame Bidirectional Transmission

Measurement-Augmented Spectrum Databases for White Space Spectrum

Trees in the List: Accelerating List-based Packet Classification Through Controlled Rule Set Expansion

A Tangled Mass: The Android Root Certificate Stores

COLD: PoP-level Network Topology Synthesis

Controller-agnostic SDN Debugging

MSPlayer: Multi-Source and multi-Path LeverAged YoutubER

Collaborative Consumption for Mobile Broadband: A Quantitative Study

Managing Redundant Content in Bandwidth Constrained Wireless Networks

Scotch: Elastically Scaling up SDN Control-Plane using vSwitch based Overlay

MIDAS: Empowering 802.11ac Networks with Multiple-Input Distributed Antenna Systems

Multi-Layer Packet Classification with Graphics Processing Units

Remote Peering: More Peering without Internet Flattening

Deep Packet Inspection as a Service

User Behavior and Change: File-sharers and Copyright Laws

Trace-Driven Analysis of ICN Caching Algorithms on Video-on-Demand Workloads

Providing Reliable FIB Update Acknowledgments in SDN

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Content Provider	ACM Digital Library
Author	Li, Baochun Liang, Ben Wang, Wei Feng, Chen
Abstract	Middleboxes are widely deployed in today's networks. They apply a variety of complex network functions to transform, filter, and optimize incoming traffic based on the payload of packets. These functions require the support of multiple types of resources, such as CPU and link bandwidth, for processing incoming packets. Hence, a multi-resource packet scheduling algorithm is needed to allow flows to share these resources fairly and efficiently. However, unlike traditional fair queueing where bandwidth is the only concern, we show in this paper that fairness and efficiency are conflicting objectives that cannot be achieved simultaneously in the presence of multiple resources. Ideally, a scheduling algorithm should allow network operators to flexibly specify their fairness and efficiency requirements, so as to meet the Quality of Service demands while keeping the system at a high utilization level. Yet, existing multi-resource scheduling algorithms focus on fairness only, and may lead to poor resource utilization. In this paper, we propose a new scheduling algorithm to achieve a flexible tradeoff between fairness and efficiency for packet processing, consuming both CPU and link bandwidth. Experimental results based on both real-world implementation and trace-driven simulation suggest that trading off a modest level of fairness can potentially improve the efficiency to the point where the system capacity is almost saturated.
Starting Page	235
Ending Page	248
Page Count	14
File Format	PDF
ISBN	9781450332798
DOI	10.1145/2674005.2675010
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-12-02
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Fair queueing Middleboxes Fairness-efficiency tradeoff
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-resource fair queueing for packet processing

On Fairness-Efficiency Tradeoffs for Multi-Resource Packet Processing

On fairness-efficiency tradeoffs for multi-resource packet processing.

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Multi-resource fair queueing for packet processing

Multi-resource generalized processor sharing for packet processing (2013)

1Low Complexity Multi-Resource Fair Queueing with Bounded Delay

On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Similar Documents

Multi-resource fair queueing for packet processing

On Fairness-Efficiency Tradeoffs for Multi-Resource Packet Processing

On fairness-efficiency tradeoffs for multi-resource packet processing.

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

Multi-resource fair queueing for packet processing

Multi-resource generalized processor sharing for packet processing (2013)

1Low Complexity Multi-Resource Fair Queueing with Bounded Delay

On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources