Scheduling for Multi-Cell Caching: Hit Maximization Subject to Age of Information

In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of information (AoI), and prove the NP-hardness of the problem. For problem solving, we propose a scalable and effective algorithm based on repeated...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 72; no. 9; pp. 12441 - 12446
Main Authors Deng, Tao, Yu, Zhanwei, Yuan, Di
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of information (AoI), and prove the NP-hardness of the problem. For problem solving, we propose a scalable and effective algorithm based on repeated cutting plane (RCP), in which a cutting plane algorithm and a rounding algorithm are implemented iteratively. In addition, we derive a bound that serves as a benchmark of any suboptimal solution. Performance evaluations show that for RCP, the performance gap to optimum is less than 2.5%.
AbstractList In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of information (AoI), and prove the NP-hardness of the problem. For problem solving, we propose a scalable and effective algorithm based on repeated cutting plane (RCP), in which a cutting plane algorithm and a rounding algorithm are implemented iteratively. In addition, we derive a bound that serves as a benchmark of any suboptimal solution. Performance evaluations show that for RCP, the performance gap to optimum is less than 2.5%.
Author Deng, Tao
Yuan, Di
Yu, Zhanwei
Author_xml – sequence: 1
  givenname: Tao
  orcidid: 0000-0003-0122-5247
  surname: Deng
  fullname: Deng, Tao
  email: dengtaoswjtu@foxmail.com
  organization: School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu, China
– sequence: 2
  givenname: Zhanwei
  orcidid: 0000-0001-7306-8354
  surname: Yu
  fullname: Yu, Zhanwei
  email: zhanwei.yu@it.uu.se
  organization: Department of Information Technology, Uppsala University, Uppsala, Sweden
– sequence: 3
  givenname: Di
  orcidid: 0000-0001-8119-5206
  surname: Yuan
  fullname: Yuan, Di
  email: di.yuan@it.uu.se
  organization: Department of Information Technology, Uppsala University, Uppsala, Sweden
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-522678$$DView record from Swedish Publication Index
BookMark eNp9kE1PGzEQhq2KSg209x56sMSVTf29696itBQkUFWRcrW83nFwtFkHr1ct_HoMQQj1wMka-31mPM8hOhjiAAh9pmROKdFfV9erOSOMzzmrCWfsHZpRzXWludQHaEYIbSothfyADsdxU0ohNJ2h31fuBrqpD8Ma-5jw5dTnUC2h7_HSupty_Q2fhYwv7b-wDfc2hzjgq6ndgMs4R7xYA44enw8F3j69fkTvve1H-PR8HqE_pz9Wy7Pq4tfP8-XionKc6VxJ0sq6UZ42QnrqGIW2YYw4yZR1oiO17xrmhYMaJAWnLPBWEl-WU0x0ruNH6GTfd_wLu6k1uxS2Nt2ZaIP5Hq4XJqa1mSYjGVN1U-LH-_guxdsJxmw2cUpD-aFhjVKi0brWJUX2KZfiOCbwL20pMY-eTfFsHj2bZ88FUf8hLuQnEznZ0L8FftmDAQBezSlhqgR_AHT6i-M
CODEN ITVTAB
CitedBy_id crossref_primary_10_1109_TVT_2024_3421351
crossref_primary_10_1109_TWC_2024_3445977
Cites_doi 10.1109/JSAC.2021.3065072
10.1109/MCOM.2014.6736753
10.1109/ICC40277.2020.9148775
10.1109/TWC.2021.3106395
10.1109/TMC.2020.3045104
10.1109/TWC.2020.3022895
10.1109/INFOCOM.2017.8057029
10.1109/TWC.2020.3027596
10.1109/GLOBECOM38437.2019.9013913
10.1016/j.dam.2020.12.010
10.1007/BF02579273
10.1109/WCNC51071.2022.9771681
10.1109/TNET.2020.2980175
10.1109/TWC.2021.3093352
10.1109/ITW46852.2021.9457664
10.1109/JSAC.2018.2844999
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
FR3
KR7
L7M
ADTPV
AOWAS
DF2
DOI 10.1109/TVT.2023.3270322
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
SwePub
SwePub Articles
SWEPUB Uppsala universitet
DatabaseTitle CrossRef
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Civil Engineering Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1939-9359
EndPage 12446
ExternalDocumentID oai_DiVA_org_uu_522678
10_1109_TVT_2023_3270322
10109164
Genre orig-research
GrantInformation_xml – fundername: Vetenskapsrådet; Swedish Research Council
  funderid: 10.13039/501100004359
