With the development ofthe peer-to-peer technology, a lot of lookup protocols have come out. Although we can benefit from different protocols separately, our research shows that given a proper model, most of the seemingly different protocols can be classified to a same framework. Since the essence of P2P lookup protocol is to find a specific node from network, some classic lookup arithmetic models can be naturally considered. In this paper, we firstly introduce the binary tree model to analyze some popular P2P lookup protocols, then give an improved Chord arithmetic based on the binary tree.
We propose a application level multicast approach, Hierarchical Topologv Grouping (HTG). which exploits high level topologv and IP address allocation infirmation to build efficient overlay networks in a hierarchical topologv. The topologv is based on the underlying physical networks. The host in HTG uses the IP sddress posifion data to locate its appropriate domain, and uses the backbone roadmap to build the virtual links to connecf the domains. All inter-domain connecfions are done without so much excessive measure traflc as other application level multicast approaches do. The characteristic of HTG make it suitable for multi-source multicast naturally. We compare the HTG approach with fhe ESM and TAG approaches in a vane@ of simulation scenarios, including generated fopologies and real Internet topology. Our results indicate the effectiveness of HTG in reducing measure traflc and transmif delay with reasonable calculation complexities.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.