{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:59Z","timestamp":1750308719348,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":15,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hanoi University of Science and Technology"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2676585.2676625","type":"proceedings-article","created":{"date-parts":[[2015,1,16]],"date-time":"2015-01-16T19:18:59Z","timestamp":1421435939000},"page":"136-145","source":"Crossref","is-referenced-by-count":1,"title":["How simple routing algorithms are good for solving RWA problem in survival optical networks?"],"prefix":"10.1145","author":[{"given":"Dieu Linh","family":"Truong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang Huy","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2676585.2676625-1","doi-asserted-by":"crossref","unstructured":"N. Banerjee and S. Sharan. A evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks. InProceedings of International Conference on Intelligent Sensing and Information Processing, 2004., pages 13--18, 2004.","DOI":"10.1109\/ICISIP.2004.1287616"},{"key":"key-10.1145\/2676585.2676625-2","doi-asserted-by":"crossref","unstructured":"I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: an approach to high bandwidth optical WAN's.IEEE Transactions on Communications, 40(7): 1171--1182, Jul 1992.","DOI":"10.1109\/26.153361"},{"key":"key-10.1145\/2676585.2676625-3","doi-asserted-by":"crossref","unstructured":"K. Christodoulopoulos, K. Manousakis, and E. Varvarigos. Comparison of routing and wavelength assignment algorithms in wdm networks. InGlobal Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE, pages 1--6, Nov 2008.","DOI":"10.1109\/GLOCOM.2008.ECP.510"},{"key":"key-10.1145\/2676585.2676625-4","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. Numerische Mathematik.A note on two problems in connexion with graphs, (1): 269--271, 1959.","DOI":"10.1007\/BF01386390"},{"key":"key-10.1145\/2676585.2676625-5","doi-asserted-by":"crossref","unstructured":"B. Jaumard, C. Meyer, and B. Thiongane. On column generation formulations for the RWA problem.Discrete Applied Mathematics, 157(6): 1291--1308, 2009. Reformulation Techniques and Mathematical Programming.","DOI":"10.1016\/j.dam.2008.08.033"},{"key":"key-10.1145\/2676585.2676625-6","doi-asserted-by":"crossref","unstructured":"B. Jaumard, C. Meyer, B. Thiongane, and X. Yu. Ilp formulations and optimal solutions for the rwa problem. InGlobal Telecommunications Conference, 2004. GLOBECOM '04. IEEE, volume 3, pages 1918--1924 Vol. 3, Nov 2004.","DOI":"10.1109\/GLOCOM.2004.1378328"},{"key":"key-10.1145\/2676585.2676625-7","doi-asserted-by":"crossref","unstructured":"K. Li. Heuristic algorithms for routing and wavelength assignment in WDM optical networks. InIEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), pages 1--8, April 2008.","DOI":"10.1109\/IPDPS.2008.4536487"},{"key":"key-10.1145\/2676585.2676625-8","doi-asserted-by":"crossref","unstructured":"A. E. Ozdaglar and D. P. Bertsekas. Routing and Wavelength Assignment in Optical Networks.IEEE\/ACM Transaction on Networking, 11(2): 259--272, Apr. 2003.","DOI":"10.1109\/TNET.2003.810321"},{"key":"key-10.1145\/2676585.2676625-9","doi-asserted-by":"crossref","unstructured":"R. Ramaswami and K. Sivarajan. Routing and wavelength assignment in all-optical networks. Networking,IEEE\/ACM Transactions on, 3(5): 489--500, Oct 1995.","DOI":"10.1109\/90.469957"},{"key":"key-10.1145\/2676585.2676625-10","doi-asserted-by":"crossref","unstructured":"N. Skorin-Kapov. Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks.IEEE Journal on Selected Areas in Communications, 24(8): 2--15, Aug 2006.","DOI":"10.1109\/JSAC.2006.1665142"},{"key":"key-10.1145\/2676585.2676625-11","doi-asserted-by":"crossref","unstructured":"J. W. Suurballe. Disjoint paths in a network.Networks, 4(3): 125--145, 1974.","DOI":"10.1002\/net.3230040204"},{"key":"key-10.1145\/2676585.2676625-12","doi-asserted-by":"crossref","unstructured":"J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths.Networks, 14(2): 325--336, 1984.","DOI":"10.1002\/net.3230140209"},{"key":"key-10.1145\/2676585.2676625-13","doi-asserted-by":"crossref","unstructured":"M. To and P. Neusy. Unavailability analysis of long-haul networks.IEEE Journal on Selected Areas in Communications, 12(1): 100--109, Jan. 1994.","DOI":"10.1109\/49.265709"},{"key":"key-10.1145\/2676585.2676625-14","doi-asserted-by":"crossref","unstructured":"Y. Wang, T. H. Cheng, and M. H. Lim. A Tabu search algorithm for static routing and wavelength assignment problem.IEEE Communications Letters, 9(9): 841--843, Sep 2005.","DOI":"10.1109\/LCOMM.2005.1506721"},{"key":"key-10.1145\/2676585.2676625-15","unstructured":"H. Zang, J. P. Jue, and B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks.Optical Networks Magazine, 1: 47--60, 2000."}],"event":{"name":"the Fifth Symposium","start":{"date-parts":[[2014,12,4]]},"number":"5","location":"Hanoi, Viet Nam","end":{"date-parts":[[2014,12,5]]},"acronym":"SoICT '14"},"container-title":["Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676585.2676625","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2676625&ftid=1529169&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:31Z","timestamp":1750277671000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2676585.2676625"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2014]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1145\/2676585.2676625","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}