{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:07:57Z","timestamp":1747714077158,"version":"3.40.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,19]],"date-time":"2015-02-19T00:00:00Z","timestamp":1424304000000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00224-015-9608-6","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T06:04:16Z","timestamp":1424239456000},"page":"444-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios"],"prefix":"10.1007","volume":"57","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","published-online":{"date-parts":[[2015,2,19]]},"reference":[{"key":"9608_CR1","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":"9608_CR2","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":"9608_CR3","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":"9608_CR4","volume-title":"Data Networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International, Upper Saddle River (1992)"},{"key":"9608_CR5","unstructured":"Bu, T., Towsleym, D.: On distinguishing between internet power law topology generators. In: Proceedings 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM2002) IEEE , pp 37\u201348 (2002)"},{"key":"9608_CR6","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."},{"issue":"1","key":"9608_CR7","doi-asserted-by":"crossref","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":"1-3","key":"9608_CR8","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-3), 83\u2013102 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9608_CR9","first-page":"253","volume":"37","author":"G D\u2019Angelo","year":"2013","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Pruning the computation of distributed shortest paths in power-law networks. Informatica 37(3), 253\u2013265 (2013)","journal-title":"Informatica"},{"key":"9608_CR10","doi-asserted-by":"crossref","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":"9608_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Romano, D.: Enhancing the computation of distributed shortest paths on real dynamic networks. In: Proceedings 1st Mediterranean Conference on Algorithms (MEDALG2012), volume 7659 of Lecture Notes in Computer Science, pp 148\u2013158 (2012)","DOI":"10.1007\/978-3-642-34862-4_11"},{"key":"9608_CR12","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 25th IEEE Conference on Computer Communications (INFOCOM2006), pp 1\u201313 (2006)","DOI":"10.1109\/INFOCOM.2006.229"},{"issue":"2","key":"9608_CR13","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. Algorithm. 34(2), 251\u2013281 (2000)","journal-title":"J. Algorithm."},{"issue":"1","key":"9608_CR14","doi-asserted-by":"crossref","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":"9608_CR15","doi-asserted-by":"crossref","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":"9608_CR16","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":"9608_CR17","doi-asserted-by":"crossref","unstructured":"Italiano, G.F.: Distributed algorithms for updating shortest paths. In: International Workshop on Distributed Algorithms, volume 579 of Lecture Notes in Computer Science, pp 200\u2013211 (1991)","DOI":"10.1007\/BFb0022448"},{"key":"9608_CR18","volume-title":"Adaptive Routing Algorithms for Distributed Computer Networks. Technical Report BBN Report 2831","author":"J McQuillan","year":"1974","unstructured":"McQuillan, J.: Adaptive Routing Algorithms for Distributed Computer Networks. Technical Report BBN Report 2831. Cambridge, MA (1974)"},{"key":"9608_CR19","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, Reading (1998)"},{"key":"9608_CR20","unstructured":"Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: Proceedings 3rd Workshop on Hot Topics in Networks (ACM HotNets). ACM Press (2004)"},{"issue":"6","key":"9608_CR21","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":"9608_CR22","unstructured":"OMNeT ++: Discrete event simulation environment. http:\/\/www.omnetpp.org ."},{"key":"9608_CR23","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":"9608_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9780470779422","volume-title":"Networking Fundamentals: Wide, Local and Personal Area Communications","author":"K Pahlavan","year":"2009","unstructured":"Pahlavan, K., Krishnamurthy, P.: Networking Fundamentals: Wide, Local and Personal Area Communications. Wiley, New York (2009)"},{"key":"9608_CR25","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0196-6774(92)90017-7","volume":"13","author":"KVS Ramarao","year":"1992","unstructured":"Ramarao, K.V.S., Venkatesan, S.: On finding and updating shortest paths distributively. J. Algorithm. 13, 235\u2013257 (1992)","journal-title":"J. Algorithm."},{"issue":"1","key":"9608_CR26","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":"9608_CR27","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":"10","key":"9608_CR28","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. Comp. 52(10), 1298\u20131311 (2003)","journal-title":"IEEE Trans. Comp."},{"key":"9608_CR29","doi-asserted-by":"crossref","unstructured":"Yao, N., Gao, E., Qin, Y., Zhang, H.: Rd: Reducing message overhead in DUAL. In: Proceedings 1st International Conference on Network Infrastructure and Digital Content (IC-NIDC2009), IEEE Press, pp 270\u2013274 (2009)","DOI":"10.1109\/ICNIDC.2009.5360975"},{"key":"9608_CR30","doi-asserted-by":"crossref","unstructured":"Zhao, C., Liu, Y., Liu, K.: A more efficient diffusing update algorithm for loop-free routing. In: Proceedings 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom2009), IEEE Press, pp 1\u20134 (2009)","DOI":"10.1109\/WICOM.2009.5302468"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9608-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9608-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9608-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T16:42:24Z","timestamp":1747672944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9608-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,19]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9608"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9608-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2015,2,19]]}}}