Please use this identifier to cite or link to this item:
|Title:||DINCast: Optimizing application-level shared-tree multicast||Authors:||Guo, H.
Heng Ngoh, L.
|Keywords:||Application level multicast
Shared- tree multicast
|Issue Date:||2009||Citation:||Guo, H., Heng Ngoh, L., Wong, W.C., Yang, P., Beevi, N. (2009). DINCast: Optimizing application-level shared-tree multicast. Proceedings - International Conference on Advanced Information Networking and Applications, AINA : 270-277. ScholarBank@NUS Repository. https://doi.org/10.1109/AINA.2009.57||Abstract:||Application-level multicast suffers some disadvantages in terms of high multicast delay, overloading at Rendezvous Point (RP) and single-point of failure. In this paper, we propose DINCast to optimize application-level shared-tree multicast. The general idea of DINCast is to form a special logical data loop and use this loop instead of the RP as multicast sources. To demonstrate its effectiveness, we first analyze multicast delay with the inclusion of transmission delay, queuing delay and propagation delay of a typical symmetrical shared-tree multicast. We evaluate three placement schemes of DINCast. Our simulation results show that DINCast is effective in optimizing the multicast delay over the shared-tree multicast and the reduced rate of multicast delay may be up to 50%. Next, for any multicast tree, we carry out further simulations to optimize multicast delay. The experimental results show that DINCast can achieve better performance than original shared-tree Multicast. © 2009 IEEE.||Source Title:||Proceedings - International Conference on Advanced Information Networking and Applications, AINA||URI:||http://scholarbank.nus.edu.sg/handle/10635/69952||ISBN:||9780769536385||ISSN:||1550445X||DOI:||10.1109/AINA.2009.57|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 16, 2019
checked on May 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.