{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:41Z","timestamp":1742914301646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242954"},{"type":"electronic","value":"9783030242961"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24296-1_8","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T21:06:36Z","timestamp":1561755996000},"page":"72-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study"],"prefix":"10.1007","author":[{"given":"Mattia","family":"D\u2019Emidio","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"8_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 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378\u2013381 (2000)","journal-title":"Nature"},{"key":"8_CR3","unstructured":"Bu, T., Towsley, D.: On distinguishing between internet power law topology generators. In: Proceedings IEEE INFOCOM, pp. 638\u2013647 (2002)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-012-9623-9","volume":"66","author":"S Cicerone","year":"2013","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 66(1), 51\u201386 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/net.21542","volume":"63","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Fully dynamic update of arc-flags. Networks 63(3), 243\u2013259 (2014)","journal-title":"Networks"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.11.001","volume":"516","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516, 1\u201319 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-44543-4_9","volume-title":"Combinatorial Algorithms","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Distance queries in large-scale fully dynamic complex networks. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 109\u2013121. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-44543-4_9"},{"issue":"1","key":"8_CR8","first-page":"1.6:1","volume":"24","author":"G D\u2019Angelo","year":"2019","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Fully dynamic 2-hop cover labeling. J. Exp. Algorithmics 24(1), 1.6:1\u20131.6:36 (2019)","journal-title":"J. Exp. Algorithmics"},{"key":"8_CR9","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. LNCS, vol. 6783, pp. 578\u2013593. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21887-3_44"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00224-015-9608-6","volume":"57","author":"G D\u2019Angelo","year":"2015","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Romano, D.: Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios. Theory Comput.Syst. 57(2), 444\u2013477 (2015)","journal-title":"Theory Comput.Syst."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Elkin, M.: Distributed exact shortest paths in sublinear time. In: Proceedings of 49th Annual Symposium on Theory of Computing (STOC 2017), pp. 757\u2013770. ACM (2017)","DOI":"10.1145\/3055399.3055452"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/90.222913","volume":"1","author":"JJ 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":"8_CR13","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/26.87189","volume":"39","author":"PA 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":"8_CR14","unstructured":"Hyun, Y., et al.: The CAIDA IPv4 routed\/24 topology dataset. \n                      http:\/\/www.caida.org\/data\/active\/ipv4_routed_24_topology_dataset.xml"},{"key":"8_CR15","volume-title":"OSPF: Anatomy of an Internet Routing Protocol","author":"JT Moy","year":"1998","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Boston (1998)"},{"key":"8_CR16","unstructured":"OMNeT++. Discrete event simulation environment. \n                      http:\/\/www.omnetpp.org"},{"key":"8_CR17","first-page":"11","volume":"4","author":"EC 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":"1","key":"8_CR18","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., Sofia, R.: Always acyclic distributed path computation. IEEE\/ACM Trans. Netw. 18(1), 307\u2013319 (2010)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24296-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T22:16:45Z","timestamp":1561760205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24296-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242954","9783030242961"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24296-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}