{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:52:49Z","timestamp":1725537169235},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642045752"},{"type":"electronic","value":"9783642045769"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04576-9_9","type":"book-chapter","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T22:09:28Z","timestamp":1251929368000},"page":"130-140","source":"Crossref","is-referenced-by-count":1,"title":["Local Restoration for Trees and Arborescences"],"prefix":"10.1007","author":[{"given":"Paola","family":"Iovanna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Oriolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ezio","family":"Sperduto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/S0895480100368189","volume":"14","author":"G. Brightwell","year":"2001","unstructured":"Brightwell, G., Oriolo, G., Sheperd, F.B.: Reserving Resilient Capacity in a Network. Siam Journal on Discrete Mathematics\u00a014(4), 524\u2013539 (2001)","journal-title":"Siam Journal on Discrete Mathematics"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Widmayer, P.: Computing all the best swap edges distributively. Journal of Parallel and Distributed Computing\u00a068(7) (2008)","DOI":"10.1016\/j.jpdc.2008.03.002"},{"key":"9_CR3","first-page":"617","volume-title":"Handbook in OR and MS","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Handbook in OR and MS, vol.\u00a07, pp. 617\u2013672. Elsevier, Amsterdam (1995)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Kolarov, A., Sengupta, B., Iwata, A.: Design of Multiple Reverse Spanning Trees in Next Generation of Ethernet-VPNs. In: IEEE GLOBECOM 2004, vol.\u00a03, pp. 1390\u20131395 (2004)","DOI":"10.1109\/GLOCOM.2004.1378212"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica\u00a035, 56\u201374 (2003)","journal-title":"Algorithmica"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Padmaraj, M., Nair, S., Marchetti, M., Chiruvolu, G., Ali, M.: Traffic Engineering in Enterprise Ethernet with Multiple Spanning Tree Regions. In: Proc. of System Communications (ICW 2005), Montreal, Canada, pp. 261\u2013266 (2005)","DOI":"10.1109\/ICW.2005.78"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Sharma, S., Gopalan, K., Nanda, S., Chiueh, T.: Viking: A Multi-Spanning-Tree Ethernet Architecture for Metropolitan Area and Cluster Networks. In: IEEE INFOCOM 2004, vol.\u00a04, pp. 2283\u20132294 (2004)","DOI":"10.1109\/INFCOM.2004.1354651"},{"key":"9_CR8","unstructured":"de Sousa, A.F., Soares, G.: Improving Load Balance and Minimizing Service Disruption on Ethernet Networks using IEEE 802.1S MSTP. In: Proc. EuroFGI Workshop on IP QoS and Traffic Control, Lisbon, Portugal, vol.\u00a01, pp. 25\u201335 (2007)"},{"key":"9_CR9","unstructured":"Sperduto, E.: Combinatorial structures in communication networks, Ph. D. thesis in Computer Science and Automation, Universit\u00e0 Roma Tre (2008)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR11","unstructured":"Standard IEEE 802.1D"},{"key":"9_CR12","unstructured":"Standard IEEE 802.1s"},{"key":"9_CR13","unstructured":"Standard IEEE 802.1w"}],"container-title":["Lecture Notes in Computer Science","Traffic Management and Traffic Engineering for the Future Internet"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04576-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T12:30:18Z","timestamp":1552134618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04576-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642045752","9783642045769"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04576-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}