Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3266276.3266278acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

Caching Policies for D2D-Assisted Content Delivery Systems

Published:01 October 2018Publication History

ABSTRACT

We consider a content delivery system consisting of a central server and multiple end-users. The central server stores the entire catalog of contents on offer and can deliver the requested content to the end-users. In addition, the end-users are equipped with limited caching capabilities and have the ability to deliver content to each other via D2D communication. The system also allows a third mode of content delivery where the central server delivers content to some of the end-users who then relay it to the other users. Our goal is to determine which contents to cache at the end-users in order to minimize the cost of service. We characterize the optimal caching policy and evaluate the benefits of allowing the central server to use other end-users as relays to deliver content. The key takeaway from this work is that if end-users have caching capabilities, the benefits of the central server using end-users as relays is negligible. This is in contrast to the case where the end-users cannot cache content where using end-users as relays leads to significant improvement in system performance.

References

  1. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. 1999. Web caching and Zipf-like distributions: Evidence and implications. In IEEE INFOCOM. 126--134.Google ScholarGoogle Scholar
  2. Zhuoqun Chen, Yangyang Liu, Bo Zhou, and Meixia Tao. 2016. Caching incentive design in wireless D2D networks: A Stackelberg game approach. In Communications (ICC), 2016 IEEE International Conference on. IEEE, 1--6.Google ScholarGoogle ScholarCross RefCross Ref
  3. Cisco 2018. Cisco Whitepaper: http://www.cisco.com/c/en/us/ solutions/collateral/service-provider/ip-ngnip- next-generation-network/white_paper_c11- 481360.html.Google ScholarGoogle Scholar
  4. C. Fricker, P. Robert, J. Roberts, and N. Sbihi. 2012. Impact of traffic mix on caching performance in a content-centric network. In IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). 310--315.Google ScholarGoogle Scholar
  5. Negin Golrezaei, Alexandros G Dimakis, and Andreas F Molisch. 2012. Wireless device-to-device communications with distributed caching. In Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. IEEE, 2781--2785.Google ScholarGoogle ScholarCross RefCross Ref
  6. Negin Golrezaei, Parisa Mansourifard, Andreas F Molisch, and Alexandros G Dimakis. 2014. Base-station assisted device-to-device communications for high-throughput wireless video networks. IEEE Transactions on Wireless Communications 13, 7 (2014), 3665--3676.Google ScholarGoogle ScholarCross RefCross Ref
  7. Negin Golrezaei, Andreas F Molisch, Alexandros G Dimakis, and Giuseppe Caire. 2013. Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution. IEEE Communications Magazine 51, 4 (2013), 142--149.Google ScholarGoogle ScholarCross RefCross Ref
  8. Mingyue Ji, Giuseppe Caire, and Andreas F Molisch. 2016. Fundamental limits of caching in wireless D2D networks. IEEE Transactions on Information Theory 62, 2 (2016), 849--869.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Leconte, M. Lelarge, and L. Massoulie. 2012. Bipartite graph structures for efficient balancing of heterogeneous loads. In ACM SIGMETRICS. 41--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y. Liu, F. Li, L. Guo, B. Shen, S. Chen, and Y. Lan. 2013. Measurement and Analysis of an Internet Streaming Service to Mobile Devices. IEEE Transactions on Parallel and Distributed Systems 24, 11 (2013), 2240-- 2250. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Maddah-Ali and U. Niesen. 2014. Fundamental limits of caching. IEEE Transactions on Information Theory 60, 5 (2014), 2856--2867.Google ScholarGoogle ScholarCross RefCross Ref
  12. Akshay Mete and Sharayu Moharir. 2018. Caching Policies for D2D-Assisted Content Delivery Systems. (2018). https://www.dropbox.com/s/v6n17im4ufabrqt/main.pdf?dl=0. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. XiaofeiWang, Min Chen, Zhu Han, Ted Taekyoung Kwon, and Yanghee Choi. 2012. Content dissemination by pushing and sharing in mobile cellular networks: An analytical study. In Mobile Adhoc and Sensor Systems (MASS), 2012 IEEE 9th International Conference on. IEEE, 353-- 361. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. XiaofeiWang, Min Chen, Zhu Han, Dapeng OliverWu, and Ted Taekyoung Kwon. 2014. TOSS: Traffic offloading by social network servicebased opportunistic sharing in mobile social networks. In INFOCOM, 2014 Proceedings IEEE. IEEE, 2346--2354.Google ScholarGoogle Scholar
  15. Xiaofei Wang, Min Chen, Tarik Taleb, Adlen Ksentini, and Victor Leung. 2014. Cache in the air: exploiting content caching and delivery techniques for 5G systems. IEEE Communications Magazine 52, 2 (2014), 131--139.Google ScholarGoogle ScholarCross RefCross Ref
  16. H. Yu, D. Zheng, B.Y. Zhao, and W. Zheng. 2006. Understanding user behavior in large scale video-on-demand systems. In EuroSys. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Caching Policies for D2D-Assisted Content Delivery Systems

            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
            • Published in

              cover image ACM Conferences
              WirelessEdge '18: Proceedings of the 2018 on Technologies for the Wireless Edge Workshop
              October 2018
              40 pages
              ISBN:9781450359313
              DOI:10.1145/3266276

              Copyright © 2018 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 October 2018

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader