{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T08:28:01Z","timestamp":1722414481452},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1587\/transcom.2021cep0003","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T22:07:46Z","timestamp":1628114866000},"page":"196-204","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Calculation for TI-LFA Rerouting Path"],"prefix":"10.23919","volume":"E105.B","author":[{"given":"Kazuya","family":"SUZUKI","sequence":"first","affiliation":[{"name":"Faculty of Systems Science and Technology, Akita Prefectural University"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] K. Suzuki, \u201cAn efficient algorithm for TI-LFA rerouting path calculation,\u201d Proc. 2020 International Conference on Emerging Technologies for Communications (ICETC2020), D1-4, 2020."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Kvalbein, A.F. Hansen, T. Cicic, S. Gjessing, and O. Lysne, \u201cFast IP network recovery using multiple routing configurations,\u201d Proc. IEEE INFOCOM 2006, pp.1-11, 2006. 10.1109\/infocom.2006.227","DOI":"10.1109\/INFOCOM.2006.227"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Nelakuditi, S. Lee, Y. Yu, Z. hang, and C. Chuah, \u201cFast local rerouting for handling transient link failures,\u201d IEEE\/ACM Trans. Netw., vol.15, no.2, pp.359-372, 2007. 10.1109\/tnet.2007.892851","DOI":"10.1109\/TNET.2007.892851"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Atlas and A. Zinin, \u201cBasic specification for IP fast reroute: Loop-free alternates,\u201d RFC5286, IETF, 2008. 10.17487\/rfc5286","DOI":"10.17487\/rfc5286"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Bryant, C. Filsfils, S. Previdi, M. Shand, and N. So, \u201cRemote loop-free alternate (LFA) fast reroute (FRR),\u201d RFC7490, IETF, 2015. 10.17487\/rfc7490","DOI":"10.17487\/RFC7490"},{"key":"6","unstructured":"[6] A. Bashandy, C. Filsfils, B. Decraene, S. Litkowski, P. Francois, D. Voyer, F. Clad, and P. Camarillo, \u201cTopology independent fast reroute using segment routing,\u201d https:\/\/tools.ietf.org\/html\/draft-francois-segment-routing-ti-lfa-05"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] K. Suzuki, M. Jibiki, and K. Yoshida, \u201cSelective precomputation of alternate routes using link-state information for IP fast restoration,\u201d IEICE Trans. Commun., vol.E93-B, no.5, pp.1085-1094, May 2010. 10.1587\/transcom.e93.b.1085","DOI":"10.1587\/transcom.E93.B.1085"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] K. Suzuki, M. Jibiki, and K. Yoshida, \u201cComparison of proactive and reactive methods for IP fast restoration using localization algorithm,\u201d Proc. 4th International Conference on Signal Processing and Communication Systems (ICSPCS), IEEE, 2010. 10.1109\/icspcs.2010.5709691","DOI":"10.1109\/ICSPCS.2010.5709691"},{"key":"9","unstructured":"[9] C. Filsfils, S. Previdi, L. Ginsberg, B. Decraene, S. Litkowski, and R. Shakir, \u201cSegment routing architecture,\u201d RFC8402, IETF, 2018. 10.17487\/rfc8402"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Moy, \u201cOSPF version 2,\u201d RFC2328, IETF, 1997. 10.17487\/rfc2178","DOI":"10.17487\/rfc2178"},{"key":"11","unstructured":"[11] C. Filsfils, D. Dukes, S. Previdi, J. Leddy, S. Matsushima, and D. Voyer, \u201cIPv6 segment routing header (SRH),\u201d RFC8754, IETF, 2020. 10.17487\/rfc8754"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] A. Medina, A. Lakhina, I. Matta, and J. Byers, \u201cBRITE: An approach to universal topology generation,\u201d Proc. Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), pp.346-353, 2001. 10.1109\/mascot.2001.948886","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B.M. Waxman, \u201cRouting of multipoint connections,\u201d IEEE J. Sel. Area Commun., vol.6, no.9, pp.1617-1622, 1988. 10.1109\/49.12889","DOI":"10.1109\/49.12889"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A.L. Barabasi and R. Albert, \u201cEmergence of scaling in random networks,\u201d Science, vol.286, no.5439, pp.509-512, 1999. 10.1126\/science.286.5439.509","DOI":"10.1126\/science.286.5439.509"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] S. Knight, H.X. Nguyen, N. Falkner, R. Bowden, and M. Roughan, \u201cThe internet topology zoo,\u201d IEEE J. Sel. Areas Commun., vol.29, no.9, pp.1765-1775, 2011. 10.1109\/jsac.2011.111002","DOI":"10.1109\/JSAC.2011.111002"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/2\/E105.B_2021CEP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:10Z","timestamp":1704898750000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/2\/E105.B_2021CEP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2021cep0003","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"article-number":"2021CEP0003"}}