Recent Trends in Analysis of Algorithms and Complexity Theory An Efficient Dynamic Bandwidth Allocation Algorithm for improving the Quality of Service of Networks

During networking, the bandwidth is equally assigned to individual nodes. But each node can't utilize the same amount of bandwidth. The requirement of bandwidth also differs from time to time. For proper utilization of bandwidth, the dynamic bandwidth allocation algorithm can be implemented. Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources. In this paper, we introduce a new service model that provides quantitative assignment of bandwidth guaranteeing the improvement in QoS in terms of network services. We propose an efficient bandwidth allocation algorithm that takes traffic statistics for dynamic bandwidth allocation. We demonstrate through simulation in realistic network scenarios that the proposed dynamic provisioning model is superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue.