Computer Science – Networking and Internet Architecture
Scientific paper
2010-03-17
International Journal of Computer Networks & Communications 2.2 (2010) 155-162
Computer Science
Networking and Internet Architecture
8 Pages, IJCNC Journal 2010
Scientific paper
10.5121/ijcnc.2010.2212
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly. Then a delay-constrained algorithm called DCADH (delay-constrained average distance heuristic) is presented. By using ADH a least cost multicast routing tree can be constructed; if the path delay can't meet the delay upper bound, a shortest delay path which is computed by Dijkstra algorithm will be merged into the existing multicast routing tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast routing tree.
Ling Zhou
Wei-xiong Ding
Yu-xi Zhu
No associations
LandOfFree
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-233602