| Summary: | 碩士 === 國立臺灣科技大學 === 電子工程系 === 97 === Without considering the controversial issue such as copyright, file sharing is the most popular application in a Peer-to-Peer (P2P) network. Piece-based file sharing is an intuitive way to speed up the sharing process in a P2P network, such as the BT P2P network, and Rarest Piece First (RPF) is the most common way to distribute file pieces. As heterogeneous networks have been fast developing, the transmission conditions among nodes therefore become diversified. In the past, few studies had ever been made about how to more efficiently distribute the file pieces based on the transmission conditions among nodes. In the study, we propose two improved algorithms - (a) RPF with a Shortest Transmission Time (STT) requesting node first and (b) A STT requesting node first with RPF to solve this problem. The simulation results show that our proposed schemes can perform better than RPF in a heterogeneous network environment.
|
|---|
