Two Bandwidth Packing Algorithms for a Centralized Wireless Network and Their Average-case Analysis

This paper presents an analysis of two algorithms for processing requests for connections in a centralized wireless network. These algorithms are called bandwidth packing algorithms. Each call request comes with a bandwidth demand. A demand can be met only if there is sufficient bandwidth available during allocation, and requests with demands not met are held in a queue. We use the measure of bandwidth utility ratio to quantify the performance of our algorithms. Our results have shown that we can increase the bandwidth resource utility ratio (8%~10%) significantly without adding much computation complexity

[1]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Georgios B. Giannakis,et al.  Cross-layer scheduling with prescribed QoS guarantees in adaptive wireless networks , 2005, IEEE Journal on Selected Areas in Communications.

[3]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[4]  Reza Barkhi,et al.  The multi-hour bandwidth packing problem , 2000, Comput. Oper. Res..

[5]  Georgios B. Giannakis,et al.  Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design , 2005, IEEE Transactions on Wireless Communications.

[6]  Wansoo T. Rhee,et al.  Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[7]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[8]  Wanjiun Liao,et al.  Credit-based slot allocation for multimedia mobile ad hoc networks , 2003, IEEE J. Sel. Areas Commun..

[9]  Vijay K. Bhargava,et al.  A centralized TDMA-based scheme for fair bandwidth allocation in wireless IP networks , 2001, IEEE J. Sel. Areas Commun..

[10]  Jonathan Ling,et al.  Jointly opportunistic beamforming and scheduling (JOBS) for downlink packet access , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[11]  Alexander L. Stolyar,et al.  Bandwidth packing , 2007, Algorithmica.

[12]  Anja Feldmann,et al.  COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS , 1999 .

[13]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[16]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[17]  Edward G. Coffman,et al.  Stochastic analysis of a slotted FIFO communication channel , 1993, IEEE Trans. Inf. Theory.

[18]  Christian Hofmann,et al.  Supplier's pricing policy in a Just-in-Time environment , 2000, Comput. Oper. Res..

[19]  Raphael Rom,et al.  Packet scheduling with fragmentation , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.