Optimal assignment of cells in PCS networks
| Autor: | Jie Li, Hideto Itoh, Hisao Kameda |
|---|---|
| Rok vydání: | 1997 |
| Předmět: |
Linear bottleneck assignment problem
Mathematical optimization Hardware and Architecture Total cost Heuristic (computer science) Computer science Quadratic assignment problem Personal Communications Service Management Science and Operations Research Assignment problem Generalized assignment problem Weapon target assignment problem Computer Science Applications |
| Zdroj: | Personal Technologies. 1:127-134 |
| ISSN: | 1617-4917 0949-2054 |
| DOI: | 10.1007/bf01299647 |
| Popis: | This paper deals with the assignment problem of cells to switches in a personal communication service network. Three types of costs in a PCS network are considered in detail: the cost of handoffs, the cost of cabling, and the cost of switching. The optimal assignment problem is formulated as an integer-programming problem. A heuristic algorithm is proposed to obtain an assignment of cells in a PCS network. The proposed algorithm is compared with an existing heuristic cell assignment algorithm. By numerical examination, it is shown that the switching cost has a large effect on the solution of the cell assignment problem. The proposed algorithm obtains much better cell assignment in which the load of each switch is balanced and the total cost of a PCS network is much lower than what is obtained by the existing algorithm that does not take account of the switching cost. If the switching cost is taken into account, it has also been shown that our proposed algorithm achieves substantially the same results as the existing algorithm while requiring much less computation time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink