Abstract Peer-to-Peer Overlay networks enabling an end-end application level-multicast service have drawn enormous attention. This paper proposes a self- organized <delta,mu >-Multicast Overlay Network (<delta,mu >-MON) that enables an efficient end-end application level multicast. The <delta,mu >-MON is organized into MON- Clusters, where delta 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 delta 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 mu. Each MON-Cluster is constructed with at most logical hops over delta physical hops. Thus, end-users are able to efficiently disseminate data into each MON-Cluster within mu logical hops over delta physical hops with reasonable stress per physical links and bandwidth consumption.
[1]
Kinji Mori,et al.
Autonomous decentralized community communication for information dissemination
,
2004,
IEEE Internet Computing.
[2]
Bill Jackson,et al.
Hamilton Cycles in 2-Connected Regular Bipartite Graphs
,
1994,
J. Comb. Theory, Ser. B.
[3]
Gordon F. Royle,et al.
Algebraic Graph Theory
,
2001,
Graduate texts in mathematics.
[4]
Ellen W. Zegura,et al.
How to model an internetwork
,
1996,
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[5]
M -.
Estimating Aggregates on a Peer-to-Peer Network
,
2003
.
[6]
Anthony H. Dekker,et al.
Network Robustness and Graph Topology
,
2004,
ACSC.