Optimizing OSPF/IS-IS weights in a changing world

Telecommunication traffic; Multiprotocol label switching; Routing protocols; Concrete; Associate members; Engineering management; IP networks; Economic forecasting; Internet

Abstract :

[en] 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.

Disciplines :

Quantitative methods in economics & management
Computer science

Author, co-author :

Fortz, Bernard ; Université de Liège - ULiège > HEC Liège Research > HEC Liège Research: Business Analytics & Supply Chain Mgmt

Thorup, M.

Language :

English

Title :

Optimizing OSPF/IS-IS weights in a changing world

Publication date :

2002

Journal title :

IEEE Journal on Selected Areas In Communications

ISSN :

0733-8716

Volume :

Issue :

Pages :

756-767

Peer reviewed :

Peer Reviewed verified by ORBi

Additional URL :

https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036578023&doi=10.1109%2fJSAC.2002.1003042&partnerID=40&md5=5d8e25793f08009372d32739e1eb0b75

Available on ORBi :

since 20 May 2024

Statistics

Number of views

1 (0 by ULiège)

Number of downloads

2 (0 by ULiège)

More statistics

Scopus citations^®

501

Scopus citations^®
without self-citations

491

OpenCitations

441

Bibliography

(1997) Local search in combinatorial optimization. Discrete Mathematics and Optimization, E. H. L. Aarts and J. K. Lenstra, Eds.; Chichester, England: Wiley; .
Aiello W., Chung F., Lu L. A random model for massive graphs. Proc. 32nd ACM Symp. Theory Computing (STOC), 2000 171-179.
Awduche D., Chiu A., Elwalid A., Widjaja I., Xiao X., A framework for internet traffic engineering. Network Working Group, Internet Draft (work in progress); 2000. http://search.ietf.org/internet-drafts/draft-ietf-tewg-framework-02.txt
Awduche D.O. (1999) MPLS and traffic engineering in IP networks. IEEE Communications Magazine , Dec.; 37:42-47.
Awduche D.O., Malcolm J., Agogbua J., O'Dell M., McManus J., (Sept.); Requirements for traffic engineering over MPLS. Network Working Group, Request for Comments; 1999. http://search.ietf.org/rfc/rfc2702.txt
Bley A., Grötchel M., Wessäly R. Design of broadband virtual private networks: Model and heuristics for the B-Win. Proc. DIMPCS Workshop on Robust Communication Networks of Survivability AMS-DIMACS Series 53, 1998 1-16.
. http://www.caida.org/tools/visualization/mapnet/Data/
Callon R., (Dec.) Use of OSI IS-IS for routing in TCP/IP and dual environments. Network Working Group, Request for Comments: Rep. 1195; 1990. http://search.ietf.org/rfc/rfc1195.txt
Calvert K., Doar M., Zegura E.W. (1997) Modeling Internet topology. IEEE Commun. Mag. 35:160-163.
Cao J., Davis D., Wiel S.V., Yu B. (2000) Time-varying network tomography: Router link data. J. Amer. Statist. Assoc. 95:1063-1075.
1997. http://www.cisco.com/uni-verc/cc/td/doc/product/software/ios113ed/113ed_ cr/np1_c/1cospf.htm
Duffield N.G., Grossglauser M. Trajectory sampling for direct traffic observation. ACHE/IEEE Trans. Networking 9:280-292.
Dwivedi A., Wagner R.E. (2000) Traffic model for USA long-distance optimal networking. Proc. Optical Fiber Communication Conf. (OFC) TuK1:156-158.
Ericsson M., Resende M.G.C., Pardalos P.M. (2002) A genetic algorithm for the weight setting problem in OSPF routing. J. Combinatorial Optimization, to be published; .
Faloutsos M., Faloutsos P., Faloutsos C. On power-law relationships of the Internet topology. Proc. ACM SIGCOMM'99: Conf. Applications, Technologies Architectures, and Protocols for Computer Communications, 1999 251-262.
Feldmann A., Greenberg A., Lund C., Reingold N., Rexford J. (2000) NetScope: Traffic engineering for IP networks. IEEE Network Mag. (Special Issue on Internet Traffic Eng.) , Mar./Apr.; 14(2):11-19.
Feldmann A., Greenberg A., Lund C., Reingold N., Rexford J., True F. (2001) Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Trans. Networking 265-279.
Feldmann A., Rexford J., Caceres R. (1998) Efficient policies for carrying web traffic over flow-switched networks. IEEE/ACM Trans. Networking 6:673-685.
Fortz B., Thorup M. (2000) Increasing Internet capacity using local search., Université Libre de Bruxelles, Tech. Rep. IS-MG 2000/21; . http://smg.ulb.ac.be/Preprints/Fortz00_21.html
Fortz B., Thorup M. Internet traffic engineering by optimizing OSPF weights. Proc. 19th IEEE Conf. Computer Communications (INFOCOM), 2000 519-528.
Lin F.Y.S., Wang J.L. (1993) Minimax open shortest path first routing algorithms in networks supporting the SMDS services. Proc. IEEE Int. Conf. Communications (ICC) 2:666-670.
Mitra D., Ramakrishnan K.G. A case study of multiservice, multipriority traffic engineering design for data networks. Proc. IEEE GLOBECOM, 1999 1077-1083.
Moy J.T., (July) OSPF version 2, Network Working Group, Request for Comments: 1247; . http://search.ietf.org/rfc/rfc1247.txt
Ramakrishnan K.G., Rodrigues M.A. (2001) Optimal routing in shortest-path data networks. Lucent Bell Labs Technical Journal 6(1).
Rosen E.C., Viswanathan A., Callon R. (2001) Multiprotocol label switching architecture., Network Working Group, Request for Comments; . http://search.ietf.org/rfc/rfc303.txt
Sridharan A., Bhattacharya S., Diot C., Guerin R., Jetcheva J. (2000) On the impact of aggregation on the performance of traffic aware routing., submitted for publication; . http://www.seas.upenn:8080/guerin/
Toint P.L. (1998) Transportation modeling and operations research: A fruitful connection. Operations Research and Decision Aid Methodologies in Traffic and Transportation Management , NATO ASI Series: Ser. F, Computer and Systems Sciencies, M. Labbé, G. Laporte, K. Tanczois and P.L. Toint, Eds. New York: Springer-Verlag; 166:1-27.
Waxman B.M. (1988) Routing of multipoint connections. IEEE J. Select. Areas Commun. (Special Issue on Broadband Packet Communications) 6:1617-1622.
Zegura E.W. (1996) GT-ITM: Georgia Tech internetwork topology models (software).. http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz
Zegura E.W., Calvert K.L., Bhattacharjee S. How to model an internetwork. Proc. 15th IEEE Conf. Computer Communications (INFOCOM), 1996 594-602.