Distributed Online En-Route Caching

Content caching at intermediate nodes is an 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 in literature, including techniques that require major chang...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 27; číslo 12; s. 3455 - 3468
Hlavní autori:	Gharaibeh, Ammar, Khreishah, Abdallah, Khalil, Issa, Wu, Jie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithm design and analysis Algorithms asymptotic optimality Asymptotic properties Cache storage Caching caching incentive competitive ratio Complexity theory Computer architecture Computer networks Current measurement En-route caching Nodes Optimization Quality of service TCP/IP (protocol) TCPIP
ISSN:	1045-9219, 1558-2183
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Content caching at intermediate nodes is an 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 in literature, including techniques that require major changes to the Internet architecture. In this work, we present a low complexity, distributed, and online caching algorithm based on content popularity. Our algorithm performs en-route caching using a simple cost-reward comparison. Therefore, it can be integrated with the current TCP/IP model. We use the concept of competitive ratio to measure the performance of any online caching algorithm, in terms of traffic savings, with respect 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 Ω(logn), 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. We also study several extensions to the basic algorithm and show their effectiveness through extensive simulations.
AbstractList	Content caching at intermediate nodes is an 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 in literature, including techniques that require major changes to the Internet architecture. In this work, we present a low complexity, distributed, and online caching algorithm based on content popularity. Our algorithm performs en-route caching using a simple cost-reward comparison. Therefore, it can be integrated with the current TCP/IP model. We use the concept of competitive ratio to measure the performance of any online caching algorithm, in terms of traffic savings, with respect 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 Ω(logn), 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. We also study several extensions to the basic algorithm and show their effectiveness through extensive simulations. Content caching at intermediate nodes is an 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 in literature, including techniques that require major changes to the Internet architecture. In this work, we present a low complexity, distributed, and online caching algorithm based on content popularity. Our algorithm performs en-route caching using a simple cost-reward comparison. Therefore, it can be integrated with the current TCP/IP model. We use the concept of competitive ratio to measure the performance of any online caching algorithm, in terms of traffic savings, with respect 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 [Formula Omitted], 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. We also study several extensions to the basic algorithm and show their effectiveness through extensive simulations.
Author	Gharaibeh, Ammar Khalil, Issa Khreishah, Abdallah Wu, Jie
Author_xml	– sequence: 1 givenname: Ammar surname: Gharaibeh fullname: Gharaibeh, Ammar email: amg54@njit.edu organization: Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ – sequence: 2 givenname: Abdallah surname: Khreishah fullname: Khreishah, Abdallah email: abdallah@njit.edu organization: Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ – sequence: 3 givenname: Issa surname: Khalil fullname: Khalil, Issa email: ikhalil@qf.org.qa organization: Qatar Computing Research Institute, Hamad bin Khalifa University, 13th Floor, Tornado Tower, Doha, Qatar – sequence: 4 givenname: Jie surname: Wu fullname: Wu, Jie email: jiewu@temple.edu organization: Department of Computer & Information Sciences, Temple University, Philadelphia, PA
BookMark	eNp9kE1PAjEQhhuDiYD-AOOFhPPiTD-27dEAfiQkGMVz0y1dLcEutsvBf-8SiAcPnmYyeZ-ZyTMgvdhET8g1wgQR9O3qefY6oYDlhAoumS7PSB-FUAVFxXpdD1wUmqK-IIOcNwDIBfA-Gc9CblOo9q1fj5ZxG6IfzWPx0nSD0dS6jxDfL8l5bbfZX53qkLzdz1fTx2KxfHia3i0KRzVrC9cVkOgAKiXBYa3r7hFXSSs4gpeCMs0qZF5R9LYWpRYgrV4LjxXq2rEhGR_37lLztfe5NZtmn2J30qDigBoZV11KHlMuNTknXxsXWtuGJrbJhq1BMAcj5mDEHIyYk5GOxD_kLoVPm77_ZW6OTPDe_-Yl51SUiv0A9LdriQ
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_1109_TSC_2018_2850333
Cites_doi	10.1109/MIC.2003.1250586 10.1007/978-3-642-40009-4_5 10.1109/MASS.2014.84 10.1145/1290672.1290686 10.1109/INFCOM.2007.104 10.1109/INFCOMW.2011.5928833 10.1109/INFCOM.2013.6566772 10.1007/978-3-642-20757-0_7 10.1145/1544012.1544074 10.1145/2248371.2248390 10.1109/ICC.2013.6655114 10.1109/INFCOM.1999.749260 10.1145/1842733.1842736 10.1109/FiCloud.2014.26 10.1109/WCNC.2013.6554764 10.1109/ICC.2014.6883600 10.1109/IACS.2015.7103188 10.1109/GLOCOM.2013.6831270 10.1287/opre.1070.0450 10.1145/1658939.1658941 10.1109/NCA.2003.1201132 10.1016/j.comnet.2012.11.026 10.1109/INFCOM.2009.5061926 10.1038/30918 10.1016/j.jnca.2013.09.003 10.1145/2342488.2342501 10.1109/INFCOM.2009.5062201
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TPDS.2016.2547396
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore Digital Libary (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	3468
ExternalDocumentID	10_1109_TPDS_2016_2547396 7442568
Genre	orig-research
GrantInformation_xml	– fundername: US National Science Foundation grantid: ECCS 1331018 funderid: 10.13039/100000001
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AGQYO AGSQL AHBIQ AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS TN5 TWZ UHB AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c293t-cc29071c00b870c1f9f739cb7a5410e752393b13e821eaf569507a9d5e1b19fc3
IEDL.DBID	RIE
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000388896600005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1045-9219
IngestDate	Sun Nov 30 04:27:13 EST 2025 Tue Nov 18 22:12:50 EST 2025 Sat Nov 29 03:36:09 EST 2025 Wed Aug 27 02:36:15 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	12
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c293t-cc29071c00b870c1f9f739cb7a5410e752393b13e821eaf569507a9d5e1b19fc3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1840191348
PQPubID	85437
PageCount	14
ParticipantIDs	crossref_citationtrail_10_1109_TPDS_2016_2547396 ieee_primary_7442568 proquest_journals_1840191348 crossref_primary_10_1109_TPDS_2016_2547396
PublicationCentury	2000
PublicationDate	2016-Dec.-1 2016-12-1 20161201
PublicationDateYYYYMMDD	2016-12-01
PublicationDate_xml	– month: 12 year: 2016 text: 2016-Dec.-1 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2016
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	pham (ref21) 0 ref34 ref12 ref37 ref15 ref36 ref14 ref31 pathan (ref4) 2007 ref11 ref10 ref1 ref17 ref38 ref16 (ref35) 0 ref19 (ref33) 0 ref18 bu (ref30) 0 gharaibeh (ref25) 2015 ref24 ref23 ref26 ref20 dai (ref13) 0 ref22 fei (ref28) 0; 98 ref27 (ref32) 0 ref29 (ref2) 2014 rossi (ref8) 0 ref7 ref9 ref3 ref6 ref5
References_xml	– ident: ref3 doi: 10.1109/MIC.2003.1250586 – year: 2014 ident: ref2 article-title: Cisco visual networking index: Global mobile data traffic forecast update, 2013-2018 – year: 2007 ident: ref4 article-title: A taxonomy and survey of content delivery networks – year: 0 ident: ref33 – start-page: 638 year: 0 ident: ref30 article-title: On distinguishing between internet power law topology generators publication-title: Proc INFOCOM – year: 2015 ident: ref25 article-title: A provably efficient online collaborative caching algorithm for multicell-coordinated systems – ident: ref37 doi: 10.1007/978-3-642-40009-4_5 – ident: ref1 doi: 10.1109/MASS.2014.84 – ident: ref26 doi: 10.1145/1290672.1290686 – volume: 98 year: 0 ident: ref28 article-title: Measurements on delay and hop-count of the internet publication-title: Proc IEEE Globecom – start-page: 2444 year: 0 ident: ref13 article-title: Collaborative hierarchical caching with dynamic request routing for massive content distribution publication-title: Proc IEEE InfoCom – year: 0 ident: ref8 article-title: Caching performance of content centric networks under multi-path routing (and more) publication-title: Relatório técnico Telecom ParisTech – ident: ref14 doi: 10.1109/INFCOM.2007.104 – ident: ref34 doi: 10.1109/INFCOMW.2011.5928833 – ident: ref16 doi: 10.1109/INFCOM.2013.6566772 – year: 0 ident: ref32 – ident: ref7 doi: 10.1007/978-3-642-20757-0_7 – ident: ref20 doi: 10.1145/1544012.1544074 – ident: ref38 doi: 10.1145/2248371.2248390 – ident: ref10 doi: 10.1109/ICC.2013.6655114 – ident: ref29 doi: 10.1109/INFCOM.1999.749260 – ident: ref5 doi: 10.1145/1842733.1842736 – ident: ref23 doi: 10.1109/FiCloud.2014.26 – ident: ref24 doi: 10.1109/WCNC.2013.6554764 – ident: ref36 doi: 10.1109/ICC.2014.6883600 – ident: ref22 doi: 10.1109/IACS.2015.7103188 – ident: ref18 doi: 10.1109/GLOCOM.2013.6831270 – ident: ref27 doi: 10.1287/opre.1070.0450 – year: 0 ident: ref35 – ident: ref6 doi: 10.1145/1658939.1658941 – ident: ref15 doi: 10.1109/NCA.2003.1201132 – start-page: 1 year: 0 ident: ref21 article-title: Pricing in information-centric network interconnection publication-title: Proc IFIP Netw Conf – ident: ref17 doi: 10.1016/j.comnet.2012.11.026 – ident: ref12 doi: 10.1109/INFCOM.2009.5061926 – ident: ref31 doi: 10.1038/30918 – ident: ref9 doi: 10.1016/j.jnca.2013.09.003 – ident: ref11 doi: 10.1145/2342488.2342501 – ident: ref19 doi: 10.1109/INFCOM.2009.5062201
SSID	ssj0014504
Score	2.1832745
Snippet	Content caching at intermediate nodes is an effective way to optimize the operations of Computer networks, so that future requests can be served without going...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	3455
SubjectTerms	Algorithm design and analysis Algorithms asymptotic optimality Asymptotic properties Cache storage Caching caching incentive competitive ratio Complexity theory Computer architecture Computer networks Current measurement En-route caching Nodes Optimization Quality of service TCP/IP (protocol) TCPIP
Title	Distributed Online En-Route Caching
URI	https://ieeexplore.ieee.org/document/7442568 https://www.proquest.com/docview/1840191348
Volume	27
WOSCitedRecordID	wos000388896600005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore Digital Libary (IEL) customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD5swwd9cLopzhsFfRK7Nb2leZRd8EHGwAl7K0magCCd7OLvNyfNykARfGofktKe5PScL-fyAdwXgoScFrEvBcv8WBucwtMIT-IUNfYxNKjIFgq_0Ok0WyzYrAGPdS2MUsomn6k-3tpYfrGUWzwqG9DY7LA0a0KT0rSq1aojBnFiqQINukh8ZtTQRTBJwAbz2egVk7jSfohMu9iff88GWVKVH39ia14m7f-92AkcOzfSe6rW_RQaquxAe0fR4DmN7cDRXr_BLtyNsE0uMlypwquajHrj0sesIOUNq7TKM3ibjOfDZ9-xJPjSmOqNL83F-AkyCITRPUk00-YbpaA8iUmgaIJNzgSJVBYSxXWSMuMCclYkigjCtIzOoVUuS3UBXiiEjjThEnGK4lhXnRHKjZNoYFWoix4EO7nl0rUQRyaLj9xCiYDlKOocRZ07UffgoZ7yWfXP-GtwF2VbD3Ri7cH1bnFyp2HrHJEpwbSB7PL3WVdwiM-uUk-uobVZbdUNHMivzft6dWs3zzdtG74n
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKagPTjfF6dSCPondmt7zKLswcY6BE_YW2jQBQTrZxd9vTpqVgSL41D4ktD3J6TlfzuUDuMtS4iZR5ts8pbHtS4VTktDDkzgRKfvoKlSkC4VH0Xgcz2Z0UoGHshZGCKGTz0Qbb3UsP5vzNR6VdSJf7bAw3oFdZM4y1VplzMAPNFmgwheBTZUimhgmcWhnOum9YhpX2HaRaxc79G9ZIU2r8uNfrA3MoPa_VzuGI-NIWo_Fyp9AReR1qG1IGiyjs3U43Oo42IDbHjbKRY4rkVlFm1Grn9uYFySsbpFYeQpvg_60O7QNT4LNlbFe2VxdlKfAHSdV2seJpFJ9I0-jJPCJI6IA25ylxBOxS0Qig5AqJzChWSBISqjk3hlU83kuzsFy01R6kiQckYpIsLI6JlGi3EQFrFyZNcHZyI1x00QcuSw-mAYTDmUoaoaiZkbUTbgvp3wWHTT-GtxA2ZYDjVib0NosDjM6tmSITQkmDsQXv8-6gf3h9GXERk_j50s4wOcUiSgtqK4Wa3EFe_xr9b5cXOuN9A2F88Fw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Online+En-Route+Caching&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Gharaibeh%2C+Ammar&rft.au=Khreishah%2C+Abdallah&rft.au=Khalil%2C+Issa&rft.au=Wu%2C+Jie&rft.date=2016-12-01&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=27&rft.issue=12&rft.spage=3455&rft.epage=3468&rft_id=info:doi/10.1109%2FTPDS.2016.2547396&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TPDS_2016_2547396
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon