Scheduling to Minimize Age of Information With Multiple Sources
Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weig...
Uloženo v:
| Vydáno v: | IEEE journal on selected areas in information theory Ročník 4; s. 539 - 550 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Piscataway
IEEE
2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 2641-8770, 2641-8770 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weighted sum of the AoI of all sources, subject to an energy cost constraint. We propose a novel doubly randomized non-preemptive scheduling algorithm and show that in the non-preemptive setting, where an update under transmission cannot be preempted, the competitive ratio of the proposed algorithm is at most 3 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources. Notably, the competitive ratio is independent of the number of sources, or their service time distributions, and is at most 4 for several common update inter-generation time distributions such as exponential, uniform and Rayleigh. For preemptive setting, where an update under transmission can be preempted, we consider a multi-source G/M/1 system and show that the proposed non-preemptive algorithm has competitive ratio at most 5 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources. |
|---|---|
| AbstractList | Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weighted sum of the AoI of all sources, subject to an energy cost constraint. We propose a novel doubly randomized non-preemptive scheduling algorithm and show that in the non-preemptive setting, where an update under transmission cannot be preempted, the competitive ratio of the proposed algorithm is at most 3 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources. Notably, the competitive ratio is independent of the number of sources, or their service time distributions, and is at most 4 for several common update inter-generation time distributions such as exponential, uniform and Rayleigh. For preemptive setting, where an update under transmission can be preempted, we consider a multi-source G/M/1 system and show that the proposed non-preemptive algorithm has competitive ratio at most 5 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources. |
| Author | Saurav, Kumar Vaze, Rahul |
| Author_xml | – sequence: 1 givenname: Kumar orcidid: 0000-0001-8381-1228 surname: Saurav fullname: Saurav, Kumar email: kumar124103@nitp.ac.in organization: School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India – sequence: 2 givenname: Rahul orcidid: 0000-0002-9712-1110 surname: Vaze fullname: Vaze, Rahul email: rahul.vaze@gmail.com organization: School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India |
| BookMark | eNpNkE1PAjEQhhuDiYj8AeOhiefFfu22ezKEiGIgHsB4bHbLFEqWFru7B_31LsKB00wm7zMzeW5RzwcPCN1TMqKU5E_vy_FsNWKE8RHnjBEpr1CfZYImSkrSu-hv0LCud4QQxqiQSvbR89JsYd1Wzm9wE_DCebd3v4DHG8DB4pm3Ie6LxgWPv1yzxYu2atyhArwMbTRQ36FrW1Q1DM91gD6nL6vJWzL_eJ1NxvPEMCGbxGRlVtoSMpqWUlChrFQEaJoysLlVuSJUCWmFsYWxhHczKcucGmJzka4t4wP0eNp7iOG7hbrRu-4B353UTCmaMpFR0qXYKWViqOsIVh-i2xfxR1Oij670vyt9dKXPrjro4QQ5ALgAmOJKZvwPceJmTQ |
| CODEN | IJSTL5 |
| Cites_doi | 10.1109/SFFCS.1999.814632 10.1007/978-3-030-87473-5_7 10.1145/3379477 10.1109/TMC.2019.2959774 10.1109/ISIT.2014.6875100 10.1287/moor.22.3.513 10.1145/3230543.3230569 10.1109/INFCOM.2012.6195689 10.1002/j.1538-7305.1966.tb01709.x 10.1109/INFOCOM42981.2021.9488746 10.1109/TIT.2017.2735804 10.1016/0166-5316(81)90014-6 10.1109/INFCOMW.2018.8406909 10.1007/s11134-005-0359-y 10.1109/CISS.2012.6310931 10.1016/j.peva.2018.10.001 10.1016/j.jcss.2006.10.018 10.1109/TWC.2020.3025630 10.1109/TNET.2018.2845852 10.1109/JCN.2019.000035 10.1109/TNET.2019.2918736 10.1109/JSAC.2021.3065048 10.23919/WiOpt56218.2022.9930540 10.1109/TIT.2018.2871079 10.1007/s11134-005-2898-7 10.1109/TIT.2019.2938171 10.1145/3323165.3323179 10.1109/INFOCOMWKSHPS50562.2020.9162726 10.1016/j.tcs.2019.07.026 10.1109/ISIT44484.2020.9174099 10.1137/1.9781611973068.134 10.1109/TIT.2019.2963035 10.1109/INFCOMW.2019.8845106 10.1287/opre.16.3.687 10.1109/TNET.2018.2873606 10.23919/WiOpt52861.2021.9589182 |
| 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 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/JSAIT.2023.3322077 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET 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 Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2641-8770 |
| EndPage | 550 |
| ExternalDocumentID | 10_1109_JSAIT_2023_3322077 10283876 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Department of Atomic Energy, Government of India grantid: RTI4001 funderid: 10.13039/501100001502 |
| GroupedDBID | 0R~ 97E AAJGR AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD IFIPE JAVBF OCL RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c247t-c6b6bfbe615b74148f780e1552ef9f89801847f4cfacf03f9f77b91c0f945df23 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001395977100042&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2641-8770 |
| IngestDate | Mon Jun 30 02:46:49 EDT 2025 Sat Nov 29 05:41:02 EST 2025 Wed Aug 27 02:12:12 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| 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-c247t-c6b6bfbe615b74148f780e1552ef9f89801847f4cfacf03f9f77b91c0f945df23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9712-1110 0000-0001-8381-1228 |
| PQID | 2881524610 |
| PQPubID | 5075791 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_2881524610 crossref_primary_10_1109_JSAIT_2023_3322077 ieee_primary_10283876 |
| PublicationCentury | 2000 |
| PublicationDate | 20230000 2023-00-00 20230101 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – year: 2023 text: 20230000 |
| PublicationDecade | 2020 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE journal on selected areas in information theory |
| PublicationTitleAbbrev | JSAIT |
| 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 ref15 ref37 ref14 ref36 ref31 ref30 ref33 ref10 ref32 ref2 ref1 abd-elmagid (ref11) 2021 ref17 ref39 ref38 ref19 ref18 saurav (ref16) 2022 cox (ref35) 1991; 2 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 bhimaraju (ref34) 2020 |
| References_xml | – ident: ref30 doi: 10.1109/SFFCS.1999.814632 – ident: ref12 doi: 10.1007/978-3-030-87473-5_7 – ident: ref23 doi: 10.1145/3379477 – ident: ref19 doi: 10.1109/TMC.2019.2959774 – ident: ref6 doi: 10.1109/ISIT.2014.6875100 – ident: ref27 doi: 10.1287/moor.22.3.513 – start-page: 1 year: 2020 ident: ref34 article-title: Non-clairvoyant scheduling of coflows publication-title: Proc Int Symp Model Optim Mobile Ad-Hoc Wireless Netw (WiOpt) – ident: ref32 doi: 10.1145/3230543.3230569 – ident: ref2 doi: 10.1109/INFCOM.2012.6195689 – ident: ref29 doi: 10.1002/j.1538-7305.1966.tb01709.x – ident: ref15 doi: 10.1109/INFOCOM42981.2021.9488746 – ident: ref13 doi: 10.1109/TIT.2017.2735804 – ident: ref37 doi: 10.1016/0166-5316(81)90014-6 – ident: ref7 doi: 10.1109/INFCOMW.2018.8406909 – ident: ref38 doi: 10.1007/s11134-005-0359-y – ident: ref5 doi: 10.1109/CISS.2012.6310931 – ident: ref24 doi: 10.1016/j.peva.2018.10.001 – ident: ref25 doi: 10.1016/j.jcss.2006.10.018 – year: 2021 ident: ref11 article-title: Age of information in multi-source updating systems powered by energy harvesting publication-title: arXiv 2109 07605 – ident: ref20 doi: 10.1109/TWC.2020.3025630 – ident: ref31 doi: 10.1109/TNET.2018.2845852 – ident: ref14 doi: 10.1109/JCN.2019.000035 – year: 2022 ident: ref16 article-title: 3-competitive policy for minimizing age of information in multi-source M/G/1 queuing model publication-title: arXiv 2201 03502 – ident: ref18 doi: 10.1109/TNET.2019.2918736 – ident: ref21 doi: 10.1109/JSAC.2021.3065048 – ident: ref1 doi: 10.23919/WiOpt56218.2022.9930540 – ident: ref9 doi: 10.1109/TIT.2018.2871079 – ident: ref39 doi: 10.1007/s11134-005-2898-7 – ident: ref8 doi: 10.1109/TIT.2019.2938171 – volume: 2 year: 1991 ident: ref35 publication-title: Queues – ident: ref33 doi: 10.1145/3323165.3323179 – ident: ref3 doi: 10.1109/INFOCOMWKSHPS50562.2020.9162726 – ident: ref28 doi: 10.1016/j.tcs.2019.07.026 – ident: ref10 doi: 10.1109/ISIT44484.2020.9174099 – ident: ref26 doi: 10.1137/1.9781611973068.134 – ident: ref40 doi: 10.1109/TIT.2019.2963035 – ident: ref36 doi: 10.1109/INFCOMW.2019.8845106 – ident: ref22 doi: 10.1287/opre.16.3.687 – ident: ref17 doi: 10.1109/TNET.2018.2873606 – ident: ref4 doi: 10.23919/WiOpt52861.2021.9589182 |
| SSID | ssj0002214787 |
| Score | 2.2470438 |
| Snippet | Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 539 |
| SubjectTerms | Age of information Algorithms competitive ratio Costs Energy costs Monitoring Optimal scheduling Preempting Scheduling Scheduling algorithms Stochastic processes Upper bound |
| Title | Scheduling to Minimize Age of Information With Multiple Sources |
| URI | https://ieeexplore.ieee.org/document/10283876 https://www.proquest.com/docview/2881524610 |
| Volume | 4 |
| WOSCitedRecordID | wos001395977100042&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 Electronic Library (IEL) customDbUrl: eissn: 2641-8770 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002214787 issn: 2641-8770 databaseCode: RIE dateStart: 20200101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5s8eDF-qhYrbIHb5I22ST7OBaxqNAitGJvofuqOZhIm3rw17u72YgiHryFkITwzU7m28nMfABc0SiSOo54gKgOgySNl4EhRzjAS50yxpNUMu7EJsh0ShcL9uib1V0vjFLKFZ-pgT10__JlKbY2VTZ0wdC4bwu0CMF1s9ZXQgVZxR1KmsaYkA0fZqP7-cDqgw9is25DQn4EH6em8usT7OLKuPPPNzoA-55AwlFt8UOwo4oj0GnEGaD31WPDwo05pK0zX8GqhJO8yF_zDwVHKwVLDX0bkjULfM6rFzjxlYVw5tL5my54Gt_Ob-4Cr5YQCJSQKhCYY665MhSFG5qQUE1oqOyENaWZpsyEIhOJdCL0UugwNucI4SwSoWbGIhrFJ6BdlIU6BRClSsgESRe8pUpoyhFOlZYYK7M_0j1w3cCYvdVDMTK3mQhZ5kDPLOiZB70Huha4b1fWmPVAv4E-846zyRClhlHYIfBnf9x2Dvbs0-s0SB-0q_VWXYBd8V7lm_WlWxOfm021RQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4UTfQi_owoag_ezGDrurU9EiMBBWICRm4NXVvcwc3A8OBfb9sNozEevC3Lli3f69v7-vbe-wC4pkEgdRgID1HtezgKZ54hR7EXz3TEmMCRZMKJTZDRiE6n7LFqVne9MEopV3ymWvbQ_cuXebKyqbK2C4bGfTfBVoQx8st2ra-UCrKaO5SsW2N81r4fd_qTllUIb4Vm5fqE_Ag_Tk_l10fYRZZu_Z_vtA_2KgoJO6XND8CGyg5BfS3PACtvPTI83BhE2krzOSxyOEyz9DX9ULAzVzDXsGpEsoaBz2nxAodVbSEcu4T-8hg8de8mtz2v0kvwEoRJ4SWxiIUWypAUYYgCpppQX9kZa0ozTZkJRiYWaZzoWaL90JwjRLAg8TUzNtEoPAG1LM_UKYAoUonESLrwLRWmkUBxpLSMY2V2SLoBbtYw8rdyLAZ32wmfcQc6t6DzCvQGOLbAfbuyxKwBmmvoeeU6S44oNZzCjoE_--O2K7DTmwwHfNAfPZyDXfukMinSBLVisVIXYDt5L9Ll4tKtj0825biM |
| 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+to+Minimize+Age+of+Information+With+Multiple+Sources&rft.jtitle=IEEE+journal+on+selected+areas+in+information+theory&rft.au=Saurav%2C+Kumar&rft.au=Vaze%2C+Rahul&rft.date=2023&rft.pub=IEEE&rft.eissn=2641-8770&rft.volume=4&rft.spage=539&rft.epage=550&rft_id=info:doi/10.1109%2FJSAIT.2023.3322077&rft.externalDocID=10283876 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2641-8770&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2641-8770&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2641-8770&client=summon |