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 (Print)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

Other

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

Fingerprint

Computer networks
Quality of service
Decision making
Internet

Keywords

  • asymptotic optimality
  • caching incentive
  • competitive ratio
  • En-route caching
  • 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] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MASS.2014.84

Asymptotically-optimal incentive-based en-route caching scheme. / Gharaibeh, Ammar; Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014. Institute of Electrical and Electronics Engineers Inc., 2015. p. 318-326 7035700.

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

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., 7035700, Institute of Electrical and Electronics Engineers Inc., pp. 318-326, 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014, Philadelphia, United States, 28/10/14. https://doi.org/10.1109/MASS.2014.84
Gharaibeh A, Khreishah A, Khalil I, Wu J. Asymptotically-optimal incentive-based en-route caching scheme. In Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014. Institute of Electrical and Electronics Engineers Inc. 2015. p. 318-326. 7035700 https://doi.org/10.1109/MASS.2014.84
Gharaibeh, Ammar ; Khreishah, Abdallah ; Khalil, Issa ; Wu, Jie. / Asymptotically-optimal incentive-based en-route caching scheme. Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 318-326
@inproceedings{8621016511fe4e80ac05dae86a3f4ea5,
title = "Asymptotically-optimal incentive-based en-route caching scheme",
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.",
keywords = "asymptotic optimality, caching incentive, competitive ratio, En-route caching, quality of service",
author = "Ammar Gharaibeh and Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2015",
month = "2",
day = "6",
doi = "10.1109/MASS.2014.84",
language = "English",
isbn = "9781479960354",
pages = "318--326",
booktitle = "Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Asymptotically-optimal incentive-based en-route caching scheme

AU - Gharaibeh, Ammar

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2015/2/6

Y1 - 2015/2/6

N2 - 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.

AB - 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.

KW - asymptotic optimality

KW - caching incentive

KW - competitive ratio

KW - En-route caching

KW - quality of service

UR - http://www.scopus.com/inward/record.url?scp=84925379727&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925379727&partnerID=8YFLogxK

U2 - 10.1109/MASS.2014.84

DO - 10.1109/MASS.2014.84

M3 - Conference contribution

SN - 9781479960354

SP - 318

EP - 326

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -