Towards an optimization of the routing parameters for IP networks

Routing is one of the key issues in IP networks. However, few methods exist to optimize the routing for a particular network. Most e ort is invested to improve the routing protocols itself. In this work a possibility to specify appropriate values for the link costs of a given network with linear programs is presented. The obtained link costs can be directly translated into values suitable for the metrics of the two currently most important routing protocols EIGRP and OSPF in today's Internet. With this method a homogeneous distribution of tra c in IP-based networks can be achieved.

[1]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[3]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[4]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[5]  MirchandaniPrakash,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995 .

[6]  Richard J. Harris,et al.  Possibilities for QoS in existing Internet Routing Protocols , 1999 .

[7]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[8]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[9]  G. Ash,et al.  Servicing and real-time control of networks with dynamic routing , 1981, The Bell System Technical Journal.