{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:44:51Z","timestamp":1725479091809},"publisher-location":"Boston, MA","reference-count":7,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387348254"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34827-8_17","type":"book-chapter","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T12:29:09Z","timestamp":1169728149000},"page":"213-222","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for network service guarantee under minimal link usage information"],"prefix":"10.1007","author":[{"given":"Sugwon","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwang-Kyu","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seonuck","family":"Paek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"V. Sharma et al, \u201c Framework for Multi-protocol Label Switching(MPLS)-based Recovery,\u201d RFC 3469, February 2003","DOI":"10.17487\/rfc3469"},{"key":"17_CR2","unstructured":"R. Bhandari, \u201cSurvivable Networks: Algorithms for Diverse Routing,\u201d Kluwer Academic Publishers, 1999"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Kodialam and T.V. Lakshman, \u201cDynamic Routing of Bandwidth Guaranteed Tunnels with Restoration,\u201d INFOCOM 2000","DOI":"10.1109\/INFCOM.2000.832265"},{"issue":"12","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1109\/49.898737","volume":"16","author":"K. Kar","year":"2000","unstructured":"K. Kar, M. Kodialam, and T. V. Laskshman, \u201cMinimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications,\u201d IEEE, J. of Selected Area of Com. Vol. 16(12), pp2566\u20132579, December 2000","journal-title":"IEEE, J. of Selected Area of Com."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"K. Murakami, \u201cOptical Capacity and Flow Assignment for Self-Healing ATM Networks Based on Line and End-to-End Restoration,\u201d IEEE\/ACM Trans. On Networking 6(2), April 1998","DOI":"10.1109\/90.664269"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"J.W. Suurballe R.E. Tarjan \u201cA Quick Method for Finding Shortest Pairs of Disjoint Paths,\u201d Networks, vol. 14, pp325\u2013226, 1984","journal-title":"Networks"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"C.-L. Li","year":"1992","unstructured":"C.-L. Li, S. T. McCormick, and D. Simchi-Levi, \u201cFinding Disjoint Paths with Different Path-Costs: Complexity and Algorithms,\u201d NETWORKS, vol. 22, pp653\u2013667, 1992","journal-title":"NETWORKS"}],"container-title":["IFIP International Federation for Information Processing","Network Control and Engineering for Qos, Security and Mobility, V"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34827-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:51:17Z","timestamp":1619560277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34827-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387348254"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34827-8_17","relation":{},"subject":[]}}