Cited By
View all- Jahja IYu H(2024)Sublinear Algorithms in T-Interval Dynamic NetworksAlgorithmica10.1007/s00453-024-01250-386:9(2959-2996)Online publication date: 12-Jul-2024
Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks
Pages 131 - 141
Abstract
This paper considers standard T-interval dynamic networks, where the N nodes in the network proceed in lock-step rounds, and where the topology of the network can change arbitrarily from round to round, as determined by an adversary. The adversary promises that in every T consecutive rounds, the T (potentially different) topologies in those T rounds contain a common connected subgraph that spans all nodes. Within such a context, we propose novel algorithms for solving some fundamental distributed computing problems such as Count/Consensus/Max. Our algorithms are the first algorithms whose complexities do not contain an Ømega(N) term, under constant T values. Previous sublinear algorithms require significantly larger T values.
References
[1]
Sebastian Abshoff, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, and Friedhelm Meyer auf der Heide. 2013. Token Dissemination in Geometric Dynamic Networks. In ALGOSENSORS.
[2]
M. Ahmadi and F. Kuhn. 2017. Multi-message Broadcast in Dynamic Radio Networks. In ALGOSENSORS.
[3]
M. Ahmadi, F. Kuhn, S. Kutten, A. R. Molla, and G. Pandurangan. 2019. The Communication Cost of Information Spreading in Dynamic Networks. In ICDCS.
[4]
J. Augustine, C. Avin, M. Liaee, G. Pandurangan, and R. Rajaraman. 2016. Information Spreading in Dynamic Networks Under Oblivious Adversaries. In DISC.
[5]
John Augustine, Gopal Pandurangan, and Peter Robinson. 2013. Fast byzantine agreement in dynamic networks. In PODC.
[6]
J. Augustine, G. Pandurangan, and P. Robinson. 2015. Fast Byzantine Leader Election in Dynamic Networks. In DISC.
[7]
Chen Avin, Michal Koucky, and Zvi Lotker. 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In ICALP.
[8]
C. Avin, M. Koucky, and Z. Lotker. 2018. Cover time and mixing time of random walks on dynamic graphs. Random Structures & Algorithms 52, 4 (2018), 576--596.
[9]
P. Brandes and F. Meyer auf der Heide. 2012. Distributed Computing in Faultprone Dynamic Networks. In International Workshop on Theoretical Aspects of Dynamic Distributed Systems.
[10]
M. Chakraborty, A. Milani, and M. Mosteiro. 2018. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80, 11 (Nov 2018), 3023--3049.
[11]
Bogdan S Chlebus, Dariusz R Kowalski, Jan Olkowski, and Jedrzej Olkowski. 2021. Consensus in Networks Prone to Link Failures. arXiv preprint arXiv:2102.01251 (2021).
[12]
Atish Das Sarma, Anisur Molla, and Gopal Pandurangan. 2012. Fast Distributed Computation in Dynamic Networks via Random Walks. In DISC.
[13]
A. Das Sarma, A. Molla, and G. Pandurangan. 2015. Distributed Computation in Dynamic Networks via Random Walks. Theor. Comput. Sci. 581, C (May 2015), 45--66.
[14]
O. Denysyuk and L. Rodrigues. 2014. Random Walks on Evolving Graphs with Recurring Topologies. In DISC.
[15]
Mohsen Ghaffari, Nancy Lynch, and Calvin Newport. 2013. The cost of radio network broadcast for different models of unreliable links. In PODC.
[16]
Bernhard Haeupler and David Karger. 2011. Faster information dissemination in dynamic networks via network coding. In PODC.
[17]
Ruomu Hou, Irvan Jahja, Yucheng Sun, JiyanWu, and Haifeng Yu. 2022. Achieving Sublinear Complexity under Constant in -interval Dynamic Networks. Technical Report. School of Computing, National University of Singapore. Also available at https://www.comp.nus.edu.sg/%7Eyuhf/adaptivewalk-spaa22-tr.pdf.
[18]
Irvan Jahja and Haifeng Yu. 2020. Sublinear Algorithms in -interval Dynamic Networks. In SPAA.
[19]
J. Katz and Y. Lindell. 2020. Introduction to modern cryptography. CRC press.
[20]
D. Kowalski and M. Mosteiro. 2018. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. In ICALP.
[21]
Dariusz R Kowalski and Miguel A Mosteiro. 2019. Polynomial anonymous dynamic distributed computing without a unique leader. In ICALP.
[22]
Dariusz R Kowalski and Miguel A Mosteiro. 2021. Supervised Average Consensus in Anonymous Dynamic Networks. In SPAA.
[23]
Fabian Kuhn, Nancy Lynch, and Rotem Oshman. 2010. Distributed Computation in Dynamic Networks. In STOC.
[24]
G. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis. 2014. Conscious and unconscious counting on anonymous dynamic networks. In International Conference on Distributed Computing and Networking.
[25]
G. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis. 2014. Counting in Anonymous Dynamic Networks Under Worst-Case Adversary. In IEEE International Conference on Distributed Computing Systems.
[26]
G. Luna, S. Bonomi, I. Chatzigiannakis, and R. Baldoni. 2013. Counting in anonymous dynamic networks: An experimental perspective. In ALGOSENSORS.
[27]
O. Michail, I. Chatzigiannakis, and P. Spirakis. 2013. Naming and Counting in Anonymous Unknown Dynamic Networks. In Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems.
[28]
D. Peleg. 1987. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania.
[29]
S. Ramanujan. 1919. A proof of Bertrand's postulate. Journal of the Indian Mathematical Society 11, 181--182 (1919), 27.
[30]
T. Sauerwald and L. Zanetti. 2019. Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. In ICALP.
[31]
Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612--613.
[32]
H. Yu, Y. Zhao, and I. Jahja. 2018. The Cost of Unknown Diameter in Dynamic Networks. J. ACM 65, 5 (Sept. 2018), 31:1--31:34.
Index Terms
- Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks
Recommendations
Sublinear Algorithms in T-interval Dynamic Networks
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider standard T-interval dynamic networks, under the synchronous timing model and the broadcast CONGEST model. In a T-interval dynamic network, the set of nodes is always fixed and there are no node failures. The edges in the network are always ...
Sublinear Algorithms in T-Interval Dynamic Networks
AbstractWe consider standard T-interval dynamic networks, under the synchronous timing model and the broadcast CONGEST model. In a T-interval dynamic network, the set of nodes is always fixed and there are no node failures. The edges in the network are ...
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingThe computation of the diameter is one of the most central problems in distributed computation. In the standard CONGEST model, in which two adjacent nodes can exchange O(log n) bits per round (here n denotes the number of nodes of the network), it is ...
Comments
Information & Contributors
Information
Published In
July 2022
464 pages
ISBN:9781450391467
DOI:10.1145/3490148
- General Chair:
- Kunal Agrawal,
- Program Chair:
- I-Ting Angelina Lee
Copyright © 2022 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 July 2022
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Singapore Ministry of Education
Conference
SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures
July 11 - 14, 2022
PA, Philadelphia, USA
Acceptance Rates
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 160Total Downloads
- Downloads (Last 12 months)80
- Downloads (Last 6 weeks)9
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Jahja IYu H(2024)Sublinear Algorithms in T-Interval Dynamic NetworksAlgorithmica10.1007/s00453-024-01250-386:9(2959-2996)Online publication date: 12-Jul-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in