A Directed-Multicast Routing Approach with Path Replication in Content Addressable Network

Author

Shen, Wenbo ; Zhang, Weizhe ; Zhang, HongLi ; He, Hui

Author_Institution

Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China

fYear

2010

fDate

26-28 Feb. 2010

Firstpage

37

Lastpage

41

Abstract

In order to improve the efficiency of routing and resource location under large scale failure of Content Addressable Network, a directed-multicast routing approach is proposed to solve the backtrack problem of the traditional greedy approach. Possessing the advantages of directed routing approach and multicast, this new approach also has an extending coefficient to increase its feasibility. Meanwhile, we explore a new replication approach that we term Path Replication. Combining with Path Replication, the directed-multicast routing approach is more efficient in routing process. The efficiency of directed-multicast routing was proved in the simulations on PlanetSim.

Keywords

greedy algorithms; multicast communication; peer-to-peer computing; telecommunication network routing; Content Addressable Network; PlanetSim simulation; backtrack problem; directed-multicast routing approach; greedy approach; path replication; Bandwidth; Broadcasting; Computational modeling; Computer science; Distributed computing; Helium; Large-scale systems; Multicast algorithms; Peer to peer computing; Routing; Content Addressable Network; Path Replication; directed multicast; routing algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Software and Networks, 2010. ICCSN '10. Second International Conference on

Conference_Location

Singapore

Print_ISBN

978-1-4244-5726-7

Electronic_ISBN

978-1-4244-5727-4

Type

conf

DOI

10.1109/ICCSN.2010.8

Filename

5437638