– fundername: European Commission; European Union
  funderid: 10.13039/501100000780
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAIKC
AAJGR
AAMNW
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
RXW
TAE
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
7SP
8FD
FR3
KR7
L7M
ADTPV
AOWAS
DF2
ID FETCH-LOGICAL-c329t-50b5786f1845f1c21eb8220c526ac4d07fd82f4ce7e51ec6ae3b50f270624dcd3
IEDL.DBID RIE
ISSN 0018-9545
1939-9359
IngestDate Thu Aug 21 06:38:09 EDT 2025
Mon Jun 30 10:01:42 EDT 2025
Tue Jul 01 01:44:22 EDT 2025
Thu Apr 24 23:12:23 EDT 2025
Wed Aug 27 03:05:18 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
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-c329t-50b5786f1845f1c21eb8220c526ac4d07fd82f4ce7e51ec6ae3b50f270624dcd3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7306-8354
0000-0003-0122-5247
0000-0001-8119-5206
PQID 2866489979
PQPubID 85454
PageCount 6
ParticipantIDs crossref_primary_10_1109_TVT_2023_3270322
proquest_journals_2866489979
crossref_citationtrail_10_1109_TVT_2023_3270322
ieee_primary_10109164
swepub_primary_oai_DiVA_org_uu_522678
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-09-01
PublicationDateYYYYMMDD 2023-09-01
PublicationDate_xml – month: 09
  year: 2023
  text: 2023-09-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on vehicular technology
PublicationTitleAbbrev TVT
PublicationYear 2023
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 ref13
ref12
ref14
ref20
ref11
bertsimas (ref19) 1997
ref10
ref2
ahuja (ref17) 1993
ref1
ref16
(ref15) 2020
ref18
ref8
ref9
tang (ref7) 0
ref4
ref3
blaszczyszy (ref21) 0
ref6
ref5
(ref22) 0
References_xml – ident: ref2
  doi: 10.1109/JSAC.2021.3065072
– ident: ref1
  doi: 10.1109/MCOM.2014.6736753
– start-page: 1
  year: 0
  ident: ref7
  article-title: Age of information aware cache updating with file- and age-dependent update durations
  publication-title: Proc 3rd Int Symp Modeling Optimiz Mobile Ad Hoc Wireless Netw
– start-page: 3358
  year: 0
  ident: ref21
  article-title: Optimal geographic caching in cellular networks
  publication-title: Proc IEEE Int Conf Commun
– ident: ref12
  doi: 10.1109/ICC40277.2020.9148775
– year: 0
  ident: ref22
– ident: ref4
  doi: 10.1109/TWC.2021.3106395
– ident: ref5
  doi: 10.1109/TMC.2020.3045104
– ident: ref10
  doi: 10.1109/TWC.2020.3022895
– year: 2020
  ident: ref15
  article-title: 5G wireless access: An overview
– ident: ref20
  doi: 10.1109/INFOCOM.2017.8057029
– ident: ref13
  doi: 10.1109/TWC.2020.3027596
– ident: ref8
  doi: 10.1109/GLOBECOM38437.2019.9013913
– ident: ref16
  doi: 10.1016/j.dam.2020.12.010
– ident: ref18
  doi: 10.1007/BF02579273
– year: 1993
  ident: ref17
  publication-title: Network Flows Theory Algorithms and Applications
– ident: ref11
  doi: 10.1109/WCNC51071.2022.9771681
– year: 1997
  ident: ref19
  publication-title: Introduction to Linear Optimization
– ident: ref9
  doi: 10.1109/TNET.2020.2980175
– ident: ref3
  doi: 10.1109/TWC.2021.3093352
– ident: ref6
  doi: 10.1109/ITW46852.2021.9457664
– ident: ref14
  doi: 10.1109/JSAC.2018.2844999
SSID ssj0014491
Score 2.4214494
Snippet In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of...
SourceID swepub
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 12441
SubjectTerms Age of information
Algorithms
Backhaul networks
Caching
Cutting
cutting plane
Data centers
Data communication
Information age
Maximization
multi-cell caching
NP-hardness
Optimization
Performance evaluation
Problem solving
Scheduling
Symbols
Title Scheduling for Multi-Cell Caching: Hit Maximization Subject to Age of Information
URI https://ieeexplore.ieee.org/document/10109164
https://www.proquest.com/docview/2866489979
https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-522678
Volume 72
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fa9swED7aPrUPXX_SdG3Rw_rQBzuWLMtx30K2EgYtlKYhb8KWTyEsS8Zqw9hf35OthLTQsTeDJSPf6aTvpLvvAL4IhTaPUxNI5EUgE7K5nFBsoGQac1lGymYuOfn-QQ2f5fdJMvHJ6k0uDCI2wWcYusfmLr9cmtodlZGFOxpLJbdhmzy3NllrfWUgpS-Px8mCCRes7iSjrDsaj0JXJjyMBU1wId7sQU1Rlbf4cpMztNln7j7Bw2qEbXjJj7CuitD8fUfe-N-_cAD7HnGyfjtFDmELF0ewt8FDeAyPT6S60sWkTxmBWNZk5QYDnM_ZoA22vGXDWcXu8z-znz5xk9GS485wWLVk_SmypWU-tcm9PYHnu2-jwTDwtRYCE4usCpKoINtVlhy-xHIjOBYEHSKTCJUb0llqy56w0mCKCUejcoyLJLIkTyVkacr4FHYWywWeAbOqkLzneHAyIxXPC1QS0zzNJZcJLREd6K6kr40nInf1MOa6cUiiTJO-tNOX9vrqwM26x6-WhOMfbU-c1DfatQLvwMVKw9qb6YsWPaUkeZxp1oHrVuvrjo53--ts3NekP13X2gHVtHf-wec_w64bRRt9dgE71e8aLwmuVMVVM01fAcHR5Ac
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fb9MwED6N7QH2AAOGVvbLD_DAQ7LYsZ2Gt6pj6mCthOimvVmJc54qSosgkRB__c6JW3VIIN4ixY6c-3z22Xf3HcAbodEVaWYjibyMpCKdK8iKjbTMUi6rRLvcJyePJ3p0LT_eqtuQrN7mwiBiG3yGsX9sffnV0jb-qow03NNYavkIdmjjV7xL11o7DaQMBfI46TA1WHklk_xsejONfaHwOBU0xYV4sAu1ZVUeWpibrKHtTnPxDCarMXYBJl_jpi5j-_sP-sb__ok9eBpsTjboJslz2MLFC9jdYCJ8CZ-_EHiVj0q_Y2TGsjYvNxrifM6GXbjlezaa1Wxc_Jp9C6mbjBYdf4vD6iUb3CFbOhaSm_zbfbi--DAdjqJQbSGyqcjrSCUlaa92dORTjlvBsSTjIbFK6MISapmr-sJJixkqjlYXmJYqcSRPLWRlq_QVbC-WCzwA5nQped8z4eRWal6UqCVmRVZILhUtEj04W0nf2EBF7itizE17JElyQ3gZj5cJePXg3brH946G4x9t973UN9p1Au_B0QphExT1pxF9rSWdObO8B2871NcdPfP2-exmYAg_0zTGm6pZ__VfPn8Kj0fT8ZW5upx8OoQnfkRdLNoRbNc_Gjwm46UuT9opew_PkOdQ
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=Scheduling+for+Multi-Cell+Caching%3A+Hit+Maximization+Subject+to+Age+of+Information&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Deng%2C+Tao&rft.au=Yu%2C+Zhanwei&rft.au=Yuan%2C+Di&rft.date=2023-09-01&rft.issn=0018-9545&rft.eissn=1939-9359&rft.volume=72&rft.issue=9&rft.spage=12441&rft.epage=12446&rft_id=info:doi/10.1109%2FTVT.2023.3270322&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TVT_2023_3270322
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon