A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests

Abstract

Bandwidth allocation is a fundamental problem in communication networks. The problem of bandwidth allocation is further intensified when the requested bandwidth exceeds the available unused bandwidth and so not all requests can be completely served. This research examines on-line bandwidth allocation, where the decision for acceptance or rejection of the request has to be made when future requests and their arrival statistics are not known. A request can be defined as a flow of information from a source to a destination with a certain amount of bandwidth, a priority level, a utility function that is based on the bandwidth received, and a worth that is based on the utility function and the priority level. The goal of this research is to develop a scheduling heuristic for an overloaded system that attempts to schedule the requests such that the sum of the worths of the requests satisfied in a fixed interval of time is the maximum. The scheduling heuristic can preempt or degrade already-scheduled requests. Three difSerent types of utility functions (step, linear, and concave) are examined. Other parameters being considered include network loading and the relative weights of the different priority levels. The heuristic variations developed are shown to perform well compared to a complete sharing policy and an upper bound.

On utilization efficiency of backbone bandwidth for a heterogeneous wireless network operator

“…Therefore, the adjustment process times can be reduced from 14 to 10 times. Compared to the schemes in [6,7,20,21], our solutions can save some unused bandwidth and process time to accelerate the completion time for requests.…”

Adaptive online bandwidth allocation and reservation for QoS sensitive multimedia networks

“…However, these existing schemes have several shortcomings as described in Section 3. Compared to these schemes [8,9], our proposed online bandwidth management framework attains better performance for QoS sensitive multimedia services.…”

“…In recent years, some bandwidth management schemes have been developed and main objectives of these schemes are similar to our objectives in this paper. Dharwadkar et al [8] proposed the Dynamic Bandwidth Allocation (DBA) scheme with consideration of the preemption technique. Schelén and Pink [9] proposed the resource advance reservation (RAR) scheme for advance reservations.…”

Architecture for dynamic and fair distribution of bandwidth

“…The X-BDS network guarantees that each flow would receive at least its minimum requested rate, b f , while the leftover resources in the network are fairly distributed among participating flows based on the corresponding definition of fairness defined by (7) and (8). To achieve these guarantees, the network allocates to each flow an amount of bandwidth not smaller than the flow's minimum requested rate, and denies network access to those flows whose minimum rate guarantees cannot be met.…”