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

DOI10.1007/978-3-319-03578-9_14zbMath1406.68009arXiv1306.1692MaRDI QIDQ2868642

Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.1692

zbMATH Keywords

distributed algorithms; self-stabilization; resource discovery; clique network

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M14: Distributed systems

68W15: Distributed algorithms

Uses Software

• Chord
• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• Group-based cryptography
• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Discovery Through Gossip
• Resource discovery in distributed networks
• Novel architectures for P2P applications
• Fast Self-stabilizing Minimum Spanning Tree Construction
• A Self-stabilizing and Local Delaunay Graph Construction
• Reaching Agreement in the Presence of Faults
• Self-stabilizing systems in spite of distributed control
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Viceroy