Architecture for dynamic and fair distribution of bandwidth
International Journal of Network Management
Opportunistic link overbooking for resource efficiency under per-flow service guarantee
IEEE Transactions on Communications
| Hi-index | 0.00 |
The current approach to providing Quality of Service (QoS) in the Internet is no longer adequate because of the increasing emergence of applications with diverse customer service requirements. Despite the intense research in this area, the problem of providing scalable per-flow QoS remains open. One of the main obstacles to finding a solution is the difficulty in predicting the pattern of the traffic flow in the network and allocating resources accordingly. A scalable mechanism that fairly distributes available resources among the flows in the network plays an important role in providing per-flow QoS. Furthermore, such a mechanism could improve network performance by providing congestion control and keeping link utilization high [SSZ99]. This dissertation examines the problem of providing a fair per-flow resource distribution and introduces a scalable solution based on a distributed message exchange protocol. The proposed solution, called the Bandwidth Distribution Scheme (BDS), relies on feedback from the network to distribute available resources among the individual flows. The BDS consists of three primary parts: the admission control, the resource management mechanism, and the distributed message exchange protocol. Both the admission control and the resource management mechanism reside at the network boundaries and rely on the distributed message exchange protocol to obtain the feedback from the network. The admission control determines if the network can accept a new flow, while the resource management mechanism fairly distributes available resources among the active flows. This dissertation reports results of an extensive evaluation of the Bandwidth Distribution Scheme through simulation. In particular, such characteristics of the BDS approach as efficiency and fairness of the resource management mechanism, effectiveness in dealing with congestion and achieving high link utilization, and the overhead incurred by the distributed messages exchange protocol were examined. This dissertation investigates two variations of the Bandwidth Distribution Scheme, the Estimated-Based BDS (S-BDS) and the Exact Requested Bandwidth Range BDS (X-BDS). In addition, this thesis examines a set of optimizations that improve the BDS performance. The study concludes that the proposed load distribution approach is scalable, provides a fair and swift bandwidth allocation, causes negligible amount of overhead, and is capable of dealing with network congestion while keeping link utilization high.