We consider the on-line channel assignment problem in the case of cellular networks and we formalise this problem as an on-line load balancing problem of temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterise 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.
Crescenzi, P., Gambosi, G., Penna, P. (2000). On-line algorithms for the channel assignment problem in cellular networks, 1-7.
On-line algorithms for the channel assignment problem in cellular networks
GAMBOSI, GIORGIO;
2000-01-01
Abstract
We consider the on-line channel assignment problem in the case of cellular networks and we formalise this problem as an on-line load balancing problem of temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterise 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.Questo articolo è pubblicato sotto una Licenza Licenza Creative Commons
