Research output

Constrained resource assignments: Fast algorithms and applications in wireless networks

Research output: Contribution to journalArticleAcademicpeer-review

Standard

Constrained resource assignments: Fast algorithms and applications in wireless networks. / Berger, A.; Gross, J.; Harks, T.; Tenbusch, S.

In: Management Science, Vol. 62, No. 7, 07.2016, p. 2070-2089.

Research output: Contribution to journalArticleAcademicpeer-review

Harvard

APA

Vancouver

Author

Berger, A. ; Gross, J. ; Harks, T. ; Tenbusch, S. / Constrained resource assignments: Fast algorithms and applications in wireless networks. In: Management Science. 2016 ; Vol. 62, No. 7. pp. 2070-2089.

Bibtex

@article{ef3358956ed54f10af2d917e8a4f4088,
title = "Constrained resource assignments: Fast algorithms and applications in wireless networks",
abstract = "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.",
keywords = "mobile networks, frequency allocation, matchings, information systems, enabling technologies, analysis of algorithms, approximation algorithms, PERFORMANCE, ALLOCATION, OFDMA SYSTEMS, ACCESS",
author = "A. Berger and J. Gross and T. Harks and S. Tenbusch",
note = "No data used.",
year = "2016",
month = "7",
doi = "10.1287/mnsc.2015.2221",
language = "English",
volume = "62",
pages = "2070--2089",
journal = "Management Science",
issn = "0025-1909",
publisher = "INFORMS",
number = "7",

}

RIS

TY - JOUR

T1 - Constrained resource assignments: Fast algorithms and applications in wireless networks

AU - Berger, A.

AU - Gross, J.

AU - Harks, T.

AU - Tenbusch, S.

N1 - No data used.

PY - 2016/7

Y1 - 2016/7

N2 - 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.

AB - 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.

KW - mobile networks

KW - frequency allocation

KW - matchings

KW - information systems

KW - enabling technologies

KW - analysis of algorithms

KW - approximation algorithms

KW - PERFORMANCE

KW - ALLOCATION

KW - OFDMA SYSTEMS

KW - ACCESS

U2 - 10.1287/mnsc.2015.2221

DO - 10.1287/mnsc.2015.2221

M3 - Article

VL - 62

SP - 2070

EP - 2089

JO - Management Science

T2 - Management Science

JF - Management Science

SN - 0025-1909

IS - 7

ER -