Maintaining balanced trees for structured distributed streaming systems

DOI10.1016/J.DAM.2017.07.006zbMath1372.05035OpenAlexW2743334930MaRDI QIDQ2410236

Nicolas Nisse, R. Modrzejewski, Frederic Giroire, Stéphane Pérennes

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01620358/file/Streaming_full_version.pdf

zbMATH Keywords

graph algorithmpeer-to-peerbalanced treesdistributed live streaming system

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Maintaining balanced trees for structured distributed streaming systems ⋮ Maintaining Balanced Trees for Structured Distributed Streaming Systems

Cites Work

• An \(O(n)\)-time self-stabilizing leader election algorithm
• A distributed algorithm for constructing a minimum diameter spanning tree
• Maintaining balanced trees for structured distributed streaming systems
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Self-stabilizing systems in spite of distributed control
• Self-stabilizing depth-first token circulation in arbitrary rooted networks
• Time optimal self-stabilizing synchronization

This page was built for publication: Maintaining balanced trees for structured distributed streaming systems