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

✍ Scribed by Chie Dou; Fang-Ching Ou

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 607 KB
• Volume: 24
• Category: Article
• ISSN: 0140-3664
• DOI: 10.1016/s0140-3664(01)00294-8

✦ Synopsis

This paper proposed ®ve 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 traf®c is classi®ed into EF PHB and AF11_quantitative-assured PHB. The bandwidth reallocation process for quantitative provisioning is separated into two stages. The ®rst 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 ¯owcharts of the proposed BRAs are presented. The performances of all ®ve 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.