Case Study: Performance study of bandwidth reallocation algorithms for dynamic provisioning in differentiated services networks

Authors:
Chie Dou;Fang-Ching Ou
Affiliations:
Department of Electrical Engineering, National Yunlin University of Science and Technology, No. 123, Section 3, University Road, Yunlin, 640 Touliu, Taiwan, ROC;Department of Electrical Engineering, National Yunlin University of Science and Technology, No. 123, Section 3, University Road, Yunlin, 640 Touliu, Taiwan, ROC
Venue:
Computer Communications
Year:
2001

Citing 2
Cited 1

Adaptive packet marking for maintaining end-to-end throughput in a differentiated-services internet

IEEE/ACM Transactions on Networking (TON)
Charging for packet-switched network communication-motivation and overview

Computer Communications

Modeling two-windows TCP behavior in differentiated services networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper proposed five bandwidth reallocation algorithms (BRAs) that can be applied to the quantitative provisioning in a differentiated services (DS) network supporting dynamic provisioning. At each node in the DS domain, quantitative traffic is classified into EF PHB and AF11_quantitative-assured PHB. The bandwidth reallocation process for quantitative provisioning is separated into two stages. The first stage is to manage the quantitative provisioning for the EF PHB and the second stage is to manage the quantitative provisioning for the AF11_quantitative-assured PHB. Basic concepts and the detailed flowcharts of the proposed BRAs are presented. The performances of all five proposed BRAs are evaluated and compared under various network topologies as well as network congestion conditions. Finally, some concluding remarks based on this study are given to help network administrators in understanding the complex bandwidth reallocation problem for dynamic provisioning in DS networks.