{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T08:40:55Z","timestamp":1762764055062,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218866"},{"type":"electronic","value":"9783642218873"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21887-3_44","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T13:51:08Z","timestamp":1308318668000},"page":"578-593","source":"Crossref","is-referenced-by-count":6,"title":["A Speed-Up Technique for Distributed Shortest Paths Computation"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[]},{"given":"Mattia","family":"D\u2019Emidio","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[]},{"given":"Vinicio","family":"Maurizio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","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":"44_CR2","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, 130\u2013141 (1993)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BFb0022448","volume-title":"Distributed Algorithms","author":"G.F. Italiano","year":"1992","unstructured":"Italiano, G.F.: Distributed algorithms for updating shortest paths. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol.\u00a0579, pp. 200\u2013211. Springer, Heidelberg (1992)"},{"key":"44_CR4","unstructured":"McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)"},{"key":"44_CR5","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International, Englewood Cliffs (1992)"},{"key":"44_CR6","volume-title":"OSPF: Anatomy of an Internet routing protocol","author":"J.T. Moy","year":"1998","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley, Reading (1998)"},{"key":"44_CR7","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"},{"key":"44_CR8","volume-title":"ACM SIGCOMM HotNets","author":"A. Myers","year":"2004","unstructured":"Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: ACM SIGCOMM HotNets. ACM Press, New York (2004)"},{"issue":"1","key":"44_CR9","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":"44_CR10","first-page":"1","volume-title":"5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom 2009)","author":"C. Zhao","year":"2009","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, Los Alamitos (2009)"},{"key":"44_CR11","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)"},{"key":"44_CR12","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: Engineering a new algorithm for distributed shortest paths on dynamic networks (submitted for publication), \nhttp:\/\/informatica.ing.univaq.it\/misc\/DUST\/\n, Prel. version in [11]"},{"key":"44_CR13","unstructured":"D\u2019Angelo, G., Frigioni, D., Maurizio, V.: An experimental study of distributed algorithms for shortest paths on real networks. In: 12th Italian Conference on Theoretical Computer Science, ICTCS (2010)"},{"key":"44_CR14","unstructured":"Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed\/24 topology dataset, \nhttp:\/\/www.caida.org\/data\/active\/ipv4_routed_24_topology_dataset.xml"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex network. Reviews of Modern Physics\u00a074, 47\u201397 (2002)","journal-title":"Reviews of Modern Physics"},{"key":"44_CR16","unstructured":"OMNeT++: The discrete event simulation environment, \nhttp:\/\/www.omnetpp.org\/"},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"R. Albert","year":"1999","unstructured":"Albert, R., Barab\u00e1si, A.L.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21887-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T08:37:42Z","timestamp":1762763862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-21887-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218866","9783642218873"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21887-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}