Asymptotically-optimal incentive-based en-route caching scheme

Ammar Gharaibeh, Abdallah Khreishah, Issa Khalil, Jie Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content. Several caching techniques have been proposed since the emergence of the concept, including techniques that require major changes to the Internet architecture such as Content Centric Networking. Few of these techniques consider providing caching incentives for the nodes or quality of service guarantees for content owners. In this work, we present a low complexity, distributed, and online algorithm for making caching decisions based on content popularity, while taking into account the aforementioned issues. Our algorithm performs en-route caching. Therefore, it can be integrated with the current TCP/IP model. In order to measure the performance of any online caching algorithm, we define the competitive ratio as the ratio of the performance of the online algorithm in terms of traffic savings to the performance of the optimal offline algorithm that has a complete knowledge of the future. We show that under our settings, no online algorithm can achieve a better competitive ratio than Ω(log n), where n is the number of nodes in the network. Furthermore, we show that under realistic scenarios, our algorithm has an asymptotically optimal competitive ratio in terms of the number of nodes in the network.

Original languageEnglish
Title of host publicationProceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages318-326
Number of pages9
ISBN (Electronic)9781479960354
DOIs
Publication statusPublished - 6 Feb 2015
Event11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014 - Philadelphia, United States
Duration: 28 Oct 201430 Oct 2014

Publication series

NameProceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014

Other

Other11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
CountryUnited States
CityPhiladelphia
Period28/10/1430/10/14

    Fingerprint

Keywords

  • En-route caching
  • asymptotic optimality
  • caching incentive
  • competitive ratio
  • quality of service

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Networks and Communications

Cite this

Gharaibeh, A., Khreishah, A., Khalil, I., & Wu, J. (2015). Asymptotically-optimal incentive-based en-route caching scheme. In Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014 (pp. 318-326). [7035700] (Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MASS.2014.84