Multi-server generalized processor sharing

Authors:
Kok-Kiong Yap;Nick McKeown;Sachin Katti
Affiliations:
Stanford University, Stanford, California;Stanford University, Stanford, California;Stanford University, Stanford, California
Venue:
Proceedings of the 24th International Teletraffic Congress
Year:
2012

Citing 11
Cited 0

Data structures and network algorithms

Data structures and network algorithms
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Fair queuing for aggregated multiple links

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fairness and load balancing in wireless LANs using association control

Proceedings of the 10th annual international conference on Mobile computing and networking
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet

IEEE/ACM Transactions on Networking (TON)
Dominant resource fairness: fair allocation of multiple resource types

Proceedings of the 8th USENIX conference on Networked systems design and implementation
Serval: an end-host stack for service-centric networking

NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Round-robin scheduling for max-min fairness in data networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

End-hosts are increasingly equipped with multiple network interfaces, ranging from smartphones with multiple radios to servers with multi-homing. These interfaces are diverse; some are expensive to use (e.g. 4G), some are free (e.g WiFi) and they have different rates and reliability. On the other hand, end-hosts now run diverse applications with different priorities, from relatively less important web browsing to higher priority VoIP and video calls. Finally, users may have policies that constrain interface use (e.g. use 4G only for high priority flows). This paper tackles the question of how different applications can use different subsets of the available network interfaces, while ensuring a fair resource allocation among flows, while satisfying policy constraints. We generalize prior classical work on processor sharing (GPS) to the case of flows sharing different subsets of the available interfaces. We show a simple scheduling scheme for packet-by-packet GPS over multiple interfaces, and prove that it can provide bounded delay and rate guarantees.