Telecommunication access network design with reliability constraints

IEEE Transactions on Reliability

Volumn 53, Issue 4, 2004, Pages 532-541

  Soni, Samit ^a   Narasimhan, Sridhar ^a   LeBlanc, Larry J ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Access network design; Heuristics; Simulated annealing; Telecommunications

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PERTURBATION TECHNIQUES; SIMULATED ANNEALING; TELECOMMUNICATION NETWORKS;

ACCESS NETWORK DESIGN; RELIABILITY CONSTRAINTS;

RELIABILITY THEORY;

EID: 10244265912     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2004.837522     Document Type: Article

References (18)

1. K. Altinkemer and H. Pirkul, "Heuristics with constant error guarantees for the multi-center capacitated minimum spanning tree problem," J. Inform. Optim. Sci., vol. 13, no. 1, pp. 49-71, 1992.
2. A. Dutta and P. Kubat, "Design of partially survivable networks for cellular telecommunication systems," Eur. J. Oper. Res., vol. 118, pp. 52-64, 1999.
3. B. Gavish, "Topological design of centralized computer networks-formulations and algorithms," Networks, vol. 12, no. 4, pp. 355-377, 1982.
4. B. Gavish, "Topological design of telecommunication networks - local access design methods," Ann. Oper. Res., vol. 33, no. 1-4, pp. 17-71, 1991.
5. L. Gouveia, "A 2n constraint formulation for the capacitated minimal spanning tree problem," Oper. Res., vol. 43, no. 1, pp. 130-141, 1995.
6. L. Gouveia and J. Lopes, "Using generalized capacitated trees for designing the topology of local access," Telecommunication Systems - Modeling, Analysis, Design and Management, vol. 7, no. 4, pp. 315-337, 1997.
7. A. Kershenbaum, "Computing capacitated minimal spanning trees efficiently," Networks, vol. 4, no. 4, pp. 299-310, 1974.
8. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Sci., vol. 220, pp. 671-680, 1983.
9. J. G. Klincewicz, "Hub location in backbone/tributary network design: a review," Location Sci., vol. 6, no. 1-4, pp. 307-335, 1998.
10. P. Kubat, J. M. Smith, and C. Yum, "Design of cellular networks with diversity and capacity constraints," IEEE Trans. Rel., vol. 49, pp. 165-175, 2000.
11. L. LeBlanc et al., "Topology design and bridge-capacity assignment for interconnecting token ring LANs: a simulated annealing approach," Telecommunication Systems, vol. 6, pp. 21-43, 1996.
12. Y. Lee, "An algorithm for the design of multitype concentrator networks," J. Oper. Res. Soc., vol. 44, no. 5, pp. 471-482, 1993.
13. P. V. McGregor and D. Shen, "Network design: algorithm for the access facility location problem," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 61-73, 1977.
14. S. Narasimhan and H. Pirkul, "Hierarchical concentrator location problem," Comput. Commun., vol. 15, no. 3, pp. 185-191, 1992.
15. H. Pirkul et al., "Locating concentrators for primary and secondary coverage in a computer communications network," IEEE Trans. Commun., vol. 36, no. 4, pp. 450-458, 1988.
16. H. Pirkul and V. Nagarajan, "Locating concentrators in centralized computer network," Ann. Oper Res., vol. 36, no. 1-4, pp. 247-261, 1992.
17. H. Pirkul and R. Gupta, "Topological design of centralized computer networks," Int. Trans. Oper. Res., vol. 4, no. 1, pp. 75-83, 1997.
18. G. M. Schneider and M. N. Zastrow, "An algorithm for the design of multilevel concentrator networks," Computer Networks, vol. 6, no. 1, pp. 1-11, 1982.