A Self-organized Clustering-based Overlay Network for Application Level Multicast

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.

[1]  M. Rosenfeld.  Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs , 1989 .

[2]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[3]  Kinji Mori,et al.  ACIS-Hierarchy: Enhancing Community Communication Delay for Large-Scale Information Systems , 2004 .

[4]  Kinji Mori,et al.  Autonomous decentralized community communication for information dissemination , 2004, IEEE Internet Computing.

[5]  Bill Jackson,et al.  Hamilton Cycles in 2-Connected Regular Bipartite Graphs , 1994, J. Comb. Theory, Ser. B.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[7]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[8]  D. Zeinalipour-Yazti,et al.  Information retrieval techniques for peer-to-peer networks , 2004, Computing in Science & Engineering.

[9]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Khaled Ahmed.  Autonomous decentralized community communication technology for assuring information dissemination , 2004 .

[11]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[12]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[13]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[14]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[15]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[16]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[17]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[18]  Stephen Deering,et al.  Multicast routing in a datagram internetwork , 1992 .

[19]  Eric Brewer,et al.  Scattercast: an architecture for internet broadcast distribution as an infrastructure service , 2000 .

[20]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[21]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[22]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[23]  Branko Grünbaum,et al.  Pairs of edge-disjoint Hamiltonian circuits , 1975 .

[24]  M -.  Estimating Aggregates on a Peer-to-Peer Network , 2003 .

[25]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.