{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:33:10Z","timestamp":1762781590484},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_6","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"59-70","source":"Crossref","is-referenced-by-count":6,"title":["A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation"],"prefix":"10.1007","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[]},{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[]},{"given":"Vinicio","family":"Maurizio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Omnet++: the discrete event simulation environment, http:\/\/www.omnetpp.org\/"},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons, Chichester (2004)"},{"issue":"8","key":"6_CR3","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 Transactions on Communications\u00a042(8), 2515\u20132517 (1994)","journal-title":"IEEE Transactions on Communications"},{"key":"6_CR4","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International, Englewood Cliffs (1992)"},{"key":"6_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"6_CR6","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.tcs.2009.11.008"},{"key":"6_CR7","doi-asserted-by":"crossref","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. Technical Report R.10.111, Department of Electrical and Information Engineering, University of L\u2019Aquila (2010)","DOI":"10.1007\/978-3-642-13193-6_6"},{"issue":"1-3","key":"6_CR8","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., Stefano, G.D., Frigioni, D., Nanni, U.: A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science\u00a0297(1-3), 83\u2013102 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_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 Transactions on Networking\u00a01(1), 130\u2013141 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"6_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 Transactions on Communications\u00a039(6), 995\u20131002 (1991)","journal-title":"IEEE Transactions on Communications"},{"key":"6_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":"6_CR12","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":"6_CR13","unstructured":"McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)"},{"key":"6_CR14","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":"6_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. Distributed Computing\u00a010, 49\u201362 (1996)","journal-title":"Distributed Computing"},{"key":"6_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"},{"key":"6_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:32:23Z","timestamp":1559071943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}