Construction of a proxy-based overlay skeleton tree for large-scale real-time group communications

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning all multicast proxies deployed in the overlay backbone, POST acts as an efficient resource sharing platform for supporting large numbers of concurrent multicast sessions, without the need of tree computation for each individual session. The problem is concerned with deciding an appropriate deployment of multicast proxies in the overlay backbone, upon which we wish to find an optimal POST solution so that the maximum end-to-end latency is minimized subject to degree balancing constraints. This problem is shown to be NP-hard. We present a simple heuristic method for deploying multicast proxies, and devise a low complexity greedy algorithm for optimizing the end-toend latency and degree distribution of POST. Simulation experiments confirm that our proposed approach yields good quality approximate solutions that are close to the optimum. © IFIP International Federation for Information Processing 2007.

Cite

CITATION STYLE

APA

Guo, J., & Jha, S. (2007). Construction of a proxy-based overlay skeleton tree for large-scale real-time group communications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 726–737). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free