ACM Home Page
Please provide us with feedback. Feedback
Adaptive pull-based policies for wide area data delivery
Full text PdfPdf (680 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 31 ,  Issue 2  (June 2006) table of contents
Pages: 631 - 671  
Year of Publication: 2006
ISSN:0362-5915
Authors
Laura Bright  Portland State University, Portland, OR
Avigdor Gal  Technion---Israel Institute of Technology, Haifa, Israel
Louiqa Raschid  University of Maryland, College Park, MD
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 111,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1138394.1138399
What is a DOI?

ABSTRACT

Wide area data delivery requires timely propagation of up-to-date information to thousands of clients over a wide area network. Applications include web caching, RSS source monitoring, and email access via a mobile network. Data sources vary widely in their update patterns and may experience different update rates at different times or unexpected changes to update patterns. Traditional data delivery solutions are either push-based, which requires servers to push updates to clients, or pull-based, which require clients to check for updates at servers. While push-based solutions ensure timely data delivery, they are not always feasible to implement and may not scale to a large number of clients. In this article, we present adaptive pull-based policies that explicitly aim to reduce the overhead of contacting remote servers, compared to existing pull-based policies, while meeting freshness requirements. We model updates to data sources using update histories, and present two novel history-based policies to estimate when updates occur; they are based on individual history and aggregate history. These policies are presented within an architectural framework that supports their deployment either client-side or server-side. We further develop two adaptive policies to handle objects that initially may have insufficient history or objects that experience changes in update patterns. Extensive experimental evaluation using three data traces from diverse applications shows that history-based policies can reduce contact between clients and servers by up to 60% compared to existing pull-based policies while providing a comparable level of data freshness. Our experiments further demonstrate that our adaptive policies can select the best policy to match the behavior of an object and perform better than any individual policy, thus they dominate standalone policies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Amiri, K., Tewari, R., Park, S., and Padmanabhan, S. 2002. On space management in a dynamic edge data cache. In Proceedings of the 5th International Workshop on the Web and Databases (WebDB). 37--42.
 
3
Arlitt, M. and Jin, T. 1998. 1998 world cup web site access logs. (Available at http://www.acm.org/sigcomm/ITA/).
 
4
 
5
BlackBerry. 2005. BlackBerry Wireless Handhelds. http://www.blackberry.com.
 
6
7
 
8
Bright, L. and Raschid, L. 2002. Using latency-recency profiles for data delivery on the web. In Proceedings of the 28th Conference on Very Large Data Bases (VLDB). 550--561.
9
 
10
Carney, D., Lee, S., and Zdonik, S. 2003. Scalable application-aware data freshening. In Proceedings of the 19th International Conference on Data Engineering (ICDE). 481--492.
 
11
Cate, V. 1992. Alex---A global filesystem. In Proceedings of the USENIX File System Workshop. 1--12.
 
12
Challenger, J., Iyengar, A., and Dantzig, P. 1999. A scalable system for consistently caching dynamic web data. In Proceedings of IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA, 294--303.
13
14
 
15
Cho, J. and Ntoulas, A. 2002. Effective change detection using sampling. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB). 514--525.
 
16
Cohen, E. and Kaplan, H. 2001. Refreshment policies for web content caches. In Proceedings of IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA, 1398--1406.
17
 
18
Eckstein, J., Gal, A., and Reiner, S. 2005. Optimal information monitoring under a politeness constraint. Tech. Rep. RRR 16-2005, RUTCOR, Rutgers University, Piscataway, NJ.
19
20
21
 
22
 
23
Gwertzman, J. and Seltzer, M. 1996. World wide web cache consistency. In Proceedings of the USENIX Technical Conference. 141--152.
24
25
 
26
27
 
28
 
29
 
30
Lai, T. and Shan, J. 1999. Efficient recursive algorithms for detection of abrupt changes in signal and control systems. IEEE Trans. Automat. Control 44, 952--964.
 
31
 
32
 
33
Mason, R., Chou, Y.-M., Sullivan, J., Stoumbos, Z. G., and Young, J. C. 2003. Systematic patterns in T2 charts. J. Qual. Tech. 35, 47--58.
34
 
35
Nishina, K. 1992. A comparison of control charts from the viewpoint of change-point estimation. Qual. Reliab. Eng. Internat. 8, 537--541.
36
37
 
38
Pandey, S., Dhamdhere, K., and Olston, C. 2004. WIC: A general purpose algorithm for monitoring web information sources. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). 360--371.
39
 
40
Reynolds, Jr., M. and Stoumbos, Z. 2000. A general approach to modeling CUSUM charts for a proportion. IIE Transactions on Quality and Reliability Engineering 32, 515--535.
 
41
Ross, S. 1995. Stochastic Processes, second ed. Wiley, New York.
 
42
Stoumbos, Z., Jr., M. R., and Woodall, W. 2003. Control chart schemes for monitoring the mean and variance of processes subject to sustained shifts and drifts. The Handbook of Statistics: Statistics in Industry 22. C.R. Rao and R. Khattree (eds.).
 
43
Taylor, H. and Karlin, S. 1994. An Introduction to Stochastic Modeling. Academic Press, Orlando, FL.
 
44
Wessels, D. 1996. Squid internet object cache. http://www.squid-cache.org.
 
45
46
 
47
Zhu, H. and Yang, T. 2001. Class-based cache management for dynamic web content. In Proceedings of IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA, 1215--1224.



REVIEW

"Georgia Garani : Reviewer"

Bright, Gal, and Raschid deal with the policies used for timely propagation of up-to-date information to thousands of clients over a wide area network. It seems as if pull-based data delivery is becoming the preferred solution for rapid and widesp  more...

Collaborative Colleagues:
Laura Bright: colleagues
Avigdor Gal: colleagues
Louiqa Raschid: colleagues