• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Duan Hancong, Lu Xianliang, Tang Hui, Zhou Xu, Zhao Zhijun. Topology-Aware Node Rendezvous Algorithm Based on DHT[J]. Journal of Computer Research and Development, 2007, 44(9): 1557-1565.
Citation: Duan Hancong, Lu Xianliang, Tang Hui, Zhou Xu, Zhao Zhijun. Topology-Aware Node Rendezvous Algorithm Based on DHT[J]. Journal of Computer Research and Development, 2007, 44(9): 1557-1565.

Topology-Aware Node Rendezvous Algorithm Based on DHT

More Information
  • Published Date: September 14, 2007
  • In the peer-to-peer application models such as file sharing, media streaming and cooperative computing, nodes communicate by unicast and construct overlay networks. As overlay networks is usually built on top of existing substrate network, random joining of nodes will lead to topology mismatching, which will not only increase the communication delay between end nodes but also make a heavy bandwidth pressure on the substrate network. Current topology-matching algorithms suffer low scalability and long clustering delays. Proposed in this paper is a novel distributed topology-aware node rendezvous algorithm (TANRA) based on network coordinates and distributed hash table (DHT). In TANRA, firstly, 2-dimension network coordinates space of nodes is partitioned into many sectors which have the same area by means of using a cluster of concentric circles. Secondly, every sector is mapped to a unique region in the multi-layer name space of DHT based on thegeographic information in 2-dimension network coordinates space. Finally, the nodes can be clustered with its near neighbors in substrate network by calling two primitives of DHT, Put()/Get(), as the proximity between nodes is kept. The simulation results show that TANRA can efficiently provide the topology matching for upper applications with lower joining delay under a large number of end nodes.
  • Related Articles

    [1]He Xin, Gui Xiaolin, An Jian. A Distributed Area Coverage Algorithm Based on Delayed Awakening in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2011, 48(5): 786-792.
    [2]Xu Jia, Feng Dengguo, Su Purui. Research on Network-Warning Model Based on Dynamic Peer-to-Peer Overlay Hierarchy[J]. Journal of Computer Research and Development, 2010, 47(9): 1574-1586.
    [3]Xiong Wei, Xie Dongqing, Jiao Bingwang, Liu Jie. A Structured Peer to Peer File Sharing Model with Non-DHT Searching Algorithm[J]. Journal of Computer Research and Development, 2009, 46(3): 415-424.
    [4]Li Xiaolong, Lin Yaping, Hu Yupeng, Liu Yonghe. A Subset-Based Coverage-Preserving Distributed Scheduling Algorithm[J]. Journal of Computer Research and Development, 2008, 45(1): 180-187.
    [5]Hu Jinfeng, Hong Chunhui, Zheng Weimin. Granary: An Architecture of Object Oriented Internet Storage Service[J]. Journal of Computer Research and Development, 2007, 44(6): 1071-1079.
    [6]Zhang Sanfeng and Wu Guoxin. A Fault-Tolerant Asymmetric DHT Method Towards Dynamic and Heterogeneous Network[J]. Journal of Computer Research and Development, 2007, 44(6): 905-913.
    [7]Cao Jia, Lu Shiwen. Research on Topology Discovery in the Overlay Multicast[J]. Journal of Computer Research and Development, 2006, 43(5): 784-790.
    [8]Mao Yingchi, Liu Ming, Chen Lijun, Chen Daoxu, Xie Li. A Distributed Energy-Efficient Location-Independent Coverage Protocol in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2006, 43(2): 187-195.
    [9]Wen Yingyou, Zhao Jianli, Zhao Linliang, and Wang Guangxing. A Study of the Relationship Between Performance of Topology-Based MANET Routing Protocol and Network Coverage Density[J]. Journal of Computer Research and Development, 2005, 42(4): 684-689.
    [10]Zhou Jin and Li Yanda. A Peer-to-Peer DHT Algorithm Based on Small-World Network[J]. Journal of Computer Research and Development, 2005, 42(1): 109-117.

Catalog

    Article views (876) PDF downloads (618) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return