Abstract—Efficient dynamic resource provisioningalgorithms are necessary to the development and automationof Quality of Service (QoS) networks. The main goal ofthese algorithms is to offer services that satisfy the QoSrequirements of individual users while guaranteeing at thesame time an efficient utilization of network resources. Inthis paper we introduce a new service model that providesquantitative per-flow bandwidth guarantees, where userssubscribe for a guaranteed rate; moreover, the networkperiodically individuates unused bandwidth and proposesshort-term contracts where extra-bandwidth is allocatedand guaranteed exclusively to users who can exploit itto transmit at a rate higher than their subscribed rate.To implement this service model we propose a dynamicprovisioning architecture for intra-domain Quality ofService networks. We develop an efficient bandwidthallocation algorithm that takes explicitly into accounttraffic statistics to increase the users’ benefit and thenetwork revenue simultaneously. We demonstrate throughsimulation in several realistic network scenarios that theproposed dynamic provisioning model is superior to staticprovisioning in providing resource allocation both in termsof total accepted load and network revenue.

Index Terms - Dynamic Bandwidth Allocation, AutonomicNetworks, Service Model.

Cite: Jocelyne Elias, Fabio Martignon, Antonio Capone, and Guy Pujolle, "Distributed Algorithms for Dynamic Bandwidth Provisioning in Communication Networks," Journal of Communications, vol. 1, no. 7, pp. 47-56, 2006.