Best-effort versus reservations: a simple comparative analysis
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A systems approach to prediction, compensation and adaptation in wireless networks
WOWMOM '98 Proceedings of the 1st ACM international workshop on Wireless mobile multimedia
A Rate-Based Borrowing Scheme for QoS Provisioning in Multimedia Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On Quality of Service Optimization with Discrete QoS Options
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks
Computers and Operations Research
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Time-Aware Utility-Based Resource Allocation in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
An adaptive bandwidth reservation scheme for high-speed multimedia wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Bandwidth adaptation is becoming very attractive in wireless communications since it can dynamically adjust the allocated bandwidth of ongoing calls to cope with the network resource fluctuations. In this paper, we propose an optimal bandwidth adaptation algorithm for multi-class traffic QoS provisioning in wireless networks. With the proposed algorithm, each call is assigned a utility function that maps its bandwidth allocation to the user satisfaction. When the network is overloaded the allocated bandwidth of ongoing calls can be degraded to free bandwidth to accept the new and handoff calls. The bandwidth adaptation algorithm is performed to meet two objectives in the preference order: (i) all calls belonging to the same class receive fair utility (ii) the utility sum of all different classes of calls in each individual cell is maximized. Simulation results show that our proposed algorithm is effective in both attaining intra-class utility fairness and maximizing the total utility of the network while keeping the call blocking and handoff dropping probabilities low.