Abstract
In this paper, we propose and analyze a simple localized 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 frequently joining and leaving the system. It is thus crucial to be able to repair the diffusion tree to allow an efficient data distribution. In particular, due to bandwidth limitations, an efficient diffusion tree must ensure that node degrees are bounded. Moreover, to minimize the delay of the streaming, the depth of the diffusion tree must also be controlled. We propose here a simple distributed repair algorithm in which each node carries out local operations based on its degree and on the subtree sizes of its children. In a synchronous setting, we first prove that starting from any n-node tree our process converges to a balanced tree in O(n 2) turns. We then describe a more restrictive model, adding a small extra information to each node, under which we adopt our algorithm to converge in \(\Theta(\emph{n}log\emph{n})\) turns. We then exhibit by simulation that the convergence is much faster (logarithmic number of turns in average) for a random tree.
The research leading to these results has received funding from the European Project FP7 EULER, ANR CEDRE, ANR AGAPE, Associated Team AlDyNet, project ECOS-Sud Chile and région PACA.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bosilca, G., Coti, C., Herault, T., Lemarinier, P., Dongarra, J.: Constructing resiliant communication infrastructure for runtime environments. In: International Conference in Parallel Computing (2009)
Caron, E., Datta, A., Petit, F., Tedeschi, C.: Self-stabilization in tree-structured peer-to-peer service discovery systems. In: IEEE Symposium on Reliable Distributed Systems, pp. 207–216 (2008)
Castro, M., Druschel, P., Kermarrec, A., Nandi, A., Rowstron, A., Singh, A.: SplitStream: high-bandwidth multicast in cooperative environments. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, p. 313 (2003)
Dan, G., Fodor, V., Chatzidrossos, I.: On the performance of multiple-tree-based peer-to-peer live streaming. In: 26th IEEE International Conference on Computer Communications, pp. 2556–2560 (2007)
Giroire, F., Remigiusz, M., Nisse, N., Pérennes, S.: Maintaining Balanced Trees for Structured Distributed Streaming Systems. Research Report RR-8309, INRIA (May 2013)
Herault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: A model for large scale self-stabilization. In: IEEE Parallel and Distributed Processing Symposium, pp. 1–10 (2007)
Li, B., Qu, Y., Keung, Y., Xie, S., Lin, C., Liu, J., Zhang, X.: Inside the new coolstreaming: Principles, measurements and performance implications. In: 27th IEEE International Conference on Computer Communications (2008)
Li, Z., Xie, G., Hwang, K., Li, Z.: Churn-resilient protocol for massive data dissemination in p2p networks. IEEE Parallel and Distributed Systems 22(8), 1342–1349 (2011)
Magharei, N., Rejaie, R.: Prime: Peer-to-peer receiver-driven mesh-based streaming. IEEE/ACM Transactions on Networking 17(4), 1052–1065 (2009)
Pan, M.-S., Tsai, C.-H., Tseng, Y.-C.: The orphan problem in zigbee wireless networks. IEEE Transactions on Mobile Computing 8(11), 1573–1584 (2009)
Venkataraman, V., Yoshida, K., Francis, P.: Chunkyspread: Heterogeneous unstructured tree-based peer-to-peer multicast. In: 14th IEEE International Conference on Network Protocols, pp. 2–11 (2006)
Zhang, S., Shao, Z., Chen, M.: Optimal distributed p2p streaming under node degree bounds. In: 18th IEEE International Conference on Network Protocols, pp. 253–262 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giroire, F., Modrzejewski, R., Nisse, N., Pérennes, S. (2013). Maintaining Balanced Trees for Structured Distributed Streaming Systems. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)