| Summary: | 碩士 === 國立交通大學 === 資訊科學與工程研究所 === 100 === As network bandwidth increases quickly and Internet service becomes popular, more and more network applications use peer-to-peer model (i.e. P2P network) model to provide services. Comparing to earlier client-server model, every P2P network user can play two roles, the client and the server. Based on this model, the whole network performance could be improved significantly. As the success of P2P file-sharing and Voice over Internet Protocol (VoIP), more and more IPTV (Internet Protocol Television) employ P2P model to improve their performance, in which, there are two main approaches, tree-push and mesh-pull. The latter has already been deployed widely in the market. In recent years, the combination of these two approaches is emerging.
In traditional random approach, tracker servers will arbitrarily choose one or more peers as successor partners via standard operating procedure with the information of the departed peers, this way will significantly cost long recovery switching time (the time duration from peer leaving to the system recovery).
In this thesis, we propose a method that significantly reduces recovery switching time comparing to traditional random approach. The main idea is to choose one or more pre-defined partners as temporarily successor partners from local partnership side until it finds one or more stationary successor partners from tracker servers. The approach has a little difference between normal and irnormal mode. This approach can be applied in asymmetric network environment and to fully utilize all of the peers’ upload bandwidth instead of only those peers with high upload bandwidth. Finally, we use OMNet++ simulation tool to evaluate the performance of our approach, and the results show that our proposed method improve the quality of experience significantly.
|
|---|
