{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T06:03:33Z","timestamp":1743573813985},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219590"},{"type":"electronic","value":"9783540246930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24693-0_84","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:02:45Z","timestamp":1284170565000},"page":"1024-1035","source":"Crossref","is-referenced-by-count":12,"title":["A New Method of Primary Routes Selection for Local Restoration"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Walkowiak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"84_CR1","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/35.526896","volume":"7","author":"E Ayanoglu","year":"1996","unstructured":"Ayanoglu, E., Gitlin, R.: Broadband Network Restoration. IEEE Comm. Magazine, 7 (1996)110\u2013119","journal-title":"IEEE Comm. Magazine"},{"key":"84_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0166-5316(02)00177-3","volume":"52","author":"J Burns","year":"2003","unstructured":"Burns, J., Ott, T., Krzesinski, A., Muller, K.,: Path selection and bandwidth allocation in MPLS networks. Performance Evaluation, 52 (2003) 133\u2013152.","journal-title":"Performance Evaluation"},{"key":"84_CR3","first-page":"88","volume":"1","author":"A Dunn","year":"1994","unstructured":"Dunn, A., Grover, W., MacGregor, M.: Comparison of k-Shortest Paths and Maximum Flow Routing for Network Facility Restoration. IEEE JSAC, 1 (1994) 88\u201399","journal-title":"IEEE JSAC"},{"key":"84_CR4","first-page":"97","volume-title":"The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design","author":"L Fratta","year":"1973","unstructured":"Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks (1973) 97\u2013133"},{"key":"84_CR5","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/3-540-44864-0_82","volume":"2660","author":"A Kasprzak","year":"2003","unstructured":"Kasprzak, A.: Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows. Lectures Notes In Computer Science, LNCS 2660, (2003) 799\u2013808","journal-title":"Lectures Notes In Computer Science, LNCS"},{"key":"84_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/90.503759","volume":"2","author":"K Murakami","year":"1996","unstructured":"Murakami, K., Kim, H.: Virtual Path Routing for Survivable ATM Networks. IEEE\/ACM Transactions on Networking, 2 (1996) 22\u201339","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"84_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/mnsc.46.1.126.15132","volume":"1","author":"A Ouorou","year":"2000","unstructured":"Ouorou, A., Mahey, P., Vial, J.-Ph.: A survey of algorithms for convex multicommodity flow problems. Management Science, 1 (2000) 126\u2013147","journal-title":"Management Science"},{"volume-title":"Framework for MPLS-based Recovery","year":"2003","key":"84_CR8","unstructured":"Sharma, V., Hellstrand, F. (ed.): Framework for MPLS-based Recovery. RFC 3469 (2003)"},{"key":"84_CR9","series-title":"Lectures Notes In Computer Science","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/3-540-44860-8_52","volume-title":"A New Approach to Survivability of Connection Oriented Networks","author":"K Walkowiak","year":"2003","unstructured":"Walkowiak, K.: A New Approach to Survivability of Connection Oriented Networks. Lectures Notes In Computer Science, LNCS 2657, (2003) 501\u2013510"},{"key":"84_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/B:COAP.0000008650.91314.59","volume":"2","author":"K Walkowiak","year":"2004","unstructured":"Walkowiak, K.: A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications 2 (2004) 149\u2013171","journal-title":"Computational Optimization and Applications"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24693-0_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:04:15Z","timestamp":1620011055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24693-0_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219590","9783540246930"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24693-0_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}