Share Email Print

Proceedings Paper

Stability oriented multicast routing algorithm
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Existing multicast models have taken traffic concentration, source-end delay, delay jitter into consideration, while some dynamic application like digital TV delivery poses a new challenge. Users can join/leave multicast group dynamically and arbitrarily. When users have left the multicast group, multicast protocols will delete the corresponding delivery edge in the multicast tree. This leads to great control overhead in delivery network. This overhead comes from several aspects, like forwarding tree maintain, update, membership management. Even if the multicast tree is pre-calculated and cannot delete edge in runtime, the users' leaving action can lead to resource utilization problem, especially when the delivery network's bandwidth is expensive. In this paper we designed an algorithm to find the optimized multicast tree to ensure stability of network under dynamic user behavior. With this algorithm, we can smooth out effect of users' random behavior, thus increase performance of the delivery network.

Paper Details

Date Published: 28 September 2006
PDF: 8 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542L (28 September 2006); doi: 10.1117/12.688278
Show Author Affiliations
Da Feng, Shanghai Jiao Tong Univ. (China)
Weiqiang Sun, Shanghai Jiao Tong Univ. (China)
Yaohui Jin, Shanghai Jiao Tong Univ. (China)
Weisheng Hu, Shanghai Jiao Tong Univ. (China)
Wei Guo, Shanghai Jiao Tong Univ. (China)

Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?