On Two-Party Communication Through Dynamic Networks
Abshoff, Sebastian
Benter, Markus
Malatyali, Manuel
Meyer auf der Heide, Friedhelm
ddc:040
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.
2013
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
http://purl.org/coar/resource_type/c_5794
https://ris.uni-paderborn.de/record/507
Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2013:11-22. doi:<a href="https://doi.org/10.1007/978-3-319-03850-6_2">10.1007/978-3-319-03850-6_2</a>
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-03850-6_2
info:eu-repo/semantics/closedAccess