{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T05:24:00Z","timestamp":1735795440570,"version":"3.32.0"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2005,6,13]],"date-time":"2005-06-13T00:00:00Z","timestamp":1118620800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2005,8]]},"abstract":"Abstract<\/jats:title>Intradomain traffic engineering aims to make more efficient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open Shortest Path First) and IS\u2010IS (Intermediate System\u2010Intermediate System) are commonly used to select the paths along which traffic is routed within an autonomous system. These routing protocols direct traffic based on link weights assigned by the network operator. Each router in the autonomous system computes shortest paths and creates destination tables used to direct each packet to the next router on the path to its final destination. Given a set of traffic demands between origin\u2010destination pairs, the OSPF weight setting problem consists of determining weights to be assigned to the links so as to optimize a cost function, typically associated with a network congestion measure. In this article, we propose a genetic algorithm with a local improvement procedure for the OSPF weight\u2010setting problem. The local improvement procedure makes use of an efficient dynamic shortest path algorithm to recompute shortest paths after the modification of link weights. We test the algorithm on a set of real and synthetic test problems, and show that it produces near\u2010optimal solutions. We compare the hybrid algorithm with other algorithms for this problem illustrating its efficiency and robustness. \u00a9 2005\u00a0Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 36\u201356 2005<\/jats:p>","DOI":"10.1002\/net.20070","type":"journal-article","created":{"date-parts":[[2005,6,13]],"date-time":"2005-06-13T20:47:34Z","timestamp":1118695654000},"page":"36-56","source":"Crossref","is-referenced-by-count":95,"title":["A hybrid genetic algorithm for the weight setting problem in OSPF\/IS\u2010IS routing"],"prefix":"10.1002","volume":"46","author":[{"given":"L.S.","family":"Buriol","sequence":"first","affiliation":[]},{"given":"M.G.C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"C.C.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"M.","family":"Thorup","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015061802659"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"e_1_2_1_4_2","unstructured":"A.Bley M.Gr\u00f6tchel R.Wessl\u00e4y Design of broadband virtual private networks: Model and heuristics for the B\u2010WiN Technical Report SC 98\u201013 (1998) Konrad\u2010Zuse\u2010Zentrum fur Informationstecknik Berlin (To appear in Proc. DIMACS Workshop on Robust Communication Network and Survivability AMS\u2010DIMACS Series)."},{"volume-title":"Speeding up dynamic shortest path algorithms, Technical report","year":"2003","author":"Buriol L.S.","key":"e_1_2_1_5_2"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/35.587723"},{"volume-title":"Configuring OSPF","year":"1997","author":"Cisco","key":"e_1_2_1_7_2"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"e_1_2_1_12_2","article-title":"Experimental analysis of dynamic algorithms for the single source shortest path problem","volume":"3","author":"Frigioni D.","year":"1998","journal-title":"ACM J Exp Alg"},{"key":"e_1_2_1_13_2","first-page":"212","volume-title":"Discrete Algorithms","author":"Frigioni D.","year":"1996"},{"key":"e_1_2_1_14_2","unstructured":"Internet Engineering Task Force Ospf version 2 Technical Report RFC 1583(1994) Network Working Group."},{"key":"e_1_2_1_15_2","unstructured":"1993 F. Lin J. Wang Minimax open shortest path first routing algorithms in networks supporting the smds services 666 670"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"volume-title":"OSPF, Anatomy of an Internet Routing Protocol","year":"1998","author":"Moy J.T.","key":"e_1_2_1_17_2"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00036-6"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.2267"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_8"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"volume-title":"Achieving near\u2010optimal traffic engineering solutions for current OSPF\/IS\u2010IS networks, Sprint ATL Technical Report TR02\u2010ATL\u2010022037","year":"2002","author":"Sridharan A.","key":"e_1_2_1_23_2"},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","unstructured":"2002 L. Subramanian S. Agarwal J. Rexford R.H. Katz Characterizing the Internet hierarchy from multiple vantage points 618 627","DOI":"10.1109\/INFCOM.2002.1019307"},{"volume-title":"OSPF network design solutions","year":"1998","author":"Thomas T.M.","key":"e_1_2_1_25_2"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_2_1_27_2","unstructured":"E.W.Zegura GT\u2010ITM: Georgia Tech internetwork topology models (software) 1996.http:\/\/www.cc.gatech.edu\/fac\/Ellen.Zegura\/gt\u2010itm\/gt\u2010itm.tar.gz."},{"key":"e_1_2_1_28_2","doi-asserted-by":"crossref","unstructured":"E.W.Zegura K.L.Calvert S.Bhattacharjee \u201cHow to model an internetwork \u201d Proc. 15th IEEE Conf. on Computer Communications (INFOCOM) 1996 pp.594\u2013602","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20070","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T17:45:09Z","timestamp":1735753509000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["10.1002\/net.20070"],"URL":"https:\/\/doi.org\/10.1002\/net.20070","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[2005,6,14]]}}}