The Design of Partially Survivable Networks

In cellular telecommunications networks, a mobile telephone switching office (MTSO) co-ordinates the activities of the mobile units either directly or through intermediate hubs. In order to increase reliability, cells often split their traffic via multiple hubs — this ensures partial survivability in the face of equipment failures. This chapter examines three related problems in the context of partial survivability. The first is a single-period model that addresses the question of assigning cells to hubs at minimum cost, while incorporating diversity requirements. The second extends the problem into a multi-period context, while the third incorporates capacity requirements at the hubs. Results from extensive computational tests are presented for the first two versions of the problem, while limited results are presented for the third.

[1]  Clyde L. Monma,et al.  Computer-aided design procedures for survivable fiber optic networks , 1989, IEEE J. Sel. Areas Commun..

[2]  Amitava Dutta,et al.  Design of partially survivable networks for cellular telecommunication systems , 1999, Eur. J. Oper. Res..

[3]  William C. Y. Lee Mobile Cellular Telecommunications: Analog and Digital Systems , 1995 .

[4]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[5]  S. Menon,et al.  Multiperiod cellular network design via price-influenced simulated annealing (PISA) , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[7]  T.-H. Wu,et al.  SONET ring applications for survivable fiber loop networks , 1991, IEEE Communications Magazine.

[8]  Peter Kubat,et al.  Design of cellular networks with diversity and capacity constraints , 2000, IEEE Trans. Reliab..

[9]  Peter Kubat,et al.  A multi-period network design problem for cellular telecommunication systems , 2001, Eur. J. Oper. Res..

[10]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[11]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[12]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[13]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[14]  Ali Amiri,et al.  Designing Partially Survivable Cellular Telecommunications Networks , 2005, Inf. Technol. Manag..

[15]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[16]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[17]  David Pisinger An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[18]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .