UM
An end host multicast protocol for peer-to-peer networks
Tu W.; Jia W.
2005-12-01
Source PublicationProceedings - Conference on Local Computer Networks, LCN
Volume2005
Pages392-399
AbstractThis paper presents a novel end host multicast protocol (DSM) on top of the mesh overlays for P2P networks. Unlike the previous schemes, the major feature of DSM is that it does not need a multicast tree for routing the multicast messages. DSM can implement the scalable and efficient multicast communications in a fully distributed way and consists of the following algorithms: 1. cluster formation that forms the group into clusters and each cluster consists of a small number of members; 2. cluster core selection that selects a core for each cluster who has the minimum sum of overlay hops to all other cluster members; 3. multicast routing that includes the balanced RA routing approach which enables a cluster core to construct the connections with other cores dynamically by using the rectangle area and the balanced forward flooding scheme in each cluster which evenly distributes the data traffic and link stress among the links in the multicast system. Simulation results show that DSM is fully distributed, scalable and efficient as compared with some well-known end host multicast systems. © 2005 IEEE.
DOI10.1109/LCN.2005.28
URLView the original
Language英語
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionUniversity of Macau
AffiliationCity University of Hong Kong
Recommended Citation
GB/T 7714
Tu W.,Jia W.. An end host multicast protocol for peer-to-peer networks[C],2005:392-399.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Tu W.]'s Articles
[Jia W.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Tu W.]'s Articles
[Jia W.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Tu W.]'s Articles
[Jia W.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.