C2: A new overlay network based on can and chord

Wenyuan Cai, Shuigeng Zhou, Linhao Xu, Weining Qian, Aoying Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

In this paper, we present C2, a new overlay network based on CAN and Chord. For an n-peer C2 system, each peer maintains only about O(log n) other peers’ information, and achieves routing within O(log n) hops. For each peer’s join or departure, C2 can update the routing table within O(log n) messages with high probability. What distinguish C2 from many other peer-to-peer data-sharing systems are its low computation cost and high routing efficiency in dynamic environment. In the case that considerable peers fail simultaneously (i. e., quite a lot other peers’ routing tables are out of date), the average hop number of successful routings does not increase obviously.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMinglu Li, Qianni Deng, Xian-He Sun, Jun Ni
PublisherSpringer Verlag
Pages42-50
Number of pages9
ISBN (Print)3540219889, 9783540219880
DOIs
StatePublished - 2004
Externally publishedYes
Event2nd International Workshop on Grid and Cooperative Computing, GCC 2003 - Shanhai, China
Duration: 7 Dec 200310 Dec 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3032
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Grid and Cooperative Computing, GCC 2003
Country/TerritoryChina
CityShanhai
Period7/12/0310/12/03

Fingerprint

Dive into the research topics of 'C2: A new overlay network based on can and chord'. Together they form a unique fingerprint.

Cite this