摘要
With the IPv4 addresses exhausting and IPv6 emerging, the Peer-to-Peer (P2P) overlay is becoming increasingly heterogeneous and complex: pure IPv4, dual stack and pure IPv6 hosts coexist, and the connectivity limitation between IPv4 and IPv6 hosts requires the overlay protocols to be fit for this hybrid situation. This paper sets out to answer the question of how to construct multicast tree on top of IPv4-IPv6 hybrid network. Our solution is a New Greedy Algorithm (NGA) which eliminates the problem of joining failure in the hybrid network and keeps the efficiency of greedy algorithm in tree construction. Simulation results show that our algorithm has excellent performance, which is very close to the optimal in many cases.
With the IPv4 addresses exhausting and IPv6 emerging, the Peer-to-Peer （P2P） overlay is becoming increasingly heterogeneous and complex： pure IPv4, dual stack and pure IPv6 hosts coexist, and the connectivity limitation between IPv4 and IPv6 hosts requires the overlay protocols to be fit for this hybrid situation. This paper sets out to answer the question of how to construct multicast tree on top of IPv4-IPv6 hybrid network. Our solution is a New Greedy Algorithm （NGA） which eliminates the problem of joining failure in the hybrid network and keeps the efficiency of greedy algorithm in tree construction. Simulation results show that our algorithm has excellent performance, which is very close to the optimal in many cases.
基金
Supported by National Basic Research Program of China (973 Program)(No. 2007CB310806)
National Key Tech-nology R&D program (No. 2008BAH37B07)
National Natural Science Foundation of China (No. 60703053)
