首页 | 本学科首页   官方微博 | 高级检索  
     


Caching and optimized request routing in cloud-based content delivery systems
Affiliation:1. Linköping University, Sweden;2. University of Saskatchewan, Canada;3. University of Calgary, Canada;1. Google Inc, 1600 Amphitheatre Pkwy, Mountain View, CA 94043, United States;2. Hewlett–Packard Laboratories, Palo Alto, CA 94304, United States;3. Department of Computer Science, University of Illinois at Urbana–Champaign, IL 61801, United States;1. ENS Paris, 45 rue d’Ulm 75005 Paris, France;2. Inria, 23 avenue d’Italie, 75013 Paris, France;1. Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;2. Bell Laboratories, Alcatel-Lucent, P.O. Box 636, Murray Hill, NJ 07974, USA;1. Tepper School of Business, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213, United States;2. Department of Communications and Networking, Aalto University, 00076 Aalto, Finland;3. School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213, United States;1. Budapest University of Technology and Economics, Department of Networked Systems and Services, Hungary;2. MTA-BME Information Systems Research Group, Hungary;3. Inter-University Center of Telecommunications and Informatics, Debrecen, Hungary
Abstract:Geographically distributed cloud platforms enable an attractive approach to large-scale content delivery. Storage at various sites can be dynamically acquired from (and released back to) the cloud provider so as to support content caching, according to the current demands for the content from the different geographic regions. When storage is sufficiently expensive that not all content should be cached at all sites, two issues must be addressed: how should requests for content be routed to the cloud provider sites, and what policy should be used for caching content using the elastic storage resources obtained from the cloud provider. Existing approaches are typically designed for non-elastic storage and little is known about the optimal policies when minimizing the delivery costs for distributed elastic storage.In this paper, we propose an approach in which elastic storage resources are exploited using a simple dynamic caching policy, while request routing is updated periodically according to the solution of an optimization model. Use of pull-based dynamic caching, rather than push-based placement, provides robustness to unpredicted changes in request rates. We show that this robustness is provided at low cost. Even with fixed request rates, use of the dynamic caching policy typically yields content delivery cost within 10% of that with the optimal static placement. We compare request routing according to our optimization model to simpler baseline routing policies, and find that the baseline policies can yield greatly increased delivery cost relative to optimized routing. Finally, we present a lower-cost approximate solution algorithm for our routing optimization problem that yields content delivery cost within 2.5% of the optimal solution.
Keywords:Content delivery  Distributed clouds  Dynamic caching  Request routing optimization  Elastic storage
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号