Summary: | 碩士 === 國立中央大學 === 通訊工程研究所 === 98 === This paper proposes a hierarchical cluster-based peer-to-peer overlay scheme which is not only scalable to tremendous peer population, but also sustainable to high network dynamics in a large-scale network environment. This scheme is based on both partially-centralized and semi-structured overlay models by exploiting network locality and proximity. This joint design can keep up system efficacy and flexibility in dynamic network environments where several issues, peer churn, peer mobility, search redundancy and traffic overhead become stickier. In addition, reputation notion is integrated
to mitigate the free-riding problem. According to special reputation tree hierarchy, the process of peer clustering elegantly operates cluster division and union to adjust the overall cluster hierarchy so as to somewhat moderate unfair or imbalanced resource utilization over the large-scale system. Furthermore, the hierarchical overlay is resilient to any single point of failure at any cluster. A tie-in process is able to link up the broken paths automatically. Therefore, our effort results in a robust,
efficient hierarchical overlay in dynamic peer-to-peer networks. By simulation results, the proposed scheme can react to above issues without compromise of prominent performance.
|