| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] |
¡@
Ching-Wei Huang and Wuu Yang
Department of Computer Science
National Chiao Tung University
Hsinchu, 300 Taiwan
E-mail: {rollaned; wuuyang}@sp.cis.nctu.edu.tw
Peer-to-peer systems have become one of the most popular Internet applications.
Some unstructured systems such Gnutella perform file searching by flooding requests
among nodes. It has been proven that such unstructured systems are not scalable, and
searching consumes tremendous bandwidth. We propose three mechanisms to reconstruct
the system topology and improve message flooding. Our research addresses four aspects:
system topology control, message routing, message locality, and system connectedness.
The simulation shows that significant redundancy in flooding of messages can be eliminated
and message locality achieves a high ratio.
Received June 3, 2004; revised September 10, 2004; accepted October 26, 2004.
Communicated by Ten-Hwang Lai.