We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterize its competitive ratio in terms of the combinatorial properties of the graph representing the network. We then compare the cluster algorithm with the greedy one when applied to the channel assignment problem: it turns out that the competitive ratio of the cluster algorithm is strictly better than the competitive ratio of the greedy algorithm. The cluster method is general enough to be applied to other on-line load balancing problems and, for some topologies, it can be proved to be optimal. (C) 2003 Elsevier B.V. All rights reserved.
Crescenzi, P., Gambosi, G., & Penna, P. (2004). On-line algorithms for the channel assignment problem in cellular networks. DISCRETE APPLIED MATHEMATICS, 137(3), 237-266.
Tipologia: | Articolo su rivista |
Citazione: | Crescenzi, P., Gambosi, G., & Penna, P. (2004). On-line algorithms for the channel assignment problem in cellular networks. DISCRETE APPLIED MATHEMATICS, 137(3), 237-266. |
Sostituisce: | http://hdl.handle.net/2108/53656 |
Lingua: | English |
Settore Scientifico Disciplinare: | Settore INF/01 - Informatica |
Revisione (peer review): | Sì, ma tipo non specificato |
Tipo: | Articolo |
Rilevanza: | Rilevanza internazionale |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/S0166-218X(03)00341-X |
Stato di pubblicazione: | Pubblicato |
Data di pubblicazione: | 2004 |
Titolo: | On-line algorithms for the channel assignment problem in cellular networks |
Autori: | |
Autori: | Crescenzi, P; Gambosi, G; Penna, P |
Appare nelle tipologie: | 01 - Articolo su rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
crescenzigambosipenna.pdf | Main article | N/A | Open Access Visualizza/Apri |