Advanced Search
    Cao Jia, Lu Shiwen. Research on Topology Discovery in the Overlay Multicast[J]. Journal of Computer Research and Development, 2006, 43(5): 784-790.
    Citation: Cao Jia, Lu Shiwen. Research on Topology Discovery in the Overlay Multicast[J]. Journal of Computer Research and Development, 2006, 43(5): 784-790.

    Research on Topology Discovery in the Overlay Multicast

    More Information
    • Published Date: May 14, 2006
    • In the overlay multicast, hosts perform the topology discovery and build multicast tree by themselves. This may ruthlessly wastes network resources if the overlay paths mismatch the underlay paths. Otherwise, it will be improved. In this paper, an active topology discovery method based on the random directed graph is analyzed. It is shown that if each node chooses Θ(logn) nodes randomly to test, the topology will be non-strong connective, and if each node chooses 2.997×n\-\{0.5312\} nodes randomly to test, the length from the source host to any hosts will be at most two times the length of directed unicast path. The simulations show that the path will not be improved obviously with the increase of k value, after the k reaches a certain value.
    • Related Articles

      [1]Xie Qin, Zhang Qinghua, Wang Guoyin. An Adaptive Three-way Spam Filter with Similarity Measure[J]. Journal of Computer Research and Development, 2019, 56(11): 2410-2423. DOI: 10.7544/issn1000-1239.2019.20180793
      [2]Song Jinfeng, Wen Lijie, Wang Jianmin. A Similarity Measure for Process Models Based on Task Occurrence Relations[J]. Journal of Computer Research and Development, 2017, 54(4): 832-843. DOI: 10.7544/issn1000-1239.2017.20151176
      [3]Zhao Yongwei, Zhou Yuan, Li Bicheng. Object Retrieval Based on Enhanced Dictionary and Spatially-Constrained Similarity Measurement[J]. Journal of Computer Research and Development, 2016, 53(5): 1043-1052. DOI: 10.7544/issn1000-1239.2016.20150070
      [4]Wang Shaopeng, Wen Yingyou, Zhao Hong. Similarity Query Processing Algorithm over Data Stream Based on LCSS[J]. Journal of Computer Research and Development, 2015, 52(9): 1976-1991. DOI: 10.7544/issn1000-1239.2015.20140479
      [5]Xiao Yu and Yu Jian. A Weighted Self Adaptive Similarity Measure[J]. Journal of Computer Research and Development, 2013, 50(9): 1876-1882.
      [6]Shen Qingni, Du Hong, Wen Han, Qing Sihan. A Data Sealing Approach Based on Integrity Measurement Architecture[J]. Journal of Computer Research and Development, 2012, 49(1): 210-216.
      [7]Zhu Yangyong, Dai Dongbo, and Xiong Yun. A Survey of the Research on Similarity Query Technique of Sequence Data[J]. Journal of Computer Research and Development, 2010, 47(2): 264-276.
      [8]Xing Chunxiao, Gao Fengrong, Zhan Sinan, Zhou Lizhu. A Collaborative Filtering Recommendation Algorithm Incorporated with User Interest Change[J]. Journal of Computer Research and Development, 2007, 44(2): 296-301.
      [9]Liu Bing, Yan Heping, Duan Jiangjiao, Wang Wei, and Shi Baile. A Bottom-Up Distance-Based Index Tree for Metric Space[J]. Journal of Computer Research and Development, 2006, 43(9): 1651-1657.
      [10]Xiu Yu, Wang Shitong, Wu Xisheng, Hu Dewen. The Directional Similarity-Based Clustering Method DSCM[J]. Journal of Computer Research and Development, 2006, 43(8): 1425-1431.

    Catalog

      Article views (829) PDF downloads (506) Cited by()

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return