簡易檢索 / 詳目顯示

研究生: 洪銘鴻
Horng, Ming-Horng
論文名稱: 在Web-based無線網路環境下具有省能源的快取無效機制
Web-based Energy-efficient Cache Invalidation for Wireless Mobile Environment
指導教授: 張燕光
Chang, Yeim-Kuan
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2004
畢業學年度: 92
語文別: 英文
論文頁數: 67
中文關鍵詞: 一致性無效驗證行動裝置延遲動態網頁快取
外文關鍵詞: caching, consistency, invalidation report, latency, mobile host, dynamic web pages
相關次數: 點閱:98下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   近年來,動態網頁的興起,使得伺服器之工作量增加,快取伺服器通常把動態產生的網頁設定成不快取,為了要得到即時的網頁,用戶端每次都需要把請求送到網頁伺服器。並且隨著無線網路的蓬勃發展,越來越多人透過行動裝置取得動態網頁,因為行動裝置電源的限制,在行動裝置端快取動態網頁變的越來越重要了。為了要減少網頁伺服器的工作量還有節省客戶端行動裝置的能源,我們提出了一些方法來解決這個問題。

      首先,我們提出可以把動態網頁暫存於網頁伺服器端的架構,並且在資料庫資料變更時,可以找出過期的快取網頁。再來,在廣播無效驗證的機制下,我們利用Bloom filter讓伺服器可以把過期的網頁告知行動裝置。最後,在stateful伺服器的架構下,伺服器只需要紀錄網頁在更新之後有無使用者存取,這樣可以有效減少無效驗證的廣播量。實驗證明,TimeStamp 或UIR演算法在結合我們的方法後,都可以節省40%的無效驗證廣播量,甚至比Perfect Server的效能更好。

      In recent years, it has been a common practice to deploy the dynamic web applications for providing web services. Dynamic web applications increase server loads. Cache proxies are usually configured to disable caching the dynamic pages because they are generated dynamically. Clients must send requests to the servers for obtaining the fresh dynamic pages. But these dynamic pages may not change every time they are accessed. Also, more people use mobile devices to get dynamic web pages in the wireless network. Caching dynamic pages on the mobile clients becomes very important due to the power constraint of mobile devices. In order to reduce server workload and mobile clients’ power consumption, power-aware methods are proposed to overcome this problem.

      First, we introduce a framework to cache dynamic pages on the server side and to invalidate stale pages when data on the underlying database changes. Second, based on the Invalidation Reports approach, we propose to use Bloom filter to indicate which pages on the server side are stale for the mobile clients. Finally, we propose a stateful approach, which only counts the number of queries after updates to reduce the IR timestamp size. The conducted experiments show that our proposed approach combined with the Timestamp or UIR algorithms can reduce around 40% of the IR size. Also, our method performs better than the Perfect Server that has the full knowledge of the content of the entire mobile client’s cache in terms of transmitted IR size.

    Chapter 1 Introduction 1 Chapter 2 Related work 8 2.1 Web cache schemes: 8 2.2 Invalidation Report Strategies: 11 2.2.1 Broadcast TimeStamp (TS) 11 2.2.2 Updated Invalidation Report (UIR) 13 2.2.3 Selective Cache Invalidation 15 2.2.4 Invalidation by Absolute Validity Interval (IAVI) 20 Chapter 3 Proposed Schemes 23 3.1 Making dynamic web page cacheable: 23 3.1.1 Type B URL 25 3.1.2 URL Switch 26 3.1.3 Application Server 27 3.1.3.1 Generate appropriate HTTP Cache-Control Header 27 3.1.3.2 Storing dynamic generated pages into cache 28 3.1.3.3 Informing Cache Manager 28 3.1.4 Cache Manager 29 3.1.5 Implementation 29 3.2 How to know the cached pages on the server side are stale 31 3.2.1 Request-to-Query mapping 32 3.2.1.1 Use Pre-Defined Code 33 3.2.1.2 Use Log files 33 3.2.2 Query-to-Update mapping 34 3.3 Maintaining page consistency on the client side 36 3.3.1 How to broadcast URLs efficiently 36 3.3.1.1 What is Bloom filter 37 3.3.1.2 Use Bloom filter to represent URLs efficiently 37 3.3.2 Reduce cold data energy consumption 39 3.3.3 How to reduce IR’s Timestamp size 40 Chapter 4 Performance 43 4.1 The System model and Parameters 43 4.1.1 The Server 44 4.1.2 The Client 45 4.2 Power consumption with and without IR 45 4.3 Reduce cold data power consumption 46 4.4 Reducing Timestamp size 47 4.4.1 Effect of server’s update rate 47 4.4.2 Power consumption 48 4.4.3 Effect of clients on Power Consumption 50 4.4.4 Effect of Total pages size on the Server 50 Chapter 5 Conclusion 53 Reference 53

    [1] R. Fielding, UC Irvine, J. Gettys, J. Mogul, H. Frystyk, L. Masinter, P. Leach and T. Berners-Lee, "Hypertext Transfer Protocol - HTTP/1.1," HTTP Working Group, Internet-Draft, draft-ietf-http-v11-spec-rev-03, Mar. 1998.

    [2] K. L. Chiang, “Design and Implementation of Caching Dynamic Web Pages,” Master thesis, Dept. of Information Management, Chung Hua University, Jul. 2003.

    [3] J. Cai and K.-L. Tan, “Energy-efficient selective cache invalidation,” Wireless Networks, vol.5, pp.489-502, 1999.

    [4] K.-L. Tan, J. Cai and B. C. Ooi, “An Evaluation of Cache Invalidation Strategies in Wireless Environments,” IEEE Transactions on Parallel and Distributed Systems, vol.12 , pp.789-807, Aug. 2001.

    [5] P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham and P. Shenoy, “Adaptive push-pull: disseminating dynamic web data,” Proceedings of the tenth international conference on World Wide Web, pp.265-274, May 2001.

    [6] V. Duvvuri, P. Shenoy and R. Tewari “Adaptive Leases: A Strong Consistency Mechanism for the World Wide Web,” Tec. Re.t TR99-41, Dep. of Computer Science, University of Massachusetts at Amherst, Jun. 1999.

    [7] J. Challenger, A. Iyengar and P. Dantzig, “A Scalable system for Consistently Caching Dynamic Web Data,” Proceedings of the IEEE INFOCOM’99, Mar. 1999.

    [8] H. Zhu and T. Yang, “Class-based cache management for dynamic web content,” IEEE INFOCOM, 2001.

    [9] G. Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” ACM Int’l Conf. on Mobile Computing and Networking (MobiCom), pp. 200–209, Aug. 2000.

    [10] T. Imielinski, S. Viswanathan and B. Badrinath, “Energy Efficient Indexing on Air,” Proc. ACM SIGMOD, pp. 25-36, 1994.

    [11] T. Imielinski, S. Viswanathan and B. Badrinath, “Data on Air: Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, pp. 353-372, May/June 1997.

    [12] D. Barbara and T. Imielinski, “Sleepers and Workaholics: Caching Strategies in Mobile Environments,” Proc of the 1994 ACM SIGMOD Conf, pp. 1-12, 1994.

    [13] H. Zhu and T. Yang, "Class-based Cache Management for Dynamic Web Content," IEEE Infocom, 2001.

    [14] B. Bloom, “Space/time Trade-offs in Hash Coding with Allowable Errors,” Communications of the ACM, vol. 13 , pp. 422-426, Jul. 1970.

    [15] IRCache http://www.ircache.net/FAQ/.

    [16] Squid Web Proxy Cache, http://www.squid-cache.org/.

    [17] J. C.-H. Yuen , E. Chan, K.-Y. Lam and H. W. Leung, “Cache invalidation scheme for mobile computing systems with real-time data”, ACM SIGMOD Record, vol. 29 n, pp.34-39, Dec. 2000.

    下載圖示 校內:2005-08-25公開
    校外:2006-08-25公開
    QR CODE