Skip to main content
SpringerLink
Log in

On Two-Party Communication through Dynamic Networks

  • Conference paper
Principles of Distributed Systems (OPODIS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8304))

Included in the following conference series:

Abstract

We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n + 3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity.

This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Centre “On-The-Fly Computing” (SFB 901), by the EU within FET project MULTIPLEX under contract no. 317532, and the International Graduate School “Dynamic Intelligent Systems”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biely, M., Robinson, P., Schmid, U.: Agreement in directed dynamic networks. In: SIROCCO, pp. 73–84 (2012)

    Google Scholar 

  2. Brandes, P., Meyer auf der Heide, F.: Distributed computing in fault-prone dynamic networks. In: TADDS, pp. 9–14 (2012)

    Google Scholar 

  3. Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: SODA, pp. 717–736 (2013)

    Google Scholar 

  4. Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: SODA, pp. 1150–1162 (2012)

    Google Scholar 

  5. Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: PODC, pp. 381–390 (2011)

    Google Scholar 

  6. Kuhn, F., Lenzen, C., Locher, T., Oshman, R.: Optimal gradient clock synchronization in dynamic networks. In: PODC, pp. 430–439 (2010)

    Google Scholar 

  7. Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513–522 (2010)

    Google Scholar 

  8. Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: PODC, pp. 1–10 (2011)

    Google Scholar 

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

    Article  Google Scholar 

  10. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Brief announcement: Naming and counting in anonymous unknown dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 437–438. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 269–283. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104–110 (2005)

    Google Scholar 

  13. Oshman, R.: Distributed Computation in Wireless and Dynamic Networks. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (September 2012)

    Google Scholar 

  14. Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235–1265 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Das Sarma, A., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 136–150. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209–213 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute & Computer Science Department, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Sebastian Abshoff, Markus Benter, Manuel Malatyali & Friedhelm Meyer auf der Heide

Authors
  1. Sebastian Abshoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Benter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel Malatyali
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Ingegneria Informatica, Automatica e Gestionale ”Antonio Ruberti”, Sapienza Research Center of Cyber Intelligence and Information Security and Università degli Studi di Roma ”La Sapienza”, Via Ariosto 25, 00185, Rome, Italy

    Roberto Baldoni

  2. CNRS, 13S, UMR 7271, Inria France and Université Nice Sophia Antipolis, 06900, Sophia Antipolis, France

    Nicolas Nisse

  3. Department of Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Maarten van Steen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Abshoff, S., Benter, M., Malatyali, M., Meyer auf der Heide, F. (2013). On Two-Party Communication through Dynamic Networks. In: Baldoni, R., Nisse, N., van Steen, M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham. https://doi.org/10.1007/978-3-319-03850-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03850-6_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03849-0

  • Online ISBN: 978-3-319-03850-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation