A recursive algorithm for bandwidth partitioning

Authors:
Scott Jordan;Sam Charrington;Pruttipong Apivatanagul
Affiliations:
Department of Computer Science, University of California, Irvine, CA;Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Institute of Transportation Studies, University of Calfornia, Irvine, CA
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 7
Cited 0

Worst-case performance of cellular channel assignment policies

Wireless Networks - Special issue on performance evaluation methods for wireless networks
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
A Queuing-Theoretic and Optimization-Based Model for Radio Resource Management in IEEE 802.16 Broadband Wireless Networks

IEEE Transactions on Computers
Allocating Services to Applications using Markov Decision Processes

SOCA '07 Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications
Power-based admission control for multiclass calls in QoS-sensitive CDMA networks

IEEE Transactions on Wireless Communications
Bandwidth allocation and admission control in ATM networks with service separation

IEEE Communications Magazine
Optimal Resource Allocation and Fairness Control in All-Optical WDM Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider complete partitioning of bandwidth among multiple services. When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches.