Research on Topology Discovery in the Overlay Multicast

Cao Jia; Lu Shiwen

Journal of Computer Research and Development > 2006 > 43(5): 784-790.

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.

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.

PDF (380 KB)

Research on Topology Discovery in the Overlay Multicast

Cao Jia^1,2,
Lu Shiwen¹

1(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080) 2(Graduate University of Chinese Academy of Sciences, Beijing 100080)

More Information

Published Date: May 14, 2006

Graphical Abstract

Abstract

Abstract

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.
- random directed graph,
- overlay multicast,
- topology discovery,
- connectivity

FullText(HTML)

References (0)

[1]	Li Yuan, Yang Sen, Sun Jing, Zhao Huiqun, Wang Guoren. Influential Cohesive Subgraph Discovery Algorithm in Dual Networks[J]. Journal of Computer Research and Development, 2023, 60(9): 2096-2114. DOI: 10.7544/issn1000-1239.202220337
[2]	Li Xin, Liu Guiquan, Li Lin, Wu Zongda, Ding Junmei. Circle-Based and Social Connection Embedded Recommendation in LBSN[J]. Journal of Computer Research and Development, 2017, 54(2): 394-404. DOI: 10.7544/issn1000-1239.2017.20150788
[3]	Yuan Xinpan, Long Jun, Zhang Zuping, Luo Yueyi, Zhang Hao, and Gui Weihua. Connected Bit Minwise Hashing[J]. Journal of Computer Research and Development, 2013, 50(4): 883-890.
[4]	Jiao Jian, Yao Shan, Li Xiaojian. Research on Network Bidirectional Topology Discovery Based on Measurer by Spreading[J]. Journal of Computer Research and Development, 2010, 47(5): 903-910.
[5]	Jin Xin, Xiong Yan, Li Min, and Yue Lihua. A Connectible-Cell Based Topology Control Algorithm for Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2008, 45(2): 217-226.
[6]	Liu Wei, Cui Li, Huang Changcheng. EasiFCCT：A Fractional Coverage Algorithm for Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2008, 45(1): 196-204.
[7]	Yang Liu, Li Zhenyu, Zhang Dafang, Xie Gaogang. Topology Discovery with Smallest-Redundancy in IPv6[J]. Journal of Computer Research and Development, 2007, 44(6): 939-946.
[8]	Sun Yantao, Shi Zhiqiang, Wu Zhimei. Automatic Discovery of Physical Topology in Switched Ethernets[J]. Journal of Computer Research and Development, 2007, 44(2): 208-215.
[9]	Zhu Pengfei, Dai Yingxia, and Bao Xuhua. PKI-Based Mutual Connections Constrained with Discrepancy of Trust Domains[J]. Journal of Computer Research and Development, 2006, 43(10): 1804-1809.
[10]	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.