{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:11:40Z","timestamp":1648991500331},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00453-012-9623-9","type":"journal-article","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T15:17:57Z","timestamp":1330528677000},"page":"51-86","source":"Crossref","is-referenced-by-count":6,"title":["Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks"],"prefix":"10.1007","volume":"66","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","published-online":{"date-parts":[[2012,3,1]]},"reference":[{"key":"9623_CR1","unstructured":"Omnet++: the discrete event simulation environment. http:\/\/www.omnetpp.org\/"},{"key":"9623_CR2","doi-asserted-by":"crossref","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 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"9623_CR3","doi-asserted-by":"crossref","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. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"9623_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Wiley, New York (2004)"},{"issue":"8","key":"9623_CR5","doi-asserted-by":"crossref","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. Commun. 42(8), 2515\u20132517 (1994)","journal-title":"IEEE Trans. Commun."},{"key":"9623_CR6","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, New York (1992)"},{"key":"9623_CR7","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":"9623_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 411, 1013\u20131037 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9623_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-642-13193-6_6","volume-title":"Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010)","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: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010). Lecture Notes in Computer Science, vol. 6049, pp. 59\u201370 (2010)"},{"issue":"9","key":"9623_CR10","doi-asserted-by":"crossref","first-page":"16","DOI":"10.4304\/jcp.2.9.16-26","volume":"2","author":"S. Cicerone","year":"2007","unstructured":"Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D., Petricola, A.: Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. J. Comput. 2(9), 16\u201326 (2007)","journal-title":"J. Comput."},{"issue":"1\u20133","key":"9623_CR11","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 297(1\u20133), 83\u2013102 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9623_CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34(2), 251\u2013281 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"9623_CR13","doi-asserted-by":"crossref","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. Netw. 1(1), 130\u2013141 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"9623_CR14","doi-asserted-by":"crossref","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. Commun. 39(6), 995\u20131002 (1991)","journal-title":"IEEE Trans. Commun."},{"key":"9623_CR15","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":"9623_CR16","series-title":"Lecture Notes in Computer Science","first-page":"200","volume-title":"Proceedings of the International Workshop on Distributed Algorithms","author":"G.F. Italiano","year":"1991","unstructured":"Italiano, G.F.: Distributed algorithms for updating shortest paths. In: Proceedings of the International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 579, pp. 200\u2013211 (1991)"},{"key":"9623_CR17","unstructured":"McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)"},{"key":"9623_CR18","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)"},{"issue":"6","key":"9623_CR19","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/90.893870","volume":"8","author":"P. Narv\u00e1ez","year":"2000","unstructured":"Narv\u00e1ez, P., Siu, K.-Y., Tzeng, H.-Y., New dynamic algorithms for shortest path tree computation. IEEE\/ACM Trans. Netw. 8(6), 734\u2013746 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9623_CR20","doi-asserted-by":"crossref","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. Distrib. Comput. 10, 49\u201362 (1996)","journal-title":"Distrib. Comput."},{"key":"9623_CR21","doi-asserted-by":"crossref","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. J. Algorithms 13, 235\u2013257 (1992)","journal-title":"J. Algorithms"},{"issue":"1","key":"9623_CR22","doi-asserted-by":"crossref","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. Netw. 18(1), 307\u2013319 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9623_CR23","first-page":"11","volume":"4","author":"E.C. Rosen","year":"1980","unstructured":"Rosen, E.C.: The updating protocol of arpanet\u2019s new routing algorithm. Comput. Netw. 4, 11\u201319 (1980)","journal-title":"Comput. Netw."},{"issue":"10","key":"9623_CR24","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1109\/TC.2003.1234527","volume":"52","author":"J. Wu","year":"2003","unstructured":"Wu, J., Dai, F., Lin, X., Cao, J., Jia, W.: An extended fault-tolerant link-state routing protocol in the internet. IEEE Trans. Comput. 52(10), 1298\u20131311 (2003)","journal-title":"IEEE Trans. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9623-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9623-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9623-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:09Z","timestamp":1559123109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9623-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9623"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9623-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,1]]}}}