Abstract
In existing content delivery systems user accesses are popularly used for predicting the request pattern of contents. In novel web applications such as publish/subscribe services, users explicitly provide statements of interest in the form of subscriptions. These subscriptions provide another source of user information in addition to access patterns. This paper addresses the content delivery problem when user-stated interest is available. Each request by a user is either based on a notification about the availability of content that matches the user’s subscriptions, or general browsing that is not based on the publish/subscribe service. We propose two approaches to content delivery that exploit both proactive push-time placement and passive access-time replacement based on the subscription information, the access pattern of subscribers, and that of non-subscribers. In our simulation-based evaluation, the two approaches are compared to an access-based caching only algorithm and to three approaches that were proposed for pure notification-driven accesses in our earlier study [5]. The results demonstrate that incorporating subscription information judiciously can substantially reduce the response time, even when only a small portion of accesses is driven by notifications and the subscription information does not reflect subscribers’ accesses perfectly. To our knowledge, this work is the first effort to investigate general content delivery and caching enhanced by using subscription information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akamai. http://www.akamai.com.
Besravros, A. Demand-based document dissemination to reduce traffic and balance load. In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing (SPDP’95), 1995.
Cao, P. and Irani, S. Cost-aware WWW proxy caching algorithms. In Proc. of USENIX Symp. on Internet Technology and Systems, 1997.
Chi, E. H., Pirolli, P., Chen, K., and Pitkow, J. Using information scent to model user information needs and actions on the Web. Proc. CHI, 2001, pp. 490–497.
Chen, M, LaPaugh, A. and Singh, J. P. Content distribution for publish/subscribe services. In Proc. of ACM/IFIP/USENIX Middleware, 2003, pp. 83–102.
Cidon, I., Kutten, S., and Soffer, R. Optimal allocation of electronic content. In Proceedings of IEEE Infocom 2001.
Deolasee, P., Katkar, A., Panchbudhe, A., Ramamritham, K., and Shenoy, P. Adaptive push-pull: Disseminating dynamic Web data. In Proceedings of WWW10, 2001.
Digital Island. http://www.digitalisland.com/.
Duchamp, D. Prefetching hyperlinks. In Proc. of USENIX Symp. on Internet Technologies and Systems, 1999.
Fan, L., Cao, P., Lin, W., and Jacobson, Q. Web prefetching between low-bandwidth clients and proxies: Potential and performance. In Proc. of ACM SIGMETRICS, 1999.
Gadde, S., Chase, J., and Rabinovich, M. Web caching and content distribution: A view from the interior. Proc. 5th International Web Caching and Content Delivery Workshop (WCW), 2000.
GT-ITM: Georgia Tech Internetwork Topology Models. http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html
Gwertzman, J. and Seltzer, M. An analysis of geographical push-caching. 1997.
Jin, S. and Bestavrous, A. GreedyDual* Web caching algorithm: Exploiting the two sources of temporal locality in Web request streams. Computer Comm., 24(2):174–183, Feb. 2001.
Kangasharju, J., Roberts, J., and Ross, K. W. Object replication strategies in content distribution networks. In Proceedings of WCW’01: Web Caching and Content Distribution Workshop, June 2001.
Karger, D., Lehman, E., Leighton, F. T., Levine, M., Lewin, D., and Panigrahy, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 654–663, 1997.
Karlsson, M. and Mahalingam, M. Do we need replica placement Algorithms in content delivery networks. In Proc. of WCW’ 02: Web Caching and Content Distribution Workshop, 2002.
Korupolu, M. R. and Dahlin, M. Coordinated placement and replacement for large-scale distributed caches. IEEE Transactions on Knowledge and Data Engineering, 14(6):1317–1329, 2002.
Krishnan, P., Raz, D., and Shavitt, Y. The cache location problem. IEEE/ACM Transactions on Networking, 8(5):568–582, October 2000.
Lieberman, H. Letizia: An agent That assists Web browsing. Proceedings of the International Joint Conference on Artificial Intelligent, 1995.
Li, B., Golin, M. J., Italiano, G. F., and Deng, X. On the optimal placement of Web proxies in the Internet. In Proc. of IEEE INFOCOM, 1999.
Padmanabhan, V. N. and Qiu, L.-L. The content and access dynamics of a busy Web site: Findings and implications. In Proc. of ACM SIGCOMM 2000.
Qiu, L., Padmanabham, V. N., and Voelker, G. M. On the placement of web server replicas. In Proceedings of 20th IEEE INFOCOM, 2001.
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., and Levy, H. M. An analysis of Internet content delivery systems. In Proc. of OSDI, 2002.
Wang, L.-M., Pai, V., and Peterson, L. The effectiveness of request redirection on CDN Robustness. In Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI’02), 2002.
Venkataramani, A., Yalagandula, P., Kokku, R., Sharif, S., and Dahlin, M. The potential costs and benefits of long-term prefetching for content distribution. Technical Report TR-01-13, UT, Austin, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Chen, M., Singh, J.P., LaPaugh, A. (2004). Subscription-Enhanced Content Delivery. In: Douglis, F., Davison, B.D. (eds) Web Content Caching and Distribution. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2258-1_13
Download citation
DOI: https://doi.org/10.1007/1-4020-2258-1_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2257-9
Online ISBN: 978-1-4020-2258-6
eBook Packages: Springer Book Archive