Earticle

초록

영어

In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although this could cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of a level-1 cache and a level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so as to manage both static and dynamic data in a space-efficient manner: static data indicate popular pages which are frequently requested by many users and dynamic data indicate pages which may not be popular but are repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces network traffic and exhibits a high hit rate even in small cache sizes.

목차

Abstract
 I. INTRODUCTION
 II. RELATED WORK
  A. Super-Peer Architecture
  B. Query Log Analyses
  C. Result Caching
 III. PROPOSED SCHEME
  A. Overview
  B. Level 1 Cache
  C. Level 2 Cache
 IV. PERFORMANCE EVALUATION
  A. Simulation Set-up
  B. Traffic
  C. Hit Rate
  D. Ratio of Partition
 V. CONCLUDING REMARKS
 References

키워드

저자

• Qiying WEI [ Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, Japan. ]
• Tingting QIN [ Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, Japan. ]
• Satoshi FUJITA [ Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, Japan. ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  JoC [Journal of Convergence]

• 간기

  계간

• pISSN

  2093-7741

• eISSN

  2093-775X

• 수록기간

  2010~2015

• 십진분류

  KDC 004 DDC 004