A bicriteria optimization approach for robust OSPF routing

Proceedings of the 3rd IEEE Workshop on IP Operations and Management, IPOM 2003

Volumn , Issue , 2003, Pages 91-97

  Yuan, Di ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Computer networks; Cost function; Failure analysis; Optimization methods; Robustness; Routing protocols; Telecommunication traffic

Indexed keywords

COMPUTER NETWORKS; COST BENEFIT ANALYSIS; COST FUNCTIONS; COSTS; ECONOMIC AND SOCIAL EFFECTS; FAILURE ANALYSIS; INTERNET PROTOCOLS; PARETO PRINCIPLE; ROBUSTNESS (CONTROL SYSTEMS); ROUTING PROTOCOLS; TELECOMMUNICATION TRAFFIC;

BICRITERIA OPTIMIZATION; INTRA-DOMAIN ROUTING; LOCAL SEARCH ALGORITHM; NETWORK CONGESTIONS; OBJECTIVE FUNCTIONS; OPEN SHORTEST PATH FIRST; OPTIMIZATION METHOD; PARETO OPTIMAL SOLUTIONS;

OPTIMIZATION;

EID: 84945363184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPOM.2003.1251229     Document Type: Conference Paper

References (34)

1. J. Armitage, O. Crochat, and J. Y. LeBoudec, "Design of a Survivable WDM Photonic Network," Proceedings of IEEE INFOCOM '97, vol. 1, pp. 244-252, 1997.
2. E. H. L. Aarts and J. K. Lenstra, Eds., Local Search in Combinatorial Optimization, John Wiley & Sons, New York, 1997.
3. G. R. Ash, F. Chang, and D. Medhi, "Robust Traffic Design for Dynamic Routing Networks," Proceedings of IEEE INFOCOM '91, vol. 2, pp. 508-514, 1991.
4. K. Balakrishnan, D. Tipper, and D. Medhi, "Routing Strategies for Fault Recovery in Wide Area Packet Networks," Proceedings of IEEE Military Communications Conference (MILCOM) '95, vol. 3, pp. 1139-1143, 1995.
5. L. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, "A Memetic Algorithm for OSPF Routing", Proceedings of the 6th INFORMS Telecommunications Conference, pp. 187-188,, 2002.
6. C. A. Coello Coello, D. A. Van Veldhuizen, and G. B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, 2002.
7. R. H. Cardwell, C. L. Monma, and T.-H. Wu, "Computer-Aided Design Procedures for Survivable Fiber Optic Networks," IEEE Journal on Selected Areas in Communications, vol. 7, pp. 1188-1197, 1989.
8. T. Cinkler, D. Marx, C. P. Larsen, and D. Fogaras, "Heuristic Algorithms for Joint Configuration of Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks," Proceedings of IEEE INFOCOM 2000, vol. 2, pp. 1000-1009, 2000.
9. S.-T. Cheng, "Topological Optimization of a Reliable Communication Network," IEEE Transactions on Reliability, vol. 47, pp. 225-233, 1998.
10. D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of K-Shortest Paths and Maximum Flow Routing for Network Facility Restoration," IEEE Journal on Selected Areas in Communications, vol. 12, pp. 88-99, 1994.
11. M. Ehrgott and X. Gandibleux, Eds., Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, Kluwer Academic Publishers, 2002.
12. V. A. Emelichev and V. A. Perepelitsa, "On Cardinality of the Set of Alternatives in Discrete Many-Criterion Problems," Discrete Mathematics and Applications, vol. 2, pp. 461-471, 1992.
13. M. Ericsson, M. G. C. Resende, and P. M. Pardalos, "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," Journal of Combinatorial Optimization, vol. 6, pp. 299-333, 2002.
14. C. M. Fonseca and P. J. Fleming, "Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms - Part I: A Unified Formulation," IEEE Transactions on Systems, Man, and Cybernetics, vol. 28, pp. 26-37, 1998.
15. C. M. Fonseca and P. J. Fleming, "Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms - Part II: Application Example," IEEE Transactions on Systems, Man, and Cybernetics, vol. 28, pp. 38-47, 1998.
16. B. Fortz and M. Thorup, "Internet Traffic Engineering by Optimizing OSPF Weights," Proceedings of IEEE INFOCOM 2000, vol. 2, pp. 519-528, 2000.
17. B. Fortz and M. Thorup, "Increasing Internet Capacity Using Local Search," Technical Report, Institute de Statistique et de Recherche Opérationelle, Université de Bruxelles, Belgium, 2000.
18. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS Weights in a Changing World," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 756-767, 2002.
19. M. Gröschel, C. L. Monma, and M. Stoer, "Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints," Operations Research, vol. 40, pp. 309-330, 1992.
20. K. Holmberg and D. Yuan, "Optimization of Internet Protocol Network Design and Routing," Technical Report, Department of Mathematics, Linköping university, Sweden, 2002. To appear in Networks.
21. C.-L. Hwang, S. R. Paidy, and K. Yoon, "Mathematical Programming with Multiple Objectives: A Tutorial," Computers & Operations Research, vol. 7, pp. 5-31, 1980.
22. H. Isermann, "Proper Efficiency and the Linear Vector Maximum Problem," Operations Research, vol. 22, pp. 189-191, 1974.
23. J.-L. Lutton, D. Nace, and J. Carlier, "Assigning Spare Capacities in Mesh Survivable Networks," Telecommunication Systems, vol. 13, pp. 441-451, 2000.
24. D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Transactions on Communications, vol. 42, pp. 534-548, 1994.
25. D. Medhi and R. Khurana, "Optimization and Performance of Restoration Schemes for Wide-Area Teletraffic Networks," Journal of Network and Systems Management, vol. 3, pp. 265-294, 1995.
26. Y. Miyao and H. Saito, "Optimal Design and Evaluation of Survivable WDM Transport Networks," IEEE Journal on Selected Areas in Communications, vol. 16, pp. 1190-1198, 1998.
27. C. L. Monma and D. F. Shallcross, "Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints," Operations Research, vol. 37, pp. 531-541, 1989.
28. J. T. Moy, OSPF: Anatomy of an Internet Routing Protocol, Addison-Wesley, 1998.
29. K. Murakami and H. S. Kim, "Comparative Study on Restoration Schemes of Survivable ATM Networks," Proceedings of IEEE INFOCOM '97, vol. 1, pp. 345-352, 1997.
30. A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, and C. Diot, "IGP Link Weight Assignment for Transient Link Failures," Proceedings of the 18th International Teletraffic Conference (ITC 2003). (To appear.)
31. M. Pióro, Á. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski, "On Open Shortest Path First Related Network Optimisation Problems," Performance Evaluation, vol. 48, pp. 201-223, 2002.
32. B. Sansó, M. Gendreau, and F. Soumis, "An Algorithm for Network Dimensioning under Reliability Considerations," Annals of Operations Research, vol. 36, pp. 263-274, 1992.
33. A. Sen, B, Hao, B. H. Shen, and G. Lin, "Survivable Routing in WDM Networks - Logical Ring in Arbitrary Physical Topology," Proceedings of IEEE International Communication Conference (ICC) 2002, pp. 2771-2775, 2002.
34. R. E. Steuer, Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley & Sons, New York, 1986.