Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A Timestamp Tree-based Cache Invalidation Report Scheme in Mobile Environments

모바일 환경에서 타임스탬프 트리 기반 캐시 무효화 보고 기법

  • Published : 2007.06.15
Download PDF
⟨ Previous Next ⟩

Abstract

Frequent disconnection is connected directly to client's cache consistency problem in Mobile Computing environment. For solving cache consistency problem, research about Invalidation Report is studied. But, existent invalidation report structure comes with increase of size of invalidation report structure and decline of cache efficiency if quantity of data become much, or quantity of updated data increases. Also, while existent method confirms whole cache, invalidation report doesn't support selective listening. This paper proposes TTCI(Timestamp Tree-based Cache Invalidation scheme) as invalidation report structure that solve problem of these existing schemes and improve efficiency. We can make TTCI using timestamp of updated data, composing timestamp tree and list ID of data in updated order. If we utilize this, each client can confirm correct information in point that become own disconnecting and increase cache utilization ratio. Also, we can pare down client's resources consumption by selective listening using tree structure. We experimented in comparison with DRCI(Dual-Report Cache Invalidation) that is existent techniques to verify such efficiency of TTCI scheme.

이동 컴퓨팅(Mobile Computing)환경에서 빈번한 접속 단절은 클라이언트의 캐시 일관성(Consistency)문제로 직결된다. 이러한 캐시 일관성 문제를 해결하기 위해 무효화 보고(Invalidation Report)에 관한 연구가 진행되고 있다. 그러나 기존의 무효화 보고 기법은 서버 측의 데이타의 수가 많아지거나, 갱신(Update)되는 데이타의 양이 증가하게 되면 무효화 보고 기법의 크기의 증가 및 캐시 효율성의 저하를 가지고 온다. 또한 캐시 전체의 무효화를 확인하는 보고 기법은 선택적 청취(Selective tuning)를 지원하지 못한다. 본 논문에서는 이러한 기존 방식의 문제점을 해결하며 효율성을 개선한 무효화 보고 기법으로써 TTCI(Timestamp Tree-based Cache Invalidation scheme)를 제안한다. 갱신된 데이타의 타임스탬프를 이용하여 타임스탬프 트리를 구성하고 데이타의 아이디를 갱신된 순서대로 나열하여 무효화 보고를 만든다. 이를 활용하게 되면 각 클라이언트는 자신의 단절(Disconnect)된 시점에 맞는 정보를 확인하여 캐시의 이용률을 증가 시킬 수 있다. 또한 트리 구조를 이용하여 선택적 청취를 가능하게 함으로써 클라이언트의 자원 소비를 줄일 수 있다. 이러한 본 구조의 효율성을 검증하기 위해 기존의 기법인 DRCI(Dual-Report Cache Invalidation)와 성능비교를 실시한다.

Keywords

References

  1. T. Imielinski and B.R. Badrinath, 'Data Management for Mobile Computing,' SIGMOD RECORD, vol.22, no.1, pp. 34-39, (1993) https://doi.org/10.1145/156883.156888
  2. T. Imielinski and B.R. Badrinath, 'Wireless Mobile Computing: Challenges in Data Management,' Comm. ACM, vol.37, no.10, pp. 18-28, (1994) https://doi.org/10.1145/194313.194317
  3. J. Jing, A. Helal, and A. Elmagarmid, 'Client-Server Computing in Mobile Environments,' ACM Computing Surveys, vol.31, no.2, pp. 117-157, (1999) https://doi.org/10.1145/319806.319814
  4. K-L. Tan and B.C. Ooi, Data Dissemination in Wireless Computing Environments, Kluwer Academic, 2000
  5. G.H. Forman and J. Zahorjan, 'The Challenges of Mobile Computing,' IEEE Computer, vol.27, no.6, pp. 38-47, (1994) https://doi.org/10.1109/2.274999
  6. D. Barbara and T. Imielinski, 'Sleepers and Workaholics: Caching in Mobile Distributed Environments,' Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 1-12, (1994) https://doi.org/10.1145/191839.191844
  7. K-L. Tan, B.C. Ooi, 'An Evaluation of Cache Invalidation Strategies in Wireless Environments,' IEEE Transactions on parallel and Distributed systems, vol.12, no.8, pp. 789-807, (2001) https://doi.org/10.1109/71.946652
  8. K-L. Wu, P.S. Yun, and M.S. Chen, 'Energy-Efficient Caching For Wireless Mobile Computing,' Proc. 12th Int'l Conf. Data Eng., pp 336-343, (1996) https://doi.org/10.1109/ICDE.1996.492181
  9. J. Cai, K-L Tan, 'Energy-Efficient Selective Cache Invalidation,' Wireless Networks 5, pp. 489-502, (1999) https://doi.org/10.1023/A:1019144304789
  10. J. Jing and A.Elmagarmid and A.Helal and R. Alonso, 'Bit-Sequences : An Adaptive Cache Invalidation Method in Mobile Client/Server Environments,' ACM Mobile Networks and applications vol 2, pp. 115-127, (1997) https://doi.org/10.1023/A:1013616213333
  11. A. Elmagarmid, J. Jing, A. (Sumi) Helal, And C. Lee, 'Scalable Cache Invalidation Algorithms for Mobile Data Access,' IEEE Transactions on knowledge and data engineering, vol 15, no 6, pp. 1498-1511 (2003) https://doi.org/10.1109/TKDE.2003.1245288
  12. P.V. Argade, S. Aymeloglu, A.D. Berenbaum, M.V. DePaolis Jr.,R.T. Franzo, R.D. Freeman, D.A. Inglis, G. Komoriya, H. Lee, T.R.Little, G.A. MacDonald, H.R. Mclellan, E.C. Morgan, H.Q. Pham, G.D. Ronkin, R.J. Scavuzzo, and T.J. Woch, 'Hobbit: A High Performance, Low-Power Microprocessor,' Proc. COMPCON'93 Int'l Computer Conf., pp. 88-95, (1993) https://doi.org/10.1109/CMPCON.1993.289642
  13. D. Knuth, The Art of Computer Programming Second Edition, Vol Ⅲ, Addison Wesley, 1998
  14. G.K Zipf, Human Behaviour and the Principle of Least Effort : An Introduction to Human Ecology, Addison Wesley Press, Cambridge, Massachusetts, 1949
  15. J. Gray, P. Sundaresan, S. Englert, K. Baclawski and P. J. Weinberger, 'Quickly generating billionrecord synthetic databases,' in ACM SIGMOD Record, Proc. ACM SIGMOD international conference on Management of data, pp. 253-252, (1994) https://doi.org/10.1145/191839.191886
  16. S. Yi., W. Song, S. Jung, 'A Cost Effective Cache Consistency Method for Mobile Clients in Wireless Environments,' Database Systems for Advanced Applications, LNCS 2973, pp. 908-915, 2004
  17. S. Yi., H. Shin, S. Jung, 'Enhanced Cost Effective Cache Invalidation for Mobile Clients in Stateless Server Environments,' Embedded and Ubiquitous Computing, LNCS 3207, pp. 387-397, 2004