skip to main content
research-article
Public Access

Proactive Caching for Low Access-Delay Services under Uncertain Predictions

Published:26 March 2019Publication History
Skip Abstract Section

Abstract

Network traffic of delay-sensitive services has become a dominant part in the network. Proactive caching with the aid of predictive information has been proposed as a promising method to enhance the delay performance, which is one of the principal concerns of such services. In this paper, we analytically investigate the problem of how to efficiently utilize uncertain predictive information to design proactive caching strategies with provably good access-delay characteristics. First, we derive an upper bound for the average amount of proactive service per request that the system can support. Then we analyze the behavior of a family of threshold-based proactive strategies with a Markov chain, which shows that the average amount of proactive service per request can be maximized by properly selecting the threshold. Finally, we propose the UNIFORM strategy, which is the threshold-based strategy with the optimal threshold, and show that it outperforms the commonly used Earliest-Deadline-First (EDF) type proactive strategies in terms of delay. We perform extensive numerical experiments to demonstrate the influence of thresholds on delay performance under the threshold-based strategies, and specifically compare the EDF strategy and the UNIFORM strategy to verify our results.

References

  1. Mohamed Ahmed, Stella Spagna, Felipe Huici, and Saverio Niccolini. 2013. A Peek into the Future: Predicting the Evolution of Popularity in User Generated Content. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (WSDM '13). ACM, New York, NY, USA, 607--616. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Faisal Alotaibi, Sameh Hosny, John Tadrous, Hesham El Gamal, and Atilla Eryilmaz. 2015. Towards A Marketplace for Mobile Content: Dynamic Pricing and Proactive Caching. arXiv:1511.07573 {cs.GT} .Google ScholarGoogle Scholar
  3. Matthew Andrews. 2000. Probabilistic end-to-end delay bounds for earliest deadline first scheduling. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2. IEEE, 603--612.Google ScholarGoogle ScholarCross RefCross Ref
  4. E. Bastug, M. Bennis, and M. Debbah. 2014. Living on the edge: The role of proactive caching in 5G wireless networks. IEEE Communications Magazine , Vol. 52, 8 (Aug 2014), 82--89.Google ScholarGoogle ScholarCross RefCross Ref
  5. Dimitri P Bertsekas, Robert G Gallager, and Pierre Humblet. 1992. Data networks. Vol. 2. Prentice-Hall International New Jersey.Google ScholarGoogle Scholar
  6. Kun Chen and Longbo Huang. 2018. Timely-throughput optimal scheduling with prediction. IEEE/ACM Transactions on Networking (2018). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cisco. 2017. The Zettabyte Era: Trends and Analysis. White Paper (2017).Google ScholarGoogle Scholar
  8. Leonidas Georgiadis, Michael J. Neely, and Leandros Tassiulas. 2006. Resource Allocation and Cross-Layer Control in Wireless Networks. Foundations and Trends in Networking , Vol. 1, 1 (2006), 1--144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Longbo Huang, Shaoquan Zhang, Minghua Chen, Xin Liu, Longbo Huang, Shaoquan Zhang, Minghua Chen, and Xin Liu. 2016. When Backpressure Meets Predictive Scheduling. IEEE/ACM Trans. Netw. , Vol. 24, 4 (Aug. 2016), 2237--2250. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Stratis Ioannidis and Edmund Yeh. 2018. Adaptive Caching Networks With Optimality Guarantees. IEEE/ACM Trans. Netw. , Vol. 26, 2 (April 2018), 737--750. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Mehdi Kargahi and Ali Movaghar. 2006. A method for performance analysis of earliest-deadline-first scheduling policy. The Journal of Supercomputing , Vol. 37, 2 (2006), 197--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ron Kohavi and Roger Longbotham. 2007. Online Experiments: Lessons Learned. Computer , Vol. 40, 9 (Sept 2007), 103--105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Milad Mahdian and Edmund Yeh. 2017. MinDelay: Low-latency Forwarding and Caching Algorithms for Information-Centric Networks. arXiv:1710.05130 {cs.NI} .Google ScholarGoogle Scholar
  14. Sean P. Meyn and Richard L. Tweedie. 1993. Markov chains and stochastic stability.Google ScholarGoogle Scholar
  15. Leela Srikar Muppirisetty, John Tadrous, Atilla Eryilmaz, and Henk Wymeersch. 2015. On proactive caching with demand and channel uncertainties. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) . 1174--1181.Google ScholarGoogle ScholarCross RefCross Ref
  16. Henrique Pinto, Jussara M. Almeida, and Marcos A. Gonccalves. 2013. Using Early View Patterns to Predict the Popularity of Youtube Videos. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (WSDM '13). ACM, New York, NY, USA, 365--374. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Vijay Sivaraman and Fabio Chiussi. 2000. Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping. In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 631--640.Google ScholarGoogle ScholarCross RefCross Ref
  18. John Tadrous and Atilla Eryilmaz. 2016. On Optimal Proactive Caching for Mobile Networks With Demand Uncertainties. IEEE/ACM Transactions on Networking , Vol. 24, 5 (October 2016), 2715--2727. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. John Tadrous, Atilla Eryilmaz, and Hesham El Gamal. 2013. Proactive resource allocation: Harnessing the diversity and multicast gains. IEEE Transactions on Information Theory , Vol. 59, 8 (2013), 4833--4854. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Ronald W Wolff. 1989. Stochastic modeling and the theory of queues .Pearson College Division.Google ScholarGoogle Scholar
  21. Edmund Yeh, Tracey Ho, Ying Cui, Michael Burd, Ran Liu, and Derek Leong. 2014. VIP: A Framework for Joint Dynamic Forwarding and Caching in Named Data Networks. In Proceedings of the 1st ACM Conference on Information-Centric Networking (ACM-ICN '14). ACM, New York, NY, USA, 117--126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Shaoquan Zhang, Longbo Huang, Minghua Chen, and Xin Liu. 2017. Proactive Serving Decreases User Delay Exponentially: The Light-Tailed Service Time Case. IEEE/ACM Trans. Netw. , Vol. 25, 2 (April 2017), 708--723. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Proactive Caching for Low Access-Delay Services under Uncertain Predictions

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Article Metrics

              • Downloads (Last 12 months)24
              • Downloads (Last 6 weeks)1

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!