Article Abstract

	Title:	C2: a new overlay network based on CAN and Chord
	Author:	Wenyuan Cai, Shuigeng Zhou, Weining Qian, Linhao Xu, Kian-Lee Tan, Aoying Zhou
	Address:	Department of Computer Science and Engineering, Fudan University, 220 Handan Road, 200433 Shanghai, China. ' Department of Computer Science and Engineering, Fudan University, 220 Handan Road, 200433 Shanghai, China. ' Department of Computer Science and Engineering, Fudan University, 220 Handan Road, 200433 Shanghai, China. ' Department of Computer Science and Engineering, Fudan University, 220 Handan Road, 200433 Shanghai, China. ' Department of Computer Science, School of Computing, National University of Singapore, Singapore.' Department of Computer Science and Engineering, Fudan University, 220 Handan Road, 200433 Shanghai, China
	Journal:	International Journal of High Performance Computing and Networking 2005 - Vol. 3, No.4  pp. 248 - 261
	Abstract:	In this paper, we present C2, 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 C2 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 C2 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.
	Keywords:	distributed computing; peer-to-peer computing; P2P networks; overlay networks; Chord; CAN; data sharing; routing efficiency; fault tolerance.
	DOI:	10.1504/IJHPCN.2005.008567
		Purchase this Paper         Comment on the Paper