JOURNAL OF NETWORKS (JNW)
ISSN : 1796-2056
Volume : 4    Issue : 2    Date : April 2009

A Self-organized Clustering-based Overlay Network for Application Level Multicast
Khaled Ragab and Akinori Yonezawa
Page(s): 85-91
Full Text:
PDF (210 KB)


Abstract
Peer-to-Peer Overlay networks enabling an end-end application level-multicast service have drawn
enormous attention. This paper proposes a self-organized <δ, μ>-Multicast Overlay Network (<δ, μ>-
MON) that enables an efficient end-end application level multicast. The <δ, μ>-MON is organized
into MON-Clusters, where δ is the maximum physical number of hops between any two end-nodes
in each MON-Cluster. Thus, end-users accessing from different areas are able to broadcast data
into each MON-Cluster within a constant δ physical number of hops. However in a dense-mode,
increasing the size of MON-Clusters induces a long logical diameter that manifests high stress per
physical links and high delay to disseminate data. Thus, this paper limits the expansion of each
MON-Cluster within a specific logical diameter μ. Each MON-Cluster is constructed with at most μ
logical hops over δ physical hops. Thus, end-users are able to efficiently disseminate data into
each MON-Cluster within μ logical hops over δ physical hops with reasonable stress per physical
links and bandwidth consumption.

Index Terms
Network Services and Applications, Application level-multicast, Peer-to-Peer Overlay Network.