The role of max-min fairness in DOCSIS 3.0 downstream channel bonding

Authors:
Scott Moser;Jim Martin;James M. Westall;Brian C. Dean
Affiliations:
School of Computing, Clemson University, Clemson, South Carolina;School of Computing, Clemson University, Clemson, South Carolina;School of Computing, Clemson University, Clemson, South Carolina;School of Computing, Clemson University, Clemson, South Carolina
Venue:
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Year:
2010

Citing 5
Cited 1

A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Introduction to Algorithms

Introduction to Algorithms
Routing and flow control in systems network architecture

IBM Systems Journal

Scheduling packets over multiple interfaces while respecting user preferences

Proceedings of the ninth ACM conference on Emerging networking experiments and technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of fairness in assigning access to network resources has been well defined in traditional networks. With the introduction of channel bonding into the DOCSIS 3.0 standard, where different flows may not have access to the same set of resources, the definition of fairness becomes less clear. In this paper we will investigate the application of max-min fairness in a channel bonded environment and implement an algorithm to allocate fair sharing of resources.