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

DOI10.1016/J.TCS.2014.11.027MaRDI QIDQ2345458zbMATH OpenOpenAlexFDO

Authors Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler

Publication date 22 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.11.027

zbMATH Keywords

distributed algorithmsself-stabilizationresource discoveryclique network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Asynchronous resource discovery
• Deterministic resource discovery in distributed networks
• Asynchronous resource discovery
• Distributed resource discovery in sub-logarithmic time

Cites work

• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• A Distributed and Oblivious Heap
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A self-stabilizing and local Delaunay graph construction
• Deterministic resource discovery in distributed networks
• Discovery through gossip
• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
• Group-based cryptography
• HyperTree for self-stabilizing peer-to-peer systems
• Linearization: locally self-stabilizing sorting in graphs
• Novel architectures for P2P applications: the continuous-discrete approach
• Reaching Agreement in the Presence of Faults
• Resource discovery in distributed networks
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• Self-stabilizing systems in spite of distributed control
• The hyperring: a low-congestion deterministic data structure for distributed environments
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(1)

• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery

Describes a project that uses

Uses Software

• Pastry
• Chord

This page was built for publication: A deterministic worst-case message complexity optimal solution for resource discovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345458)