On Two-Party Communication through Dynamic Networks

  • Sebastian Abshoff
  • Markus Benter
  • Manuel Malatyali
  • Friedhelm Meyer auf der Heide
Conference paper

DOI: 10.1007/978-3-319-03850-6_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)
Cite this paper as:
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

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.

Keywords

Directed Dynamic Networks Two-Party Communication Counting Token Dissemination Communication Complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Sebastian Abshoff
    • 1
  • Markus Benter
    • 1
  • Manuel Malatyali
    • 1
  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Heinz Nixdorf Institute & Computer Science DepartmentUniversity of PaderbornPaderbornGermany

Personalised recommendations