Select your text size  for this site here: Small Text Normal Text Large Text Extra Large Text

Note: Some of the graphical elements of this site are only visible to browsers that support accepted web standards. The content of this site is, however, accessible to any browser or Internet device.

Pub. ID 4152

  Internal author     Old internal author  

Fair and Efficient Dynamic Bandwidth Allocation for Multi-Application Networks
R. M. Salles and J. A. Barria
"Fair and Efficient Dynamic Bandwidth Allocation for Multi-Application Networks", R. M. Salles and J. A. Barria, Computer Networks Journal 49 (6) pp.856-877 (2005)
Publication Date:


The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are used to characterize application requirements and provide the informational basis from where the algorithm operates. Aggregation techniques are employed to ensure scalability in the network core. Simulation results confirm a significant improvement of our approach over traditional bandwidth allocation algorithms (maxmin and proportional fairness). The algorithm also provides low errors (below 10% when compared to the zero-delay centralized approach) whenever response time does not exceed 1000 times the timescale involving flow arrivals and departures.