skip to main content
research-article

Input-Dynamic Distributed Algorithms for Communication Networks

Published:22 February 2021Publication History
Skip Abstract Section

Abstract

Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.

References

  1. Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-linear lower bounds for distributed distance computations, even in sparse networks. In Proc. 30th International Symposium on Distributed Computing (DISC 2016). Springer, 29--42. https://doi.org/10.1007/978--3--662--53426--7_3Google ScholarGoogle ScholarCross RefCross Ref
  2. Amir Abboud and Virginia Vassilevska Williams. 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 434--443. https://doi.org/10. 1109/FOCS.2014.53Google ScholarGoogle Scholar
  3. Umut A. Acar, Vitaly Aksenov, and Sam Westrick. 2017. Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. In Proc. 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017). Association for Computing Machinery, New York, NY, USA, 275--277. https://doi.org/10.1145/3087556.3087595Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Umut A. Acar, Daniel Anderson, Guy E. Blelloch, and Laxman Dhulipala. 2019. Parallel Batch-Dynamic Graph Connectivity. In Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019). 381--392. https://doi.org/10.1145/3323165.3323196Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Umut A Acar, Andrew Cotter, Benoit Hudson, and Duru Türkoglu. 2011. Parallelism in dynamic well-spaced point sets. In Proc. 23rd annual ACM symposium on Parallelism in algorithms and architectures (SPAA 2011). 33--42. https: //doi.org/10.1145/1989493.1989498Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and NicoleWein. 2019. Algorithms and Hardness for Diameter in Dynamic Graphs. In 46th International Colloquium on Automata, Languages, and Programming, ICALP. 13:1--13:14. https://doi.org/10.4230/LIPIcs.ICALP.2019.13Google ScholarGoogle Scholar
  7. Sepehr Assadi, Krzysztof Onak, Baruch Schieber, and Shay Solomon. 2018. Fully dynamic maximal independent set with sublinear update time. In Proc. 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC). 815--826. https://doi.org/10.1145/3188745.3188922Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Sepehr Assadi, Krzysztof Onak, Baruch Schieber, and Shay Solomon. 2019. Fully Dynamic Maximal Independent Set with Sublinear in ?? Update Time. In Proc. 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1919--1936. https://doi.org/10.1137/1.9781611975482.116Google ScholarGoogle Scholar
  9. Chen Avin, Manya Ghobadi, Chen Griner, and Stefan Schmid. 2020. On the Complexity of Traffic Traces and Implications. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4, 1 (2020), 20:1--20:29. https://doi.org/10.1145/3379486Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Daniel Awduche, Angela Chiu, Anwar Elwalid, Indra Widjaja, and XiPeng Xiao. 2002. Overview and principles of Internet traffic engineering. Technical Report. RFC 3272.Google ScholarGoogle Scholar
  11. Baruch Awerbuch, Israel Cidon, and Shay Kutten. 2008. Optimal Maintenance of a Spanning Tree. J. ACM 55, 4 (Sept. 2008). https://doi.org/10.1145/1391289.1391292Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Michael Saks. 1992. Adapting to asynchronous dynamic networks. In Proc. 24th annual ACM symposium on Theory of computing. 557--570. https://doi.org/10.1145/129712.129767Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Nir Bacrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz. 2019. Hardness of distributed optimization. In Proc. of the 2019 ACM Symposium on Principles of Distributed Computing (PODC 2019). 238--247. https://doi.org/10.1145/3293611.3331597Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Philipp Bamberger, Fabian Kuhn, and Yannic Maus. 2019. Local Distributed Algorithms in Highly Dynamic Networks. In Proc. 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2019). https://doi.org/10.1109/ IPDPS.2019.00015Google ScholarGoogle ScholarCross RefCross Ref
  15. Leonid Barenboim and Michael Elkin. 2010. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Computing 22, 5--6 (2010), 363--379.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Leonid Barenboim, Michael Elkin, and Uri Goldenberg. 2018. Locally-Iterative Distributed (? + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In Proc. ACM Symposium on Principles of Distributed Computing (PODC 2018). 437--446. https://doi.org/10.1145/3212734.3212769Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Aaron Bernstein, Sebastian Forster, and Monika Henzinger. 2019. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. In Proc. 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 1899--1918. https://doi.org/10.1137/1.9781611975482.115Google ScholarGoogle ScholarCross RefCross Ref
  18. Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. 2018. Dynamic algorithms via the primal-dual method. Inf. Comput. 261, Part (2018), 219--239. https://doi.org/10.1016/j.ic.2018.02.005Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Arnaud Casteigts, Paola Flocchini,Walter Quattrociocchi, and Nicola Santoro. 2012. Time-varying graphs and dynamic networks. IJPEDS 27, 5 (2012), 387--408. https://doi.org/10.1080/17445760.2012.668546Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman. 2020. Fast Deterministic Algorithms for Highly-Dynamic Networks. CoRR abs/1901.04008 (2020). http://arxiv.org/abs/1901.04008Google ScholarGoogle Scholar
  21. Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, and Dean Leitersdorf. 2019. Fast Approximate Shortest Paths in the Congested Clique. In Proc. 38nd ACM Symposium on Principles of Distributed Computing (PODC 2019). 74--83. https://doi.org/10.1145/3293611.3331633 Proc. ACM Meas. Anal. Comput. Syst., Vol. 5, No. 1, Article 6. Publication date: March 2021. Input-Dynamic Distributed Algorithms for Communication Networks 6:31Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Keren Censor-Hillel, Elad Haramaty, and Zohar S. Karnin. 2016. Optimal Dynamic Distributed MIS. In Proc. 2016 ACM Symposium on Principles of Distributed Computing (PODC 2016). 217--226. https://doi.org/10.1145/2933057.2933083Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner. 2020. Sparse matrix multiplication and triangle listing in the Congested Clique model. Theoretical Computer Science 809 (2020), 45--60. https://doi.org/10.1016/j.tcs.2019.11.006Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, and Umberto Nanni. 2003. A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science 297, 1 (2003), 83--102. https://doi.org/10.1016/S0304- 3975(02)00619--9Google ScholarGoogle ScholarCross RefCross Ref
  25. Artur Czumaj and Christian Konrad. 2019. Detecting cliques in CONGEST networks. Distributed Computing (2019). https://doi.org/10.1007/s00446-019-00368-wGoogle ScholarGoogle ScholarDigital LibraryDigital Library
  26. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2012. Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41 (2012), 1235--1265. https://doi.org/10.1137/11085178XGoogle ScholarGoogle ScholarDigital LibraryDigital Library
  27. Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, and Xiaorui Sun. 2020. Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. In Proc. 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA. 1300--1319. https://doi.org/10.1137/1.9781611975994.79Google ScholarGoogle ScholarCross RefCross Ref
  28. Edsger W. Dijkstra. 1974. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (1974), 643--644. https://doi.org/10.1145/361179.361202Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Shlomi Dolev. 2000. Self-Stabilization. Cambridge, MA.Google ScholarGoogle Scholar
  30. Andrew Drucker, Fabian Kuhn, and Rotem Oshman. 2014. On the Power of the Congested Clique Model. In Proc. 33rd ACM Symposium on Principles of Distributed Computing (PODC 2014). 367--376. https://doi.org/10.1145/2611462.2611493Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Yuhao Du and Hengjie Zhang. 2018. Improved Algorithms for Fully Dynamic Maximal Independent Set. CoRR abs/1804.08908 (2018). http://arxiv.org/abs/1804.08908Google ScholarGoogle Scholar
  32. David Durfee, Yu Gao, Gramoz Goranci, and Richard Peng. 2019. Fully dynamic spectral vertex sparsifiers and applications. In Proc. 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC. 914--925. https://doi.org/ 10.1145/3313276.3316379Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Michael Elkin. 2007. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In Proc. 26th Annual ACM Symposium on Principles of Distributed Computing (PODC). 185--194. https://doi.org/10.1145/1281100. 1281128Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Nick Feamster and Jennifer Rexford. 2017. Why (and how) networks should run themselves. arXiv preprint arXiv:1710.11583 (2017).Google ScholarGoogle Scholar
  35. Nick Feamster, Jennifer Rexford, and Walter Willinger (Eds.). 2018. Proceedings of the Afternoon Workshop on Self- Driving Networks, [email protected] 2018, Budapest, Hungary, August 24, 2018. ACM. http://dl.acm.org/citation.cfm? id=3229584Google ScholarGoogle Scholar
  36. Klaus-Tycho Foerster, Juho Hirvonen, Jukka Suomela, and Stefan Schmid. 2019. On the Power of Preprocessing in Decentralized Network Optimization. In Proc. IEEE Conference on Computer Communications (INFOCOM 2019). https://doi.org/10.1109/INFOCOM.2019.8737382Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, and Stefan Schmid. 2019. Does Preprocessing Help under Congestion?. In Proc. 38nd ACM Symposium on Principles of Distributed Computing, (PODC 2019). 259--261. https: //doi.org/10.1145/3293611.3331581Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Klaus-Tycho Foerster, Thomas Luedi, Jochen Seidel, and Roger Wattenhofer. 2018. Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs. Theoretical Computer Science 709 (2018), 48--63. https: //doi.org/10.1016/j.tcs.2016.11.018Google ScholarGoogle ScholarCross RefCross Ref
  39. Klaus-Tycho Foerster, Oliver Richter, Jochen Seidel, and Roger Wattenhofer. 2017. Local Checkability in Dynamic Networks. In Proc. of the 18th International Conference on Distributed Computing and Networking (ICDCN). ACM, 4:1--10. https://doi.org/10.1145/3007748.3007779Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Klaus-Tycho Foerster and Stefan Schmid. 2019. Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees. In 18th IEEE International Symposium on Network Computing and Applications NCA. IEEE, 1--4. https://doi.org/10.1109/NCA.2019.8935035Google ScholarGoogle Scholar
  41. Bernard Fortz and Mikkel Thorup. 2000. Internet traffic engineering by optimizing OSPF weights. In Proc. IEEE INFOCOM, Vol. 2. IEEE, 519--528. https://doi.org/10.1109/INFCOM.2000.832225Google ScholarGoogle ScholarCross RefCross Ref
  42. Benjamin Frank, Ingmar Poese, Yin Lin, Georgios Smaragdakis, Anja Feldmann, Bruce Maggs, Jannis Rake, Steve Uhlig, and Rick Weber. 2013. Pushing CDN-ISP collaboration to the limit. ACM SIGCOMM Computer Communication Review 43, 3 (2013), 34--44. https://doi.org/10.1145/2500098.2500103Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Seth Gilbert and Lawrence Li. 2020. How Fast Can You Update Your MST?. In Proc. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 531?533. https://doi.org/10.1145/3350755.3400240Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Gramoz Goranci, Monika Henzinger, and Pan Peng. 2017. The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. In 25th Annual European Symposium on Algorithms, ESA. 45:1--45:14. https://doi.org/10.4230/LIPIcs.ESA.2017.45 Proc. ACM Meas. Anal. Comput. Syst., Vol. 5, No. 1, Article 6. Publication date: March 2021. 6:32 Klaus-Tycho Foerster et al.Google ScholarGoogle Scholar
  45. Manoj Gupta and Shahbaz Khan. 2018. Simple dynamic algorithms for Maximal Independent Set and other problems. CoRR abs/1804.01823 (2018). http://arxiv.org/abs/1804.01823Google ScholarGoogle Scholar
  46. Monika Henzinger. 2018. The State of the Art in Dynamic Graph Algorithms. In SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science. 40--44. https://doi.org/10.1007/978--3--319--73117--9_3Google ScholarGoogle Scholar
  47. Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. 2016. Dynamic Approximate All-Pairs Shortest Paths: Breaking the ??(????) Barrier and Derandomization. SIAM J. Comput. 45, 3 (2016), 947--1006. https://doi.org/10. 1137/140957299Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In Proc. 47th Annual ACM on Symposium on Theory of Computing, STOC. 21--30. https://doi.org/10.1145/2746539.2746609Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Monika Rauch Henzinger and Valerie King. 1999. Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46, 4 (1999), 502--516. https://doi.org/10.1145/320211.320215Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 4 (2001), 723--760. https://doi.org/10. 1145/502090.502095Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Giuseppe F. Italiano. 1991. Distributed Algorithms for Updating Shortest Paths. In Proc. 5th International Workshop on Distributed Algorithms (WDAG). 200--211. https://doi.org/10.1007/BFb0022448Google ScholarGoogle Scholar
  52. Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, and Nikos Parotsidis. 2019. Dynamic Algorithms for the Massively Parallel Computation Model. In Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019). Association for Computing Machinery, New York, NY, USA, 49--58. https://doi.org/10.1145/3323165. 3323202Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Michael König and Roger Wattenhofer. 2013. On Local Fixing. In Proc. 17th International Conference on Principles of Distributed Systems (OPODIS 2013). 191--205. https://doi.org/10.1007/978--3--319-03850--6_14Google ScholarGoogle ScholarCross RefCross Ref
  54. Janne H. Korhonen and Joel Rybicki. 2017. Deterministic Subgraph Detection in Broadcast CONGEST. In Proc. 21st International Conference on Principles of Distributed Systems (OPODIS 2017). https://doi.org/10.4230/LIPIcs.OPODIS. 2017.4Google ScholarGoogle Scholar
  55. Fabian Kuhn, Nancy A. Lynch, and Rotem Oshman. 2010. Distributed computation in dynamic networks. In Proc. 42nd ACM Symposium on Theory of Computing, STOC. 513--522. https://doi.org/10.1145/1806689.1806760Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Eyal Kushilevitz and Noam Nisan. 1997. Communication complexity. Cambridge University Press.Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Christoph Lenzen. 2013. Optimal deterministic routing and sorting on the congested clique. In Proc. 2013 ACM symposium on Principles of distributed computing (PODC 2013). 42--50. https://doi.org/10.1145/2484239.2501983Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. 2005. Minimum-Weight Spanning Tree Construction in ??(log log??) Communication Rounds. SIAM J. Comput. 35, 1 (2005), 120--131. https://doi.org/10.1137/ S0097539704441848Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. Oliver Michel and Eric Keller. 2017. SDN in wide-area networks: A survey. In Proc. 4th International Conference on Software Defined Systems, (SDS 2017). IEEE, 37--42. https://doi.org/10.1109/SDS.2017.7939138Google ScholarGoogle ScholarCross RefCross Ref
  60. Ofer Neiman and Shay Solomon. 2016. Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms 12, 1 (2016), 7:1--7:15. https://doi.org/10.1145/2700206Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Juniper Networks. 2020. Expel complexity with a Self-Driving Network. https://www.juniper.net/us/en/dm/the-selfdriving- network/Google ScholarGoogle Scholar
  62. Krzysztof Nowicki. 2019. A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. http://arxiv.org/abs/1912.04239 arXiv:1912.04239 [cs.DS].Google ScholarGoogle Scholar
  63. Krzysztof Nowicki and Krzysztof Onak. 2020. Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. CoRR abs/2002.07800 (2020). https://arxiv.org/abs/2002.07800Google ScholarGoogle Scholar
  64. Regina O'Dell and Roger Wattenhofer. 2005. Information dissemination in highly dynamic graphs. In Proc. DIALMPOMC Joint Workshop on Foundations of Mobile Computing, Suman Banerjee and Samrat Ganguly (Eds.). 104--110. https://doi.org/10.1145/1080810.1080828Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. Merav Parter, David Peleg, and Shay Solomon. 2016. Local-on-Average Distributed Tasks. In Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 220--239. https://doi.org/10.1137/1.9781611974331.ch17Google ScholarGoogle ScholarCross RefCross Ref
  66. David Peleg. 1998. Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees. In Proc. International Colloquium on Automata, Languages, and Programming (ICALP 1998). Springer, 164--175. https://doi.org/10.1007/BFb0055050Google ScholarGoogle ScholarCross RefCross Ref
  67. David Peleg. 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics.Google ScholarGoogle ScholarDigital LibraryDigital Library
  68. Radia J. Perlman. 1985. An algorithm for distributed computation of a spanning tree in an extended LAN. In Proc. 9th Symposium on Data Communications (SIGCOMM), William Lidinsky and Bart W. Stuck (Eds.). ACM, 44--53. Proc. ACM Meas. Anal. Comput. Syst., Vol. 5, No. 1, Article 6. Publication date: March 2021. Input-Dynamic Distributed Algorithms for Communication Networks 6:33 https://doi.org/10.1145/319056.319004Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. Larry L. Peterson and Bruce S. Davie. 2011. Computer Networks, Fifth Edition: A Systems Approach (5th ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.Google ScholarGoogle Scholar
  70. Monika Rauch Henzinger and Mikkel Thorup. 1996. Improved sampling with applications to dynamic graph algorithms. In Proc. International Colloquium on Automata, Languages, and Programming (ICALP 1998). Springer, 290--299.Google ScholarGoogle ScholarCross RefCross Ref
  71. Alexander A. Razborov. 1992. On the Distributional Complexity of Disjointness. Theor. Comput. Sci. 106, 2 (1992), 385--390. https://doi.org/10.1016/0304--3975(92)90260-MGoogle ScholarGoogle ScholarCross RefCross Ref
  72. Stefan Schmid and Jukka Suomela. 2013. Exploiting locality in distributed SDN control. In Proc. 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN 2013). ACM Press, 121--126. https://doi.org/10.1145/ 2491185.2491198Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. A. Schrijver. 2003. Combinatorial Optimization - Polyhedra and Efficiency. Springer.Google ScholarGoogle Scholar
  74. Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu. 2016. Work-efficient parallel union-find with applications to incremental graph connectivity. In European Conference on Parallel Processing. Springer, 561--573. https://doi.org/10.1007/978--3--319--43659--3_41Google ScholarGoogle ScholarCross RefCross Ref
  75. Thomas Tseng, Laxman Dhulipala, and Guy Blelloch. 2019. Batch-Parallel Euler Tour Trees. In Proc. 21st Meeting on Algorithm Engineering and Experiments (ALENEX 2019). 92--106. https://doi.org/10.1137/1.9781611975499.8Google ScholarGoogle ScholarCross RefCross Ref
  76. David Wang. 2020. Moving towards autonomous driving networks. https://www.huawei.com/en/publications/ communicate/87/moving-towards-autonomous-driving-networksGoogle ScholarGoogle Scholar
  77. S. Wang, C. Wu, and C. Chou. 2015. Constructing an optimal spanning tree over a hybrid network with SDN and legacy switches. In 2015 IEEE Symposium on Computers and Communication (ISCC). 502--507. https://doi.org/10.1109/ ISCC.2015.7405564Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Input-Dynamic Distributed Algorithms for Communication Networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!