A deterministic worst-case message complexity optimal solution for resource discovery

S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67.

Download
Restricted 327-KKS15-TOCS_01.pdf 398.04 KB
Journal Article
Author
; ;
Abstract
We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
Publishing Year
Journal Title
Theoretical Computer Science
Page
67-79
LibreCat-ID

Cite this

Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science. 2015:67-79. doi:10.1016/j.tcs.2014.11.027.
Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79. http://doi.org/10.1016/j.tcs.2014.11.027
@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79}}
Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, 2015, 67–79. doi:10.1016/j.tcs.2014.11.027.
S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” Theoretical Computer Science, pp. 67–79, 2015.
Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science (2015): 67–79. Web.
Main File(s)
File Name
327-KKS15-TOCS_01.pdf 398.04 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-20T07:38:02Z

frontdoor.tabs.publications.cited_by
This publication cites the following data publications:

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar