Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Multicast Routing by Multiple Tree Routes

Koohyun ParkContact Information, Yong-Sik Shin 6 and Hyun-Chan Lee Contact Information

(5)  Hong-Ik University, Sangsu-dong 72-1, 121-791 Mapo-gu, Seoul, Republic of Korea
(6)  SK Telecom R & D Center, Sunae-dong 9-1, Bundang-gu, Sungnam-si, Kyunggi-do, Republic of Korea
Abstract
A solution to reduce the cost of multicast paths is presented, where the traffic is split over multiple paths to obtain an overall lower cost. Optimal conditions for this split operation are provided and two different algorithms are presented. The methods were shown to work on problems with many different types of simultaneous multicast traffic. Various experiments were conducted and the results showed that the new multicasting was fairly effective on the end-to-end quality of services.
This research was supported by Brain Korea 21 grant.

Contact Information Koohyun Park
Email: khpark@wow.hongik.ac.kr

Contact Information Hyun-Chan Lee
Email: hclee@wow.hongik.ac.kr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.107 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)