research-article

The Cost of Unknown Diameter in Dynamic Networks

Authors:

Irvan JahjaAuthors Info & Claims

SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

Pages 405 - 416

https://doi.org/10.1145/2935764.2935781

Published: 11 July 2016 Publication History

Abstract

For dynamic networks with unknown diameter, we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together with trivial upper bounds under dynamic networks with known diameter for these problems, our lower bounds show that the complexities of all these problems are sensitive to whether the diameter is known to the protocol beforehand: Not knowing the diameter increases the time complexities by a large poly(N) factor as compared to when the diameter is known, resulting in an exponential gap. Here N is the number of nodes in the network. Our lower bounds are obtained via communication complexity arguments and by reducing from the two-party DisjointnessCP problem. We further prove that sometimes this large poly(N) cost can be completely avoided if the protocol is given a good estimate of N. In other words, having such an estimate makes some problems no longer sensitive to unknown diameter.

References

[1]

Y. Afek and D. Hendler. On the complexity of global computation in the presence of link failures: the general case. Distributed Computing, 8(3):115--120, 1995.

Digital Library

[2]

C. Avin, M. Kouckỳ, and Z. Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In ICALP, July 2008.

Digital Library

[3]

K. Censor-Hillel, S. Gilbert, F. Kuhn, N. Lynch, and C. Newport. Structuring unreliable radio networks. In PODC, June 2011.

Digital Library

[4]

B. Chen, H. Yu, Y. Zhao, and P. B. Gibbons. The cost of fault tolerance in multi-party communication complexity. Journal of the ACM, 61(3), May 2014.

Digital Library

[5]

A. Cornejo, S. Gilbert, and C. Newport. Aggregation in dynamic networks. In PODC, July 2012.

Digital Library

[6]

A. Drucker, F. Kuhn, and R. Oshman. The communication complexity of distributed task allocation. In PODC, July 2012.

Digital Library

[7]

C. Dutta, G. Pandurangan, R. Rajaraman, Z. Sun, and E. Viola. On the complexity of information spreading in dynamic networks. In SODA, Jan. 2013.

Digital Library

[8]

E. Fusco and A. Pelc. Knowledge, level of symmetry, and time of leader election. In ESA, Sept. 2012.

Digital Library

[9]

M. Ghaffari, N. Lynch, and C. Newport. The cost of radio network broadcast for different models of unreliable links. In PODC, July 2013.

Digital Library

[10]

O. Goldreich and L. Shrira. On the complexity of computation in the presence of link failures: the case of a ring. Distributed Computing, 5(3), 1991.

Digital Library

[11]

B. Haeupler and D. Karger. Faster information dissemination in dynamic networks via network coding. In PODC, June 2011.

Digital Library

[12]

B. Haeupler and F. Kuhn. Lower bounds on information dissemination in dynamic networks. In DISC, Oct. 2012.

Digital Library

[13]

F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa. Broadcasting in unreliable radio networks. In PODC, July 2010.

Digital Library

[14]

F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In STOC, June 2010.

Digital Library

[15]

F. Kuhn, Y. Moses, and R. Oshman. Coordinated consensus in dynamic networks. In PODC, June 2011.

Digital Library

[16]

F. Kuhn and R. Oshman. The complexity of data aggregation in directed networks. In DISC, Sept. 2011.

Digital Library

[17]

F. Kuhn and R. Oshman. Dynamic networks: models and algorithms. SIGACT News, 42(1):82--96, Mar. 2011.

Digital Library

[18]

D. Mosk-Aoyama and D. Shah. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, 54(7):2997--3007, 2008.

Digital Library

[19]

D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, 1987.

[20]

A. Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. In STOC, 2011.

Digital Library

[21]

H. Yu, Y. Zhao, and I. Jahja. The Cost of Unknown Diameter in Dynamic Networks. Technical Report TRA4/16, School of Computing, National University of Singapore, April 2016. Also available attexttt http://www.comp.nus.edu.sg/%7Eyuhf/TRA4--16.pdf.

Digital Library

[22]

Y. Zhao, H. Yu, and B. Chen. Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions. Distributed Computing, 29(1):17--38, Feb 2016.

Digital Library

Cited By

Bamberger PKuhn FMaus Y(2019)Local Distributed Algorithms in Highly Dynamic Networks2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2019.00015(33-42)Online publication date: May-2019
https://doi.org/10.1109/IPDPS.2019.00015
Jahja IYu HZhao Y(2019)Some lower bounds in dynamic networks with oblivious adversariesDistributed Computing10.1007/s00446-019-00360-4Online publication date: 7-Aug-2019
https://doi.org/10.1007/s00446-019-00360-4
Yu HZhao YJahja I(2018)The Cost of Unknown Diameter in Dynamic NetworksJournal of the ACM10.1145/320966565:5(1-34)Online publication date: 29-Aug-2018
https://dl.acm.org/doi/10.1145/3209665
Show More Cited By

Index Terms

The Cost of Unknown Diameter in Dynamic Networks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

The Cost of Unknown Diameter in Dynamic Networks

For dynamic networks with unknown diameter, we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together with trivial upper bounds under dynamic networks with known diameter for these problems, our ...
Some lower bounds in dynamic networks with oblivious adversaries
Abstract
This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel $Ω (d + poly (m))$ lower bounds on their time complexity (in rounds). Here d is the dynamic diameter of the dynamic ...
Property Testing Lower Bounds via Communication Complexity
Selected papers from the 26th Annual IEEE Conference on Computational Complexity (CCC 2011)

We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for reducing communication problems to testing problems, thus allowing us to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

July 2016

492 pages

ISBN:9781450342100

DOI:10.1145/2935764

General Chair:
Christian Scheideler
University of Paderborn
,
Program Chair:
Seth Gilbert
National University of Singapore

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 July 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Singapore Ministry of Education Academic Research Fund Tier-2

Conference

SPAA '16

Sponsor:

SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures

July 11 - 13, 2016

California, Pacific Grove, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
101
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bamberger PKuhn FMaus Y(2019)Local Distributed Algorithms in Highly Dynamic Networks2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2019.00015(33-42)Online publication date: May-2019
https://doi.org/10.1109/IPDPS.2019.00015
Jahja IYu HZhao Y(2019)Some lower bounds in dynamic networks with oblivious adversariesDistributed Computing10.1007/s00446-019-00360-4Online publication date: 7-Aug-2019
https://doi.org/10.1007/s00446-019-00360-4
Yu HZhao YJahja I(2018)The Cost of Unknown Diameter in Dynamic NetworksJournal of the ACM10.1145/320966565:5(1-34)Online publication date: 29-Aug-2018
https://dl.acm.org/doi/10.1145/3209665
Yu HZhao YJahja IScheideler CGilbert S(2016)The Cost of Unknown Diameter in Dynamic NetworksProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935781(405-416)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935781

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten