한국정보처리학회논문지 (The Transactions of the Korea Information Processing Society)

한국정보처리학회 (Korea Information Processing Society)
권호 표지

분산 디렉토리 시스템에서의 원격 질의에 대한 캐싱 기법

A Caching Mechanism for Remote Queries in Distributed Directory Systems

  • 이강우 (서남대학교 컴퓨터정보통신학부)
  • 발행 : 2000.01.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 분산 디렉토리 시스템에서 질의 처리 속도를 향상시키기 위하여 원격지의 객체에 대한 질의와 결과를 요청지의 캐시에 저장하는 캐싱 메카니즘을 제안한다. 이를 위하여 첫째, 분산 디렉토리 시스템에 저장되는 캐시 정보를 응용 데이터 정보, 시스템 데이터 정보로 분류하고, 분류된 캐시 정보를 기반으로 캐시 시스템 구조를 설계하였다. 둘째, 각각의 캐시에 대한 거리 정보와 접근 회수를 가중치로 부여한 최소-TTL 대체 기법을 개발하였다. 마지막으로 제안된 캐시 기법과 타 기법(LRU, LFU 대체 기법)에 대하여 성능 평가를 수행하여 제안된 기법이 LRU 기법 보다 25%의 성능향상을 보였으며, LFU 기법보다는 30%의 성능향상 결과를 보였다.

In this paper, for improving the speed of query processing on distributed directory system, we proposed a caching mechanism which is store the queries and their on the remote site objects in the cache of local site. For this, first, cached information which is stored in distributed directory systems is classified as application data and system data. And cache system architecture is designed according to classified information. Second least-TTL replacement mechanism which uses the weighted value of geographical information and access frequency for replacements are developed for each cache. Finally, performance evaluations are performed by comparing the proposed caching mechanism and other mechanisms (LRU, LFU replacement). Our least-TTL mechanism shows a performance improvement of 25% over the LRU and that of 30% over LFU.

키워드

참고문헌

  1. R. Alonso, D. Barbara, H. Garcia-molina, Data Caching Issues in an Information Retrieval System, ACM Transactions on Database Systems. Vol.15, No.3, Sept. 1900, pp.359-384 https://doi.org/10.1145/88636.87848
  2. Matthew Addison Blaze, Caching in Large-Scale Distributed File Systems, Ph.D. Thesis, University of Princeton, January 1993
  3. Jean-Chrysostome Bolot, Hossam Afifi, Evaluating Caching Schemes for the X.500 Directory System, The 13th International Conference on Distributed Computing Systems, Pittsburgh, Pennsylvania, May 25-28, 1993, pp.112-119 https://doi.org/10.1109/ICDCS.1993.287717
  4. James Gwertzman, Autonomous Replication in Wide-Area Internetworks, Ph.D. Thesis, University of Harvard, April 1995
  5. J. H. Hartman, Using the Sprite File System Trace, Berkeley University, 1993
  6. ITU, The Directory: Recommendations X.500, X,501, X.509, X.511, X.518, X.519, X.520, X.521, X.525, ITU Blue Book, 1991
  7. K. W. Lee, J. H. Lee, H. C. Lim, A Cache Mechanism for Distributed Directory System, Proceedings of the 22 KISS Fail Conference, Vol.23, pp.213-216, 10. 1996
  8. B. Clifford Neuman, Scale in Distributed Systems, Readings in Distributed Computing Systems, IEEE Computer Society Press, 1994
  9. Ordille, J. J. Descriptive Name Services for Large Intemets, Ph.D. Thesis, University of Wisconsin, Nov. 1993
  10. D. B. Terry, Caching Hints in Distributed Systems, IEEE Transactions on Software Engineering, Vol.SE-13, No.1, Jan. 1987 https://doi.org/10.1109/TSE.1987.232834
  11. Brent Ballinger Welch, Naming, State Management, and User-Level Extensions in the Sprite Distributed File System, Ph.D. Thesis, University of California at Berkeley, 1990
  12. Craig Hunt, TCP/IP Network Administration, O'Reily & Associates, Inc. 1992