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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.