{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:04Z","timestamp":1740181564583,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s42979-020-00319-4","type":"journal-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T16:02:27Z","timestamp":1600531347000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Path Computation for Dynamic Provisioning in Multi-Technology Multi-Layer Transport Networks"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5685-588X","authenticated-orcid":false,"given":"Madanagopal","family":"Ramachandran","sequence":"first","affiliation":[]},{"given":"Krishna M.","family":"Sivalingam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"319_CR1","unstructured":"Generic functional architecture of transport networks. ITU-T Recommendation G.805. 2000."},{"issue":"3","key":"319_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1011495129926","volume":"3","author":"NM Bhide","year":"2001","unstructured":"Bhide NM, Sivalingam KM, Fabry-Asztalos T. Routing mechanisms employing adaptive weight functions for shortest path routing in optical WDM networks. Photonic Netw Commun. 2001;3(3):227\u201336.","journal-title":"Photonic Netw Commun."},{"key":"319_CR3","doi-asserted-by":"crossref","unstructured":"Dijkstra F, Andree B, Koymans K, Van Der\u00a0Ham J, Grosso P, de\u00a0Laat C A multi-layer network model based on ITU-T G. 805. Computer Networks 2008; 52(10):1927\u20131937","DOI":"10.1016\/j.comnet.2008.02.013"},{"issue":"2","key":"319_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.future.2008.07.002","volume":"25","author":"F Dijkstra","year":"2009","unstructured":"Dijkstra F, van der Ham J, Grosso P, de Laat C. A path finding implementation for multi-layer networks. Future Gen Comput Syst. 2009;25(2):142\u20136.","journal-title":"Future Gen Comput Syst."},{"issue":"2","key":"319_CR5","doi-asserted-by":"publisher","first-page":"s12","DOI":"10.1109\/MCOM.2012.6146481","volume":"50","author":"O Gerstel","year":"2012","unstructured":"Gerstel O, Jinno M, Lord A, Yoo SB. Elastic optical networking: a new dawn for the optical layer? IEEE Commun Mag. 2012;50(2):s12\u201320.","journal-title":"IEEE Commun Mag."},{"issue":"8","key":"319_CR6","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1364\/JOCN.5.000836","volume":"5","author":"L Gong","year":"2013","unstructured":"Gong L, Zhou X, Liu X, Zhao W, Lu W, Zhu Z. Efficient resource allocation for all-optical multicasting over spectrum-sliced elastic optical networks. J Opt Commun Netw. 2013;5(8):836\u201347.","journal-title":"J Opt Commun Netw."},{"key":"319_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.comcom.2015.01.010","volume":"62","author":"F Iqbal","year":"2015","unstructured":"Iqbal F, van der Ham J, Kuipers F. Technology-aware multi-domain multi-layer routing. Comput Commun. 2015;62:85\u201396.","journal-title":"Comput Commun."},{"issue":"10","key":"319_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/MCOM.2016.7588279","volume":"54","author":"C Janz","year":"2016","unstructured":"Janz C, Ong L, Sethuraman K, Shukla V. Emerging transport SDN architecture and use cases. IEEE Commun Mag. 2016;54(10):116\u201321.","journal-title":"IEEE Commun Mag."},{"issue":"1","key":"319_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.comcom.2008.09.026","volume":"32","author":"F Kuipers","year":"2009","unstructured":"Kuipers F, Dijkstra F. Path selection in multi-layer networks. Comput Commun. 2009;32(1):78\u201385.","journal-title":"Comput Commun."},{"key":"319_CR10","doi-asserted-by":"crossref","unstructured":"Lamali ML, Fergani N, Coheny J, Pouyllau H Path computation in multi-layer networks: Complexity and algorithms. In: Proceedings of IEEE INFOCOM, pp 2016; 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524550"},{"issue":"6","key":"319_CR11","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1109\/TNET.2018.2878103","volume":"26","author":"ML Lamali","year":"2018","unstructured":"Lamali ML, Fergani N, Cohen J. Algorithmic and complexity aspects of path computation in multi-layer networks. IEEE\/ACM Trans Netw. 2018;26(6):2787\u2013800.","journal-title":"IEEE\/ACM Trans Netw."},{"issue":"1","key":"319_CR12","doi-asserted-by":"publisher","first-page":"A122","DOI":"10.1364\/JOCN.10.00A122","volume":"10","author":"S Liu","year":"2018","unstructured":"Liu S, Lu W, Zhu Z. On the cross-layer orchestration to address ip router outages with cost-efficient multilayer restoration in ip-over-eons. IEEE\/OSA J Opt Commun Netw. 2018;10(1):A122\u201332.","journal-title":"IEEE\/OSA J Opt Commun Netw."},{"key":"319_CR13","doi-asserted-by":"crossref","unstructured":"Lopez-Pajares D, Alvarez-Horcajo J, Rojas E, Carral JA, Ibanez G Iterative discovery of multiple disjoint paths in switched networks with multicast frames. In: 2018 IEEE 43rd Conference on Local Computer Networks (LCN), IEEE, 2018; pp 409\u2013412","DOI":"10.1109\/LCN.2018.8638130"},{"issue":"5","key":"319_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MNET.2015.7293303","volume":"29","author":"P Lu","year":"2015","unstructured":"Lu P, Zhang L, Liu X, Yao J, Zhu Z. Highly efficient data migration and backup for big data applications in elastic optical inter-data-center networks. IEEE Netw. 2015;29(5):36\u201342.","journal-title":"IEEE Netw."},{"issue":"10","key":"319_CR15","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1109\/JLT.2018.2803069","volume":"36","author":"W Lu","year":"2018","unstructured":"Lu W, Yin X, Cheng X, Zhu Z. On cost-efficient integrated multilayer protection planning in ip-over-eons. J Lightwave Technol. 2018;36(10):2037\u201348.","journal-title":"J Lightwave Technol."},{"key":"319_CR16","doi-asserted-by":"crossref","unstructured":"Madanagopal R, Rani NU, Gonsalves TA Path computation algorithms for dynamic service provisioning in SDH networks. In: $$10^{th}$$ IFIP\/IEEE Symposium on Integrated Management (IM), 2007; pp 206\u2013215","DOI":"10.1109\/INM.2007.374785"},{"issue":"5","key":"319_CR17","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1109\/TNET.2010.2043538","volume":"18","author":"R Madanagopal","year":"2010","unstructured":"Madanagopal R, Rani NU, Gonsalves TA. Path computation algorithms for dynamic service provisioning with protection and inverse multiplexing in SDH\/SONET networks. IEEE\/ACM Trans Netw. 2010;18(5):1492\u2013504.","journal-title":"IEEE\/ACM Trans Netw."},{"issue":"1","key":"319_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1111\/itor.12544","volume":"27","author":"B Mart\u00edn","year":"2020","unstructured":"Mart\u00edn B, S\u00e1nchez \u00c1, Beltran-Royo C, Duarte A. Solving the edge-disjoint paths problem using a two-stage method. Int Trans Oper Res. 2020;27(1):435\u201357.","journal-title":"Int Trans Oper Res."},{"issue":"4","key":"319_CR19","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/COMST.2014.2327754","volume":"16","author":"A Martinez","year":"2014","unstructured":"Martinez A, Yannuzzi M, Lopez V, Lopez D, Ramirez W, Serral-Gracia R, Masip-Bruin X, Maciejewski M, Altmann J. Network management challenges and trends in multi-layer and multi-vendor settings for carrier-grade networks. Commun Surv Tutor IEEE. 2014;16(4):2207\u201330.","journal-title":"Commun Surv Tutor IEEE."},{"issue":"12","key":"319_CR20","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1364\/JOCN.3.000912","volume":"3","author":"A Patel","year":"2011","unstructured":"Patel A, Jue J. Routing and scheduling for variable bandwidth advance reservation. IEEE\/OSA J Opt Commun Netw. 2011;3(12):912\u201323.","journal-title":"IEEE\/OSA J Opt Commun Netw."},{"key":"319_CR21","unstructured":"Prakash A, Kannan R, Bafna G Disjoint path computation systems and methods in optical networks. US Patent 10,003,867 2018"},{"key":"319_CR22","doi-asserted-by":"crossref","unstructured":"Ramachandran M, Sivalingam KM Topology based path computation for provisioning in transport networks. In: $$9^{th}$$ International Conference on Communication Systems and Networks (COMSNETS), 2017; pp 166\u2013173","DOI":"10.1109\/COMSNETS.2017.7945373"},{"issue":"11","key":"319_CR23","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1364\/JOCN.11.000568","volume":"11","author":"I Szczesniak","year":"2019","unstructured":"Szczesniak I, Jajszczyk A, Wozna-Szczesniak B. Generic dijkstra for optical networks. IEEE\/OSA J Opt Commun Netw. 2019;11(11):568\u201377.","journal-title":"IEEE\/OSA J Opt Commun Netw."},{"key":"319_CR24","unstructured":"Tanaka J Path generating method, relay device, and computer product. US Patent 8,665,754 2014"},{"issue":"6","key":"319_CR25","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/TNET.2011.2134866","volume":"19","author":"D Xu","year":"2011","unstructured":"Xu D, Chiang M, Rexford J. Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering. IEEE\/ACM Trans Netw. 2011;19(6):1717\u201330.","journal-title":"IEEE\/ACM Trans Netw."},{"issue":"11","key":"319_CR26","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY. Finding the k shortest loopless paths in a network. Manag Sci. 1971;17(11):712\u20136.","journal-title":"Manag Sci."},{"issue":"10","key":"319_CR27","doi-asserted-by":"publisher","first-page":"A100","DOI":"10.1364\/JOCN.5.00A100","volume":"5","author":"Y Yin","year":"2013","unstructured":"Yin Y, Zhang H, Zhang M, Xia M, Zhu Z, Dahlfort S, Yoo SB. Spectral and spatial 2d fragmentation-aware routing and spectrum assignment algorithms in elastic optical networks. IEEE\/OSA J Opt Commun Netw. 2013;5(10):A100\u20136.","journal-title":"IEEE\/OSA J Opt Commun Netw."},{"issue":"1","key":"319_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/JLT.2012.2227683","volume":"31","author":"Z Zhu","year":"2012","unstructured":"Zhu Z, Lu W, Zhang L, Ansari N. Dynamic service provisioning in elastic optical networks with hybrid single-\/multi-path routing. J Lightwave Technol. 2012;31(1):15\u201322.","journal-title":"J Lightwave Technol."},{"key":"319_CR29","unstructured":"JGrapht - a Java library of graph theory data structures and algorithms. https:\/\/jgrapht.org\/."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-020-00319-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:59:25Z","timestamp":1632013165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-020-00319-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,19]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["319"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00319-4","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2020,9,19]]},"assertion":[{"value":"24 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"304"}}