An O(1)-competitive online caching algorithm for content centric networking

Ammar Gharaibeh, Abdallah Khreishah, Issa Khalil

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

8 Citations (Scopus)

Abstract

Since the emergence of Content Centric Networking (CCN) as a new paradigm for content delivery in the Internet, copious of research targeted the evaluation or the enhancement of CCN caching schemes. Motivated by providing the Internet Service Providers with incentives to perform caching, the increasing deployment of in-network cloudlets, and the low cost of storage devices, we study caching in CCN from an economical point of view, where the content providers pay the Internet Service Providers in exchange for caching their content items. We propose an online caching algorithm for CCN that does not require the exact knowledge of content items' popularities to minimize the total cost paid by the content providers. The total cost here is the sum of the caching costs and the retrieval costs. Our analysis shows that the proposed algorithm achieves an O(1) competitive ratio when compared to the optimal offline caching scheme that possesses the exact knowledge of content items' popularities. We also show through simulations that the proposed algorithm can cut the cost incurred by widely used caching schemes such as Leave Copy Down (LCD) and Leave Copy Everywhere (LCE) by up to 65%.

Original languageEnglish
Title of host publicationIEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Volume2016-July
ISBN (Electronic)9781467399531
DOIs
Publication statusPublished - 27 Jul 2016
Event35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States
Duration: 10 Apr 201614 Apr 2016

Other

Other35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
CountryUnited States
CitySan Francisco
Period10/4/1614/4/16

Fingerprint

Internet service providers
Costs
Internet

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Gharaibeh, A., Khreishah, A., & Khalil, I. (2016). An O(1)-competitive online caching algorithm for content centric networking. In IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications (Vol. 2016-July). [7524444] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2016.7524444

An O(1)-competitive online caching algorithm for content centric networking. / Gharaibeh, Ammar; Khreishah, Abdallah; Khalil, Issa.

IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Vol. 2016-July Institute of Electrical and Electronics Engineers Inc., 2016. 7524444.

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

Gharaibeh, A, Khreishah, A & Khalil, I 2016, An O(1)-competitive online caching algorithm for content centric networking. in IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. vol. 2016-July, 7524444, Institute of Electrical and Electronics Engineers Inc., 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, San Francisco, United States, 10/4/16. https://doi.org/10.1109/INFOCOM.2016.7524444
Gharaibeh A, Khreishah A, Khalil I. An O(1)-competitive online caching algorithm for content centric networking. In IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Vol. 2016-July. Institute of Electrical and Electronics Engineers Inc. 2016. 7524444 https://doi.org/10.1109/INFOCOM.2016.7524444
Gharaibeh, Ammar ; Khreishah, Abdallah ; Khalil, Issa. / An O(1)-competitive online caching algorithm for content centric networking. IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Vol. 2016-July Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{daf81f7c37254f3d9299cef7c6b445db,
title = "An O(1)-competitive online caching algorithm for content centric networking",
abstract = "Since the emergence of Content Centric Networking (CCN) as a new paradigm for content delivery in the Internet, copious of research targeted the evaluation or the enhancement of CCN caching schemes. Motivated by providing the Internet Service Providers with incentives to perform caching, the increasing deployment of in-network cloudlets, and the low cost of storage devices, we study caching in CCN from an economical point of view, where the content providers pay the Internet Service Providers in exchange for caching their content items. We propose an online caching algorithm for CCN that does not require the exact knowledge of content items' popularities to minimize the total cost paid by the content providers. The total cost here is the sum of the caching costs and the retrieval costs. Our analysis shows that the proposed algorithm achieves an O(1) competitive ratio when compared to the optimal offline caching scheme that possesses the exact knowledge of content items' popularities. We also show through simulations that the proposed algorithm can cut the cost incurred by widely used caching schemes such as Leave Copy Down (LCD) and Leave Copy Everywhere (LCE) by up to 65{\%}.",
author = "Ammar Gharaibeh and Abdallah Khreishah and Issa Khalil",
year = "2016",
month = "7",
day = "27",
doi = "10.1109/INFOCOM.2016.7524444",
language = "English",
volume = "2016-July",
booktitle = "IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - An O(1)-competitive online caching algorithm for content centric networking

AU - Gharaibeh, Ammar

AU - Khreishah, Abdallah

AU - Khalil, Issa

PY - 2016/7/27

Y1 - 2016/7/27

N2 - Since the emergence of Content Centric Networking (CCN) as a new paradigm for content delivery in the Internet, copious of research targeted the evaluation or the enhancement of CCN caching schemes. Motivated by providing the Internet Service Providers with incentives to perform caching, the increasing deployment of in-network cloudlets, and the low cost of storage devices, we study caching in CCN from an economical point of view, where the content providers pay the Internet Service Providers in exchange for caching their content items. We propose an online caching algorithm for CCN that does not require the exact knowledge of content items' popularities to minimize the total cost paid by the content providers. The total cost here is the sum of the caching costs and the retrieval costs. Our analysis shows that the proposed algorithm achieves an O(1) competitive ratio when compared to the optimal offline caching scheme that possesses the exact knowledge of content items' popularities. We also show through simulations that the proposed algorithm can cut the cost incurred by widely used caching schemes such as Leave Copy Down (LCD) and Leave Copy Everywhere (LCE) by up to 65%.

AB - Since the emergence of Content Centric Networking (CCN) as a new paradigm for content delivery in the Internet, copious of research targeted the evaluation or the enhancement of CCN caching schemes. Motivated by providing the Internet Service Providers with incentives to perform caching, the increasing deployment of in-network cloudlets, and the low cost of storage devices, we study caching in CCN from an economical point of view, where the content providers pay the Internet Service Providers in exchange for caching their content items. We propose an online caching algorithm for CCN that does not require the exact knowledge of content items' popularities to minimize the total cost paid by the content providers. The total cost here is the sum of the caching costs and the retrieval costs. Our analysis shows that the proposed algorithm achieves an O(1) competitive ratio when compared to the optimal offline caching scheme that possesses the exact knowledge of content items' popularities. We also show through simulations that the proposed algorithm can cut the cost incurred by widely used caching schemes such as Leave Copy Down (LCD) and Leave Copy Everywhere (LCE) by up to 65%.

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

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

U2 - 10.1109/INFOCOM.2016.7524444

DO - 10.1109/INFOCOM.2016.7524444

M3 - Conference contribution

VL - 2016-July

BT - IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -