{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T04:04:23Z","timestamp":1777521863494,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T00:00:00Z","timestamp":1207267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10922-008-9097-x","type":"journal-article","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T17:11:08Z","timestamp":1207242668000},"page":"421-448","source":"Crossref","is-referenced-by-count":6,"title":["A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Francesco","family":"Palmieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Ricciardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,4]]},"reference":[{"key":"9097_CR1","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/26.153361","volume":"40","author":"I. Chlamtac","year":"1992","unstructured":"Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: an approach to high-bandwidth optical WANs. IEEE Trans. Commun. 40, 1171\u20131182 (1992)","journal-title":"IEEE Trans. Commun."},{"key":"9097_CR2","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co. (1979)"},{"key":"9097_CR3","unstructured":"Kodialam, M., Lakshman, T.V.: Minimum interference routing with applications to MPLS traffic engineering. In: Proceedings of IEEE Infocom (2000)"},{"issue":"6","key":"9097_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/65.752646","volume":"12","author":"S. Chen","year":"1998","unstructured":"Chen, S., Nahrstedt, K.: An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Netw. 12(6), 64\u201379 (1998)","journal-title":"IEEE Netw."},{"issue":"4","key":"9097_CR5","first-page":"585","volume":"48","author":"S. Dharma Rao","year":"2004","unstructured":"Dharma Rao, S., Siva Ram Murthy, C.: Distributed dynamic QoS-aware routing in WDM optical networks. Elsevier Comput. Netw. 48(4), 585\u2013604 (2004)","journal-title":"Elsevier Comput. Netw."},{"key":"9097_CR6","doi-asserted-by":"crossref","unstructured":"Suri, S., Waldvogel, M., Warkhede, P.R.: Profile-based routing: a new framework for mpls traffic engineering. In: Quality of Future Internet Services, Lecture Notes in Computer Science 2156. Springer Verlag (2001)","DOI":"10.1007\/3-540-45412-8_11"},{"key":"9097_CR7","doi-asserted-by":"crossref","unstructured":"Zhemin, D., Hamdi, M., Lee, J.Y.B., Li, V.O.K.: Integrated routing and grooming in GMPLS-based optical networks. In: Proceedings of ICC (2004)","DOI":"10.1109\/ICC.2004.1312777"},{"key":"9097_CR8","unstructured":"Felsayed, K.M.: HCASP: a hop-constrained adaptive shortest-path algorithm for routing bandwidth-guaranteed tunnels in MPLS networks. In: Proceedings of the Ninth international Symposium on Computers and Communications 2004 (2004)"},{"key":"9097_CR9","unstructured":"Gong, Y., Lee, P., Yi, W.: A novel adaptive RWA algorithm in wavelength-routed network. In: Proceedings of GLOBECOM 2003, pp. 2580\u20132584 (2003)"},{"key":"9097_CR10","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1109\/JLT.2007.901344","volume":"25","author":"X.H. Guan","year":"2007","unstructured":"Guan, X.H., Zhai, S.G., Gong, W., Qiao, C.: A new method for solving routing and wavelength assignment problems in optical networks. IEEE\/OSA J. Lightwave Technol. 25, 1895\u20131909 (2007)","journal-title":"IEEE\/OSA J. Lightwave Technol."},{"issue":"4","key":"9097_CR11","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/JCN.2007.6182871","volume":"9","author":"F. Palmieri","year":"2007","unstructured":"Palmieri, F., Fiore, U., Ricciardi, S.: SPARK: a smart parametric online RWA algorithm. J. Commun. Netw. 9(4), 368\u2013376 (2007)","journal-title":"J. Commun. Netw."},{"key":"9097_CR12","doi-asserted-by":"crossref","unstructured":"Mannie, E.: Generalized multi-protocol label switching (GMPLS) architecture. IETF RFC 3945 (2004)","DOI":"10.17487\/rfc3945"},{"key":"9097_CR13","unstructured":"Kompella, K.: OSPF extensions in support of generalized MPLS. IETF RFC 4203 (2005)"},{"key":"9097_CR14","unstructured":"Koo, S., Sahin, G., Subramanian, S.: Dynamic lsp provisioning in overlay, augmented and peer architectures for IP\/MPLS over WDM networks. In: Proceedings of IEEE Infocom (2004)"},{"key":"9097_CR15","doi-asserted-by":"crossref","unstructured":"Balasubramanian, S., Somani, A.K.: On traffic grooming choices for IP over WDM networks. IEEE Broadnets (2006)","DOI":"10.1109\/BROADNETS.2006.4374410"},{"issue":"12","key":"9097_CR16","first-page":"921","volume":"18","author":"K. Kar","year":"2000","unstructured":"Kar, K., Kodialam, M., Lakshman, T.V.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE JSAC: QoS Internet 18(12), 921\u2013940 (2000)","journal-title":"IEEE JSAC: QoS Internet"},{"key":"9097_CR17","unstructured":"Kar, K., Kodialam, M., Lakshman, T.V.: Integrated dynamic IP and wavelength routing in IP over WDM networks. IEEE Infocom (2001)"},{"key":"9097_CR18","unstructured":"Wang, B., Su, X., Chen, C.P.: A new bandwidth guaranteed routing algorithm for MPLS traffic engineering. In: Proceedings of ICC, vol. 2, pp. 1001\u20131005 (2002)"},{"issue":"3","key":"9097_CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1019810526535","volume":"10","author":"R. Boutaba","year":"2002","unstructured":"Boutaba, R., Szeto, W., Iraqi, Y.: DORA: efficient routing for MPLS traffic engineering. J. Netw. Syst. Manage. 10(3), 309\u2013325 (2002)","journal-title":"J. Netw. Syst. Manage."},{"key":"9097_CR20","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. J. ACM 35(4) (1988)","DOI":"10.1145\/48014.61051"},{"key":"9097_CR21","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)"},{"key":"9097_CR22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"9097_CR23","unstructured":"Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. In: Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 165\u2013174. ACM, New York (1992)"},{"key":"9097_CR24","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"9097_CR25","doi-asserted-by":"crossref","unstructured":"Stoer, M., Wagner, F.: A simple min cut algorithm. In: Proceedings of the 1994 European Symposium on Algorithms, pp. 141\u2013147. Springer-Verlag (1994)","DOI":"10.1007\/BFb0049404"},{"key":"9097_CR26","unstructured":"Ashwood-Smith, P.: Generalized MPLS: signaling functional description. IETF RFC 3471 (2003)"},{"key":"9097_CR27","doi-asserted-by":"crossref","unstructured":"Awduche, D., Malcolm, J., Agogbua, J., O\u2019Dell, M., McManus, J.: Requirements for traffic engineering over MPLS. RFC 2702, Sep. (1999)","DOI":"10.17487\/rfc2702"},{"key":"9097_CR28","volume-title":"Data Structures and Their Algorithms","author":"H.R. Lewis","year":"1991","unstructured":"Lewis, H.R., Denenberg, L.: Data Structures and Their Algorithms. HarperCollins, New York (1991)"},{"key":"9097_CR29","unstructured":"NSFNet, http:\/\/www.nsf.gov\/about\/history\/nsf0050\/internet\/launch.htm"},{"key":"9097_CR30","unstructured":"G\u00c9ANT2 network, http:\/\/www.geant2.net\/"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-008-9097-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10922-008-9097-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-008-9097-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:55:32Z","timestamp":1559465732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10922-008-9097-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,4]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9097"],"URL":"https:\/\/doi.org\/10.1007\/s10922-008-9097-x","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,4]]}}}