skip to main content
10.1145/2984356.2984377acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Public Access

Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks

Published: 26 September 2016 Publication History

Abstract

Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of forwarding and caching within the Named Data Networking (NDN) architecture. The virtual plane of the VIP framework captures the measured demand for content objects, but does not reflect interest collapse and suppression in the NDN network. We aim to further improve the performance of the existing VIP algorithms by using a modified virtual plane where VIP counts are appropriately scaled to reflect interest suppression effects. We characterize the stability region of the modified virtual plane with VIP scaling, develop a new distributed forwarding and caching algorithm operating on the scaled VIPs, and demonstrate the throughput optimality of the scaled VIP algorithm in the virtual plane. Numerical experiments demonstrate significantly enhanced performance relative to the existing VIP algorithm, as well as a number of other baseline algorithms.

References

[1]
L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. Thornton, D. K. Smetters, B. Zhang, G. Tsudik, kc claffy, D. Krioukov, D. Massey, C. Papadopoulos, T. Abdelzaher, L. Wang, P. Crowley, and E. Yeh. Named data networking (ndn) project. Oct. 2010.
[2]
V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking named content. In Proceedings of the 5th international conference on Emerging networking experiments and technologies, CoNEXT ’09, pages 1–12, New York, NY, USA, 2009. ACM.
[3]
E. Yeh, T. Ho, Y. Cui, M. Burd, R. Liu, and D. Leong. Vip: A framework for joint dynamic forwarding and caching in named data networks. In Proceedings of the 1st International Conference on Information-centric Networking, ICN ’14, pages 117–126, New York, NY, USA, 2014. ACM.
[4]
L. Georgiadis, M. Neely, and L. Tassiulas. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 1(1):1-144, 2006.
[5]
G. Rossini and D. Rossi. Coupling caching and forwarding: Benefits, analysis, and implementation. In ICN ’14, pages 127–136, 2014.
[6]
M. M. Amble, P. Parag, S. Shakkottai, and L. Ying. Content-aware caching and traffic management in content distribution networks. In Proceedings of IEEE INFOCOM 2011, pages 2858–2866, Shanghai, China, Apr. 2011.
[7]
H. Xie, G. Shi, and P. Wang. Tecc: Towards collaborative in-network caching guided by traffic engineering. In Proceedings of IEEE INFOCOM 2012:Mini-Conference, pages 2546–2550, Orlando, Florida, USA, Mar. 2012. 8} W. Chai, D. He, L. Psaras, and G. Pavlou. Cache “less for more” in information-centric networks. In Proceedings of the 11th International IFIP TC 6 Conference on Networking - Volume Part I, IFIP’12, pages 27–40, Berlin, Heidelberg, 2012. Springer-Verlag.
[8]
Z. Ming, M. Xu, and D. Wang. Age-based cooperative caching in information-centric networks. In Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on, pages 268–273, March 2012.
[9]
C. Yi, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang. Adaptive forwarding in named data networking. SIGCOMM Comput. Commun. Rev., 42(3):62–67, June 2012.
[10]
F. Lai, F. Qiu, W. Bian, Y. Cui, E. Yeh, “Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks,” Report, 2016. Available: http://arxiv.org/abs/1608.04198.

Cited By

View all

Index Terms

  1. Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking
      September 2016
      275 pages
      ISBN:9781450344678
      DOI:10.1145/2984356
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 26 September 2016

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. caching
      2. content centric networking
      3. forwarding
      4. information centric networking
      5. interest collapse
      6. named data networking

      Qualifiers

      • Research-article

      Funding Sources

      Conference

      ICN'16
      Sponsor:

      Acceptance Rates

      ACM-ICN '16 Paper Acceptance Rate 23 of 84 submissions, 27%;
      Overall Acceptance Rate 133 of 482 submissions, 28%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)43
      • Downloads (Last 6 weeks)5
      Reflects downloads up to 09 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media