Network robustness and graph topology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Autonomous Decentralized Community Communication for Information Dissemination
IEEE Internet Computing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
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 d 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 d 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 m. Each MON-Cluster is constructed with at most m logical hops over d physical hops. Thus, end-users are able to efficiently disseminate data into each MON-Cluster within m logical hops over d physical hops with reasonable stress per physical links and bandwidth consumption.