{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:33:38Z","timestamp":1725532418459},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013980"},{"type":"electronic","value":"9783642013997"}],"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-01399-7_13","type":"book-chapter","created":{"date-parts":[[2009,5,6]],"date-time":"2009-05-06T01:18:41Z","timestamp":1241572721000},"page":"157-168","source":"Crossref","is-referenced-by-count":3,"title":["IP Fast ReRoute: Lightweight Not-Via"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Enyedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Szil\u00e1gyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Cs\u00e1sz\u00e1r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Shand, M., Bryant, S.: IP Fast Reroute framework. Internet Draft (February 2008), http:\/\/tools.ietf.org\/html\/draft-ietf-rtgwg-ipfrr-framework-08"},{"key":"13_CR2","unstructured":"Bryant, S., Shand, M., Previdi, S.: IP fast reroute using Not-via addresses. Internet Draft (February 2008), http:\/\/www.ietf.org\/internet-drafts\/draft-ietf-rtgwg-ipfrr-notvia-addresses-00.txt"},{"key":"#cr-split#-13_CR3.1","unstructured":"Szil\u00e1gyi, P., T\u00f3th, Z.: Design, implementation and evaluation of an IP Fast ReRoute prototype. Technical report, BME (2008);"},{"key":"#cr-split#-13_CR3.2","unstructured":"First prize at Scientific Student Conference (2008), http:\/\/opti.tmit.bme.hu\/~enyedi\/ipfrr\/"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cicic, T., Hansen, A.F., Apeland, O.K.: Redundant trees for fast IP recovery. In: Broadnets, pp. 152\u2013159 (2007)","DOI":"10.1109\/BROADNETS.2007.4550419"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Li, A., Fran\u00e7ois, P., Yang, X.: On improving the efficiency and manageability of NotVia. In: Proc. of ACM CoNEXT, pp. 1\u201312 (2007)","DOI":"10.1145\/1364654.1364688"},{"issue":"5","key":"13_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/90.803380","volume":"7","author":"M. M\u00e9dard","year":"1999","unstructured":"M\u00e9dard, M., Barry, R.A., Finn, S.G., Galler, R.G.: Redundant trees for preplanned recovery in arbitary vertex-redundant or edge-redundant graphs. IEEE\/ACM Transactions on Networking\u00a07(5), 641\u2013652 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Enyedi, G., R\u00e9tv\u00e1ri, G., Cs\u00e1sz\u00e1r, A.: On finding maximally redundant trees in strictly linear time. In: IEEE ICC (2008) (submitted), http:\/\/opti.tmit.bme.hu\/~enyedi\/ipfrr\/","DOI":"10.1109\/ISCC.2009.5202302"},{"key":"13_CR8","unstructured":"Zhang, W., Xue, G., Tang, J., Thulasiraman, K.: Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. In: INFOCOM 2005 (March 2005)"},{"key":"13_CR9","unstructured":"Enyedi, G., R\u00e9tv\u00e1ri, G.: Finding redundant trees in linear time. IEEE Communications Letters (2008) (submitted), http:\/\/opti.tmit.bme.hu\/~enyedi\/ipfrr\/"},{"key":"13_CR10","unstructured":"GNU Quagga routing software, http:\/\/www.quagga.net"},{"key":"13_CR11","unstructured":"Katz, D., Ward, D.: Bidirectional forwarding detection. Internet Draft (2008), http:\/\/tools.ietf.org\/html\/draft-ietf-bfd-base-08"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Shaikh, A., Greenberg, A.: Experience in black-box OSPF measurement. In: IMW 2001: Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, pp. 113\u2013125 (2001)","DOI":"10.1145\/505202.505218"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01399-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:52:58Z","timestamp":1558288378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01399-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013980","9783642013997"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01399-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}