Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks

Resource assignment problems occur in a vast variety of applications, from scheduling problems over image recognition to communication networks. Often these problems can be modeled by a maximum weight matching problem in (bipartite) graphs or generalizations thereof, and efficient and practical algorithms are known for these problems. Although in some of the applications an assignment of the resources may be needed only once, in many of these applications, the assignment has to be computed more often for different scenarios. In that case it is often essential that the assignments can be computed very fast. Moreover, implementing different assignments in different scenarios may come with a certain cost for the reconfiguration of the system. In this paper, we consider the problem of determining optimal assignments sequentially over a given time horizon, where consecutive assignments are coupled by constraints that control the cost of reconfiguration. We develop fast approximation and online algorithms for this problem with provable approximation guarantees and competitive ratios. Moreover, we present an extensive computational study about the applicability of our model and our algorithms in the context of orthogonal frequency division multiple access (OFDMA) wireless networks, finding a significant performance improvement for the total bandwidth of the system using our algorithms. For this application (the downlink of an OFDMA wireless cell) , the run time of matching algorithms is extremely important, having an acceptable range of a few milliseconds only. For the considered realistic instances, our algorithms perform extremely well: the solution quality is, on average, within a factor of 0.8–0.9 of optimal off-line solutions, and the running times are at most 5 ms per phase even in the worst case. Thus, our algorithms are well suited to be applied in the context of OFDMA systems.Data, as supplemental material, are available at http://dx.doi.org/10.1287/mnsc.2015.2221 . This paper was accepted by Teck-Hua Ho, optimization .

[1]  Adam Wolisz,et al.  Performance analysis of dynamic OFDMA systems with inband signaling , 2006, IEEE Journal on Selected Areas in Communications.

[2]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[3]  Romeo Rizzi,et al.  Combinatorial optimization - Polyhedra and efficiency: A book review , 2004, 4OR.

[4]  Hui Liu,et al.  An efficient multiuser loading algorithm for OFDM-based broadband wireless systems , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[5]  Yuanyuan Yang,et al.  Optimal Scheduling Algorithms in WDM Optical Interconnects with Limited Range Wavelength Conversion Capability , 2004, Asia-Pacific Computer Systems Architecture Conference.

[6]  Rolf H. Möhring,et al.  Integrated Sequencing and Scheduling in Coil Coating , 2011, Manag. Sci..

[7]  Bernhard Korte,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[8]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[9]  Pravin Varaiya,et al.  QoS aware adaptive resource allocation techniques for fair scheduling in OFDMA based broadband wireless access systems , 2003, IEEE Trans. Broadcast..

[10]  Satish Rao,et al.  Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Hoon Kim,et al.  A proportional fair scheduling for multicarrier transmission systems , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[12]  James Gross,et al.  The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[14]  Avinash C. Kak,et al.  3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Eytan Modiano,et al.  Optimal transmission scheduling over a fading channel with energy and deadline constraints , 2006, IEEE Transactions on Wireless Communications.

[16]  Jani Puttonen,et al.  Performance of VoIP with Mobility in UTRA Long Term Evolution , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[17]  Michael J. Neely,et al.  Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[19]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[20]  James Gross.  Admission control based on OFDMA channel transformations , 2009, 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops.

[21]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[22]  Beomsup Kim,et al.  On the use of linear programming for dynamic subchannel and bit allocation in multiuser OFDM , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[23]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[24]  Erik Dahlman,et al.  3G Evolution: HSPA and LTE for Mobile Broadband , 2007 .

[25]  Ralf Irmer,et al.  3G evolution , 2008, IEEE Microwave Magazine.

[26]  James K. Cavers,et al.  Mobile Channel Characteristics , 2000 .

[27]  Stephen P. Boyd,et al.  Fast Algorithms for Resource Allocation in Wireless Cellular Networks , 2010, IEEE/ACM Transactions on Networking.

[28]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[29]  N. Revathy,et al.  Slow Adaptive OFDMA Systems Through Chance Constrained Programming , 2010, IEEE Transactions on Signal Processing.

[30]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[31]  Mihalis Yannakakis,et al.  The complexity of restricted spanning tree problems , 1982, JACM.

[32]  Michael J. Neely,et al.  Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks , 2009, IEEE Trans. Mob. Comput..

[33]  Hongjin Yeh,et al.  Optimal Scheduling Algorithms in WDM Optical Passive Star Networks , 1999, IPPS/SPDP Workshops.

[34]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[35]  Fabrizio Grandoni,et al.  Budgeted matching and budgeted matroid intersection via the gasoline puzzle , 2008, Math. Program..

[36]  Adam Wolisz,et al.  Dynamic resource allocation in OFDM systems: an overview of cross-layer optimization principles and techniques , 2007, IEEE Network.

[37]  Bin Shen,et al.  Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.