{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:35:00Z","timestamp":1756636500859,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_12","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T01:44:33Z","timestamp":1338169473000},"page":"123-134","source":"Crossref","is-referenced-by-count":4,"title":["Engineering a New Loop-Free Shortest Paths Routing Algorithm"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mattia","family":"D\u2019Emidio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinicio","family":"Maurizio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"12_CR1","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1109\/26.310604","volume":"42","author":"B. Awerbuch","year":"1994","unstructured":"Awerbuch, B., Bar-Noy, A., Gopal, M.: Approximate distributed bellman-ford algorithms. IEEE Trans. on Communications\u00a042(8), 2515\u20132517 (1994)","journal-title":"IEEE Trans. on Communications"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.tcs.2009.11.008","volume":"411","author":"S. Cicerone","year":"2010","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theoretical Computer Science\u00a0411, 1013\u20131037 (2010)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica To appear Prel. version in [5]"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-13193-6_6","volume-title":"Experimental Algorithms","author":"S. Cicerone","year":"2010","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 59\u201370. Springer, Heidelberg (2010)"},{"issue":"1-3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(02)00619-9","volume":"297","author":"S. Cicerone","year":"2003","unstructured":"Cicerone, S., Di Stefano, G., Frigioni, D., Nanni, U.: A fully dynamic algorithm for distributed shortest paths. Theoretical Comp. Science\u00a0297(1-3), 83\u2013102 (2003)","journal-title":"Theoretical Comp. Science"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-21887-3_44","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Maurizio, V.: A Speed-Up Technique for Distributed Shortest Paths Computation. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part II. LNCS, vol.\u00a06783, pp. 578\u2013593. Springer, Heidelberg (2011)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Elmeleegy, K., Cox, A.L., Ng, T.S.E.: On count-to-infinity induced forwarding loops in ethernet networks. In: Proceedings IEEE INFOCOM, pp. 1\u201313 (2006)","DOI":"10.1109\/INFOCOM.2006.229"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/90.222913","volume":"1","author":"J.J. Garcia-Lunes-Aceves","year":"1993","unstructured":"Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE\/ACM Trans. on Networking\u00a01(1), 130\u2013141 (1993)","journal-title":"IEEE\/ACM Trans. on Networking"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/26.87189","volume":"39","author":"P.A. Humblet","year":"1991","unstructured":"Humblet, P.A.: Another adaptive distributed shortest path algorithm. IEEE Trans. on Communications\u00a039(6), 995\u20131002 (1991)","journal-title":"IEEE Trans. on Communications"},{"key":"12_CR11","unstructured":"Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed\/24 topology dataset, http:\/\/www.caida.org\/data\/active\/ipv4_routed_24_topology_dataset.xml"},{"key":"12_CR12","unstructured":"McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)"},{"key":"12_CR13","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley (1998)"},{"key":"12_CR14","unstructured":"OMNeT++. Discrete event simulation environment, http:\/\/www.omnetpp.org ."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s004460050023","volume":"10","author":"A. Orda","year":"1996","unstructured":"Orda, A., Rom, R.: Distributed shortest-path and minimum-delay protocols in networks with time-dependent edge-length. Distr. Computing\u00a010, 49\u201362 (1996)","journal-title":"Distr. Computing"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0196-6774(92)90017-7","volume":"13","author":"K.V.S. Ramarao","year":"1992","unstructured":"Ramarao, K.V.S., Venkatesan, S.: On finding and updating shortest paths distributively. Journal of Algorithms\u00a013, 235\u2013257 (1992)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TNET.2009.2025374","volume":"18","author":"S. Ray","year":"2010","unstructured":"Ray, S., Gu\u00e9rin, R., Kwong, K.-W., Sofia, R.: Always acyclic distributed path computation. IEEE\/ACM Trans. on Networking\u00a018(1), 307\u2013319 (2010)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"12_CR18","first-page":"11","volume":"4","author":"E.C. Rosen","year":"1980","unstructured":"Rosen, E.C.: The updating protocol of arpanet\u2019s new routing algorithm. Computer Networks\u00a04, 11\u201319 (1980)","journal-title":"Computer Networks"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Yao, N., Gao, E., Qin, Y., Zhang, H.: Rd: Reducing message overhead in DUAL. In: Proceedings 1st International Conference on Network Infrastructure and Digital Content (IC-NIDC 2009), pp. 270\u2013274. IEEE Press (2009)","DOI":"10.1109\/ICNIDC.2009.5360975"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, C., Liu, Y., Liu, K.: A more efficient diffusing update algorithm for loop-free routing. In: 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom 2009), pp. 1\u20134. IEEE Press (2009)","DOI":"10.1109\/WICOM.2009.5302468"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:43:46Z","timestamp":1743201826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}