Maintaining balanced trees for structured distributed streaming systems

DOI10.1007/978-3-319-03578-9_15MaRDI QIDQ2868643zbMATH OpenOpenAlexFDO

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

Publication date 17 December 2013

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

Full work available at URL https://doi.org/10.1007/978-3-319-03578-9_15

zbMATH Keywords

distributed algorithmslive streamingpeer-to-peertree balancing

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Maintaining balanced trees for structured distributed streaming systems
• Balanced-Replication Algorithms for Distribution Trees
• scientific article; zbMATH DE number 1947401
• Balanced binary trees for ID management and load balance in distributed hash tables
• Balanced distributed search trees do not exist

Cites work

• Maintaining balanced trees for structured distributed streaming systems

Cited in

(3)

• A steady state analysis of diffracting trees
• Primal dual based algorithm for degree-balanced spanning tree problem
• Maintaining balanced trees for structured distributed streaming systems

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

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