Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Max-min fair bandwidth allocation algorithms for packet switches
Conference
Pan, D, Yang, Y. (2007). Max-min fair bandwidth allocation algorithms for packet switches .
10.1109/IPDPS.2007.370242
Share this citation
Twitter
Email
Pan, D, Yang, Y. (2007). Max-min fair bandwidth allocation algorithms for packet switches .
10.1109/IPDPS.2007.370242
Copy Citation
Share
Overview
Identifiers
View All
Overview
cited authors
Pan, D; Yang, Y
authors
Pan, Deng
abstract
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are a common approach for switches and routers to support QoS. All fair scheduling algorithms are running based on a bandwidth allocation scheme. The scheme should be feasible in order to be applied in practice, and should be efficient to fully utilize available bandwidth and allocate bandwidth in a fair manner. However, since a single input port or output port of a switch has only the bandwidth information of its local flows (i.e., the flows traversing itself), it is difficult to obtain a globally feasible and efficient bandwidth allocation scheme. In this paper, we show how to fairly allocate bandwidth in packet switches based on the max-min fairness principle. We first formulate the problem, and give the definitions of feasibility and max-min fairness for bandwidth allocation in packet switches. As the first step to solve the problem, we consider the simpler unicast scenarios, and present the max-min fair bandwidth allocation algorithm for unicast traffic. We then extend the analysis to the more general multicast scenarios, and present the max-min fair bandwidth allocation algorithm for multicast traffic. We prove that both algorithms achieve max-min fairness, and analyze their complexity. The proposed algorithms are universally applicable to any type of switches and scheduling algorithms. © 2007 IEEE.
publication date
September 24, 2007
Identifiers
Digital Object Identifier (DOI)
https://doi.org/10.1109/ipdps.2007.370242