SHIPS: A Service History Based Peer Selection in Peer-to-Peer Networks
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 97 === Peer-to-peer applications require an accurate technique to identify the high-performance peers which can provide a requested bandwidth. Existing approaches resort to measurements of network paths to determine the current available bandwidth for a given connect...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/03422817802989310697 |
| Summary: | 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 97 === Peer-to-peer applications require an accurate technique to identify the high-performance peers which can provide a requested bandwidth. Existing approaches resort to measurements of network paths to determine the current available bandwidth for a given connection, but ignore the past bandwidth situation. In this paper, we propose a novel approach that considers the past service quality and the current workload of a peer to predict the probability of a requested bandwidth being available in the near future. Combined with the information of network latencies, close peers with high predicted probabilities will be chosen to be the data providers. Our preliminary simulation results show the high accuracy and efficiency of our prediction approach.
|
|---|