Fast heuristic techniques for intra-domain routing metric optimization

In this study we present two heuristic approaches to generate fast and efficient link metricfor intra-domain routing. We also present some promising experimental results that weredone using various sizes of networks and traffic matrices.

[1]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[2]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[3]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Deep Medhi,et al.  Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach , 2005, IEEE Transactions on Network and Service Management.

[5]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[6]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[7]  Michal Pióro,et al.  On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.

[8]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).