Configuring both backbone and logical networks of a reconfigurable network with link failures allowed

Engineering Optimization

Volumn 26, Issue 3, 1996, Pages 227-249

  Sung, Chang Sup ^a   Lee, Jong Hyup ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

Configuration; Heuristic algorithm; Lagrangean relaxation; Net work design; Reliability; Telecommunication networks

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; NUMERICAL ANALYSIS; RELIABILITY; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

BACKBONE LINK CAPACITY EXPANSION COST; BACKBONE NETWORKS; HOP COST; LAGRANGEAN RELAXATION TECHNIQUE; LOGICAL NETWORKS; LOST CALL TRAFFIC PENALTY; RECONFIGURABLE LOGICAL NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0029707926     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159608941120     Document Type: Article

References (34)

1. Bazaraa, M. S. and Goode, J. J. (1979) A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality. European Journal of Operational Research, 3, 322-338.
2. Bellamy, J. C. (1982) Digital Telephony. New York, Wiley.
3. Camerini, P. M. Fratta, L. and Naffioli, F. (1975) On improving relaxation methods by modified gradient techniques. Mathematical Programming Study, 3, 26-34.
4. Collins, A. A. and Pederson, R. D. (1973) Telecommunications: A Time for Innovation. Merle collins Foundation, Dallas, Texas.
5. Fleischman, J. S. and Proctor, P. E. (1988) Operations planning for informatin age. IEEE Journal on Selected Areas in Communications, 6, (4) 633-640.
6. Gavish, B. (1982) Topological design of centralized computer networks: formulations and algorithms. Networks, 12, 355-377.
7. Gavish, B. and Neuman, I. (1992) Routing in a network with unreliable components. IEEE Transactions on Communications, 40(7), 1248-1258.
8. Gavish, B. and Pirkul, H. (1985) Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Mathematical Programming, 31, 78-105.
9. Gavish, B., Trudeau, P., Dror, M., Gendreau, M. and Mason, L. (1989) Fiberoptic circuit network design under reliability constraints. IEEE Journal on Selected Areas in Communications, 7(8), 1181-1187.
10. Geoffrion, A. M. (1974) Lagrangian relaxation and Its uses in integer programming. Mathematical Programming Study, 2, 82-114.
11. Gerla, M. Monteiro, J. A. S. and Pazos, R. (1989) Topology design and bandwidth allocation in ATM Nets, IEEE Journal on Selected Areas in Communications, 7, 1253-1262.
12. Ghosh, D. and Mitra, S (1992) Configuring express pipes in emerging telecommunication networks. Working paper.
13. Gopal, G., Kim, C. K. and Weinrib, A. (1990) Dynamic network configuration management. Proceedings of IEEE ICC'90, 250-301.
14. Gopal, G., Kim, C. K. and Weinrib, A. (1991) Algorithms for reconfigurable networks. 13th International Teletraffic Congress, 341-347.
15. Gould, E. P. and Pack, C. D. (1987) Communications network planning in the evolving information age. IEEE Communications Magazine, 25 (9), 22-30.
16. Harris, R. J. (1994) Reliable design of communication networks. 14th International Teletraffic Congress, 1331-1340.
17. Held, M. and Karp, R. M. (1970) The travelling salesman problem and minimum spanning trees. Operations Research, 18, 1138-1162.
18. Held, M., Wolfe, P. and Crowder, H. (1974) Validation of subgradient optimization. Mathematical Programming, 6, 62-88.
19. Jagerman, D. L. (1984) Methods in traffic calculations. AT&T Bell Labs Technical Journal, 63(7), 1283-1310.
20. Jagers, A. A. and Doorn, E. A. V. (1986) On the continued Erlang loss function. Operations Research Letters, 5, 43-46.
21. Krishnan, K. R. (1990) The convexity of loss rate in an Erlang loss system and sojourn in an Erlang delay system with respect to arrival and service rates. IEEE Transactions on Communications, 38, 1314-1316
22. Lai, M. K. F. and Berry, P. E. (1992) Reliability of high-speed networks. Australian Telecommunications Research, 26,(2), 39-54.
23. Lee, M. J. and Yee, J. R. (1989) An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning networks. Proceedings of IEEE INFOCOM'89, 127-135.
24. Lee, M. J. and Yee, J. R. (1991) A partial branch-and-bound design algorithm for reconfigurable networks. Proceedings of IEEE ICC'91, 682-686.
25. Lee, M. J. and Yee, J. R. (1993).A design algorithm for reconfigurable ATM networks. Proceedings of IEEE INFOCOM'93, 144-151.
26. Li V. O. K. and Silvester, J. A. (1984) Performance analysis of network with unreliable components. IEEE Transactions on Communications, 32,(10), 1105-1110.
27. Medhi, D. (1995) Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks.. Proceedings of IEEE INFOCOM'95, 900-907.
28. Mirzaian, A. (1985) Lagrangean relaxation for the star-star concentrator location problem: approximation algorithm and bounds. Networks, 15, 1-20.
29. Nemhauser, G. and Wolsey, L. (1988) Integer and Combinatorial Optimization. John Wiley & Sons.
30. Pazos-Rangel, R. A. and Gerla, M. (1982) Express pipe networks. Proceedings of Global Telecommunication Conference, 293-297.
31. Sanso, B., Gendreau, M. and Soumis, F. (1992) An algorithm for network dimensioning under reliability considerations. Annals of Operations Research, 36, 263-274.
32. Shinha, P. and Zoltners, A. A. (1979) The multiple choice knapsack problem. Operations Research, 3, 503-515.
33. Sung, C. S. and Lee, K. B. (1995) A routing algorithm for virtual circuit data networks with unreliable links. Engineering Optimization, 24,(2), 119-136
34. Sung, C. S. Park, S. K. An algorithm for configuring embedded networks in reconfigurable telecommunication networks. Telecommunication Systems, (to appear).