Abstract
In a cellular telecommunications network, a mobile telephone switching office (MTSO) co-ordinates the activities of the mobile units either directly or via intermediate base transceivers or hubs. In order to increase reliability, cells often split their traffic via multiple hubs—this ensures partial survivability in the face of equipment failures. One version of this problem was presented in Dutta and Kubat [4] where it was solved heuristically. In this paper, we show how this problem can be reduced to a significantly smaller one—one which can be solved to optimality almost instantaneously even for instances much larger than those presented in Dutta and Kubat [4]. Results from extensive computational tests are presented on various channel capacities, ranging from DS-1 to OC-192. The optimal approach is observed to provide better solutions in less time than the heuristic approach, thereby rendering the use of heuristic approaches unnecessary.
References
Agilent Technologies, Identify problems in wireless networks using SS7 measurements, Agilent Technologies, Telecommunications News, European Edition, Issue 20 (2000).
E. Balas and E. Zemel, An algorithm for large zero–one knapsack problems, Operations Research 28 (1980) 1130–1154.
R. Cardwell, C. Monma and T. Wu, Computer aided design procedures for survivable fiber optic telephone networks, IEEE Journal on Selective Areas in Communications 7 (1989) 1188–1197.
A. Dutta and P. Kubat, Design of partially survivable networks for cellular telecommunications systems, European Journal of Operations Research 118 (1999) 52–64.
W. Lee, Mobile Cellular Telecommunications: Analog and Digital Systems, 2nd edition (McGraw-Hill, New York, 1995).
S. Martello, D. Pisinger and P. Toth, New trends in exact algorithms for the 0-1 knapsack problem, European Journal of Operations Research 123 (2000) 325–332.
NORTEL, SONET 101: An Introduction to Basic Synchronous Optical Networks (NORTEL Northern Telecom, 2221 Lakeside Boulevard, Richardson, TX 75802, 1995).
D. Pisinger, A minimal algorithm for the 0-1 knapsack problem, Operations Research 45 (1997) 758–767.
J. Sosnosky and T. Wu, SONET ring applications for survivable fiber loop networks, IEEE Communications Magazine (June 1991) 51–58.
C. Wilson, Lease vs. own: new options for wireless carriers, The Source 1 (2003).
D. Woods, SONET from scratch, WAN Systems and Telephony Feature (May 15, 2000), http://www.networkcomputing.com/1109/1109f25.html.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Menon, S., Amiri, A. Designing Partially Survivable Cellular Telecommunications Networks. Inf Technol Manage 6, 293–303 (2005). https://doi.org/10.1007/s10799-005-5883-2
Issue Date:
DOI: https://doi.org/10.1007/s10799-005-5883-2