Joint configuration of backbone and logical networks on a reconfigurable packet-switched network with unreliable links

Engineering Optimization

Volumn 30, Issue 3-4, 1998, Pages 309-331

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

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

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

Author keywords

Configuration; Heuristics; Lagrangean relaxation; Network design; Packet switched network; Reliability

Indexed keywords

ELECTRIC NETWORK SYNTHESIS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; PACKET NETWORKS; PROBLEM SOLVING; RELAXATION PROCESSES; RELIABILITY; TELECOMMUNICATION LINKS;

LAGRANGIAN RELAXATION; LOGICAL NETWORKS;

INTEGER PROGRAMMING;

EID: 0031643986     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159808941249     Document Type: Article

References (26)

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. Camerini, P. M., Fratta, L. and Naffioli, F. (1975). On improving relaxation methods by modified gradient techniques. Mathematical Programming Study, 3, 26-34.
3. Gavish, B. (1982). Topological design of centralized computer networks: formulations and algorithms. Networks, 12, 355-377.
4. Gavish, B. and Hantler, S. L. (1983). An algorithm for optimal route selection in SNA Networks. IEEE Transactions on Communications, 31(10), 1154-1161.
5. Gavish, B. and Neuman, I. (1992). Routing in a network with unreliable components. IEEE Transactions on Communications, 40(7), 1248-1258.
6. Gavish, B. and Pirkul, H. (1985). Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Mathematical Programming, 31, 78-105.
7. 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.
8. 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(8), 1253-1262.
9. Ghosh, D. and Mitra, S. (1992). Configuring express pipes in emerging telecommunication networks. Working Paper, Dept. of Quantitative Business Analysis, Louisiana State Univ., Baton Rouge, LA.
10. Gobal, G., Kim, C. K. and Weinrib, A. (1990). Dynamic network configuration management. Proceedings of IEEE ICC' 90, 295-301.
11. Gopal, G., Kim, C. K. and Weinrib, A. (1991). Algorithms For reconfigurable networks. 13th International Teletraffic Congress, 341-347.
12. Held, M. and Karp, R. M. (1970). The traveling salesman problem and minimum spanning trees. Operations Research, 18(6), 1138-1162.
13. Held, M., Wolfe, P. and Crowder, H. (1974). Validation of subgradient optimization. Mathematical Programming, 6, 62-88.
14. 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.
15. Lee, M. J. and Yee, J. R. (1993). A design algorithm for reconfigurable ATM networks. Proceedings of IEEE INFOCOM' 93, 144-151.
16. Lee, M. J. and Yee, J. R. (1995). A logical topology and discrete capacity assignment algorithm for reconfigurable networks. Operations Research, 43(1), 102-116.
17. Li, V. O. K. and Silvester, J. A. (1984). Performance analysis of network with unreliable components. IEEE Transactions on Communications, 32(10), 1105-1110.
18. Medhi, D. (1985). Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks. Proceedings of IEEE INFOCOM'95, 900-907.
19. Mirzaian, A. (1985). Lagrangean relaxation for the star - star concentrator location problem: approximation algorithm and bounds. Networks, 15, 1-20.
20. Monterio, J. A. S. and Gerla, M. (1990). Topological reconfiguration of ATM networks. Proceedings of IEEE INFOCOM'90, 207-214.
21. Ng, Tomy, M. J. and Hoang, Doan B. (1987). Joint optimization of capacity and flow assignment in a packet-switched communications network. IEEE Transactions on Communications, 35(2), 202-209.
22. Pazos-Rangel, R. A. and Gerla, M. (1982). Express pipe networks. Proceedings of Global Telecommunication Conference, 293-297.
23. Sanso, B., Gendreau, M. and Soumis, F. (1992). An algorithm for network dimensioning under reliability considerations. Annals of Operations Research, 36, 263-274.
24. Shinha, P. and Zoltners, A. A. (1979). The multiple choice knapsack problem. Operations Research, 27(3), 503-515.
25. Sung, C. S. and Lee, J. H. (1996). Configuring both backbone and logical networks of a reconfigurable network with link failures allowed. Engineering Optimization, 26, 227-249.
26. Sung, C. S. and Lee, K. B. (1995). A routing algorithm for virtual circuit data networks with unreliable links. Engineering Optimization, 24, 119-136.