C²: a new overlay network based on CAN and Chord
by Wenyuan Cai, Shuigeng Zhou, Weining Qian, Linhao Xu, Kian-Lee Tan, Aoying Zhou
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 4, 2005

Abstract: In this paper, we present C², a new overlay network based on CAN and Chord. It is primarily designed for a dynamic environment in which peers join and depart the network frequently. For an n-peers C² system, each peer maintains only about O(log n) of other peers' information, and achieves routing within O(log n) hops. For each peer's joining or departure, C can, in high probability, update the routing tables with no more than O(log n) messages. What distinguishes C² from many other peer-to-peer data sharing systems is its low computation cost and its high routing efficiency in a dynamic network. Even in the case that a considerable number of peers fail simultaneously, i.e., several other peers' routing tables are out of date, the average number of hops for successful routing remains acceptable.

Online publication date: Fri, 30-Dec-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com