{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:10:26Z","timestamp":1725707426746},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_11","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T04:00:11Z","timestamp":1353902411000},"page":"148-158","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks"],"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":"Daniele","family":"Romano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","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"},{"key":"11_CR2","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International (1992)"},{"key":"11_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":"11_CR4","doi-asserted-by":"crossref","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, 2012), doi: 10.1007\/s00453-012-9623-9","DOI":"10.1007\/s00453-012-9623-9"},{"issue":"1-3","key":"11_CR5","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 Comp. Science\u00a0297(1-3), 83\u2013102 (2003)","journal-title":"Theoretical Comp. Science"},{"key":"11_CR6","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":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-30850-5_12","volume-title":"Experimental Algorithms","author":"G. D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Maurizio, V.: Engineering a New Loop-Free Shortest Paths Routing Algorithm. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 123\u2013134. Springer, Heidelberg (2012)"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"11_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"},{"key":"11_CR10","unstructured":"Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed\/24 topology dataset, \n                  \n                    http:\/\/www.caida.org\/data\/active\/ipv4_routed_24_topology_dataset.xml"},{"key":"11_CR11","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley (1998)"},{"key":"11_CR12","unstructured":"Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: ACM SIGCOMM HotNets. ACM Press (2004)"},{"key":"11_CR13","unstructured":"OMNeT++. Discrete event simulation environment, \n                  \n                    http:\/\/www.omnetpp.org"},{"issue":"1","key":"11_CR14","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":"11_CR15","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":"11_CR16","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","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:06:44Z","timestamp":1620119204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}