Loading [MathJax]/extensions/MathMenu.js
Comparative study on overlay multicast routing algorithms' design methods | IEEE Conference Publication | IEEE Xplore

Comparative study on overlay multicast routing algorithms' design methods


Abstract:

Compared with IP multicast, overlay multicast has obvious advantages in terms of deployment, but usually consumes more underlying network resources. In this paper, we pre...Show More

Abstract:

Compared with IP multicast, overlay multicast has obvious advantages in terms of deployment, but usually consumes more underlying network resources. In this paper, we present a comparative study on some existing typical overlay multicast routing algorithms. According to the graph models of basic overlay networks that overlay multicast delivery structures are constructed from these routing algorithms can be divided into three categories, namely: based on complete graph, based on mesh, and based on partial tree. We compared some typical routing algorithms of the three categories in many aspects through simulation at the same underlying physical network conditions and got some useful study results which can provide beneficial guidance and help to build network applications that depend on overlay multicast.
Date of Conference: 08-11 July 2014
Date Added to IEEE Xplore: 14 August 2014
Electronic ISBN:978-1-4799-3494-2

ISSN Information:

Conference Location: Shanghai, China

References

References is not available for this document.