Maintaining balanced trees for structured distributed streaming systems

In this paper, we propose and analyze a simple local algorithm to balance a tree. The motivation comes from live distributed streaming systems in which a source diffuses a content to peers via a tree, a node forwarding the data to its children. Such systems are subject to a high churn, peers frequen...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 232; S. 176 - 188
Hauptverfasser:	Giroire, F., Modrzejewski, R., Nisse, N., Pérennes, S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 11.12.2017 Elsevier BV Elsevier
Schlagworte:	Algorithms Balanced trees Children Computer Science Convergence Data Structures and Algorithms Diffusion Distributed live streaming system Graph algorithm Peer-to-peer Peers Repair Peer-to-peer Distributed live streaming system Balanced trees Graph algorithm Distributed Live Streaming System Graph Algorithm Balanced Trees
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!