Change search
ReferencesLink to record
Permanent link

Direct link
Constrained Resource Assignments: Fast Approximations and Applications in Wireless Networks
Maastricht University.
Maastricht University.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0001-6682-6559
RWTH Aachen University.
2015 (English)In: Management science, ISSN 0025-1909, E-ISSN 1526-5501Article in journal (Other academic) Epub ahead of print
Abstract [en]

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.

Place, publisher, year, edition, pages
INFORMS , 2015.
National Category
URN: urn:nbn:se:kth:diva-165933OAI: diva2:809161
ICT - The Next Generation

QC 20150531

Available from: 2015-04-30 Created: 2015-04-30 Last updated: 2016-05-31Bibliographically approved

Open Access in DiVA

fulltext(538 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 538 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Gross, James
By organisation
Communication Theory
In the same journal
Management science

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 178 hits
ReferencesLink to record
Permanent link

Direct link