| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] |
¡@
Tein-Yaw Chung+, Yang-Hui Chang, Kun-Hung Chen and Yung-Mu Chen
Department of Computer Science and Engineering
Yuan Ze University
Chungli, 320 Taiwan
+E-mail: csdchung@netlab.cse.yzu.edu.tw
Many existing studies in overlay networking have focused on resource discovery or
server selection. This work studies the integrated performance of peer-to-peer (P2P) file
sharing systems using location-aware resource discovery and service scheduling
schemes. A novel file capacity amplification (FCA) model is first presented to capture
the problem of the file distribution problem. Then two novel service scheduling schemes
and protocols, Capacity Amplification (CA) and its variant CA with Penetration (CAP),
are presented to enhance the performance of file distribution in overlay networks. The
CA scheme represents a greedy approach in selecting clients for services disregarding
the effect of delay latency on transport capacity. The CAP scheme, on the other hand,
adopts the semantics of small world networks to reduce effectively delay latency among
peer servers and clients. Consequently, the effective transport capacity can be increased
efficiently leading to fast file distribution. The analytical results indicate that traditional
scheduling schemes such as FCFS perform poorly compared with CA and CAP schemes.
Furthermore, a high-performance P2P file distribution system needs both an efficient resource
recovery scheme and a good service scheduling scheme.
Received July 4, 2007; revised December 3, 2007 & April 16, 2008; accepted June 5, 2008.
Communicated by Chung-Ta King.
* This work was supported in part by the National Science Council of Taiwan, R.O.C. under grant No. NSC
96-2221-E-155-033.