Share Email Print

Proceedings Paper

Effective overlay multicast tree constructing algorithm over multiple differentiated-service networks
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this work, we present an effective overlay multicast tree constructing algorithm to meet delay constraint for real-time media service with the minimum networking price over Differentiated-Service networks. In addition, a dynamic and scalable tree maintaining algorithm is proposed for seamless service by updating the small parts of the tree when some End-systems join or leave the multicast group. An effective solution is obtained by changing the tree structure among Data-server, Proxy-senders and End-systems and the class vector of Proxy-senders. Finally, experimental results are presented to compare the performance of the proposed algorithm.

Paper Details

Date Published: 19 January 2006
PDF: 10 pages
Proc. SPIE 6077, Visual Communications and Image Processing 2006, 607719 (19 January 2006); doi: 10.1117/12.642902
Show Author Affiliations
Dai-Boong Lee, POSTECH (South Korea)
Hwangjun Song, POSTECH (South Korea)

Published in SPIE Proceedings Vol. 6077:
Visual Communications and Image Processing 2006
John G. Apostolopoulos; Amir Said, Editor(s)

© SPIE. Terms of Use
Back to Top