Optimizing OSPF/IS-IS weights in a changing world

A system of techniques is presented for optimizing open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS) weights for intradomain routing in a changing world, the goal being to avoid overloaded links. We address predicted periodic changes in traffic as well as problems arising from link failures and emerging hot spots.

[1]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[2]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..

[3]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  A. Dwivedi,et al.  Traffic model for USA long-distance optical network , 2000, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079).

[5]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[6]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[7]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[8]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[9]  Anja Feldmann,et al.  Efficient policies for carrying Web traffic over flow-switched networks , 1998, TNET.

[10]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

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

[12]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  B. Yu,et al.  Time-varying network tomography: router link data , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[14]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[15]  Philippe L. Toint,et al.  Transportation Modelling and Operations Research: A Fruitful Connection , 1998 .

[16]  Debasis Mitra,et al.  A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[17]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[18]  K. G. Ramakrishnan,et al.  Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.

[19]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[20]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[21]  Anwar Elwalid,et al.  A Framework for Internet Traffic Engineering , 2001 .

[22]  Nick G. Duffield,et al.  Trajectory sampling for direct traffic observation , 2001, TNET.

[23]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[24]  Martin Grötschel,et al.  Design of broadband virtual private networks: Model and heuristics for the B-WiN , 1998, Robust Communication Networks: Interconnection and Survivability.

[25]  Christophe Diot,et al.  On the impact of aggregation on the performance of traffic aware routing , 2001 .

[26]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[27]  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).