TY - GEN
T1 - Construction of a proxy-based overlay skeleton tree for large-scale real-time group communications
AU - Guo, Jun
AU - Jha, Sanjay
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=37249005298&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-37249005298&origin=recordpage
U2 - 10.1007/978-3-540-72606-7_62
DO - 10.1007/978-3-540-72606-7_62
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783540726050
T3 - Lecture Notes in Computer Science
SP - 726
EP - 737
BT - NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
A2 - Akyildiz, Ian F.
A2 - Sivakumar, Raghupathy
A2 - Ekici, Eylem
A2 - de Oliveira, Jaudelice Cavalcante
A2 - McNair, Janise
PB - Springer
CY - Berlin, Heidelberg
T2 - 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet (NETWORKING'07)
Y2 - 14 May 2007 through 18 May 2007
ER -