Scheduling periodic messages on a shared link
Cloud-RAN is a recent architecture for mobile networks where the processing units are located in distant data centers while, until now, they were attached to antennas. The main challenge, to fulfill protocol constraints, is to guarantee low latency for the periodic messages sent from each antenna to...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
10.11.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Cloud-RAN is a recent architecture for mobile networks where the processing units are located in distant data centers while, until now, they were attached to antennas. The main challenge, to fulfill protocol constraints, is to guarantee low latency for the periodic messages sent from each antenna to its processing unit and back. The problem we address is to find a periodic sending scheme of these messages \emph{without contention nor buffering}, when all messages are of the same size and the period is fixed. We study the periodic message assignment problem modeling this situation on a common topology, where contention arises from a single link shared by all antennas. The problem is reminiscent of coupled-task scheduling, but the periodicity introduces a new twist. We study how the problem behaves with regard to the \emph{load} of the shared link. The main contributions are polynomial-time algorithms which \emph{always} find a solution for an arbitrary size of messages and load at most \(2/5\) or for messages of size one and load at most \(\phi - 1\), the golden ratio conjugate. We also prove that a randomized greedy algorithm finds a solution on almost all instances with high probability, explaining why most greedy algorithms work so well in practice. |
---|---|
AbstractList | Cloud-RAN is a recent architecture for mobile networks where the processing units are located in distant data centers while, until now, they were attached to antennas. The main challenge, to fulfill protocol constraints, is to guarantee low latency for the periodic messages sent from each antenna to its processing unit and back. The problem we address is to find a periodic sending scheme of these messages \emph{without contention nor buffering}, when all messages are of the same size and the period is fixed. We study the periodic message assignment problem modeling this situation on a common topology, where contention arises from a single link shared by all antennas. The problem is reminiscent of coupled-task scheduling, but the periodicity introduces a new twist. We study how the problem behaves with regard to the \emph{load} of the shared link. The main contributions are polynomial-time algorithms which \emph{always} find a solution for an arbitrary size of messages and load at most \(2/5\) or for messages of size one and load at most \(\phi - 1\), the golden ratio conjugate. We also prove that a randomized greedy algorithm finds a solution on almost all instances with high probability, explaining why most greedy algorithms work so well in practice. |
Author | Strozecki, Yann Guiraud, Maël |
Author_xml | – sequence: 1 givenname: Maël surname: Guiraud fullname: Guiraud, Maël – sequence: 2 givenname: Yann surname: Strozecki fullname: Strozecki, Yann |
BookMark | eNqNyrEOwiAUQFFiNLFq_4HEmQR4RbsbjbvuDSnPllqh8uT_7eAHON3hng1bhhhwwQoNoERdab1mJdEgpdSHozYGCiZubY8ujz50fMLko_MtfyGR7ZB4DNxy6m1Cx2fy3LHVw46E5a9btr-c76ermFJ8Z6RPM8ScwrwaDaZWYKBS8J_6AtyfM4Y |
ContentType | Paper |
Copyright | 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
Copyright_xml | – notice: 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central ProQuest Central Essentials AUTh Library subscriptions: ProQuest Central Technology Collection ProQuest One Community College ProQuest Central SciTech Premium Collection (Proquest) (PQ_SDU_P3) ProQuest Engineering Collection Engineering Database Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic Engineering Collection |
DatabaseTitleList | Publicly Available Content Database |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Physics |
EISSN | 2331-8422 |
Genre | Working Paper/Pre-Print |
GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
ID | FETCH-proquest_journals_23581353413 |
IEDL.DBID | BENPR |
IngestDate | Thu Oct 10 16:47:21 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-proquest_journals_23581353413 |
OpenAccessLink | https://www.proquest.com/docview/2358135341?pq-origsite=%requestingapplication% |
PQID | 2358135341 |
PQPubID | 2050157 |
ParticipantIDs | proquest_journals_2358135341 |
PublicationCentury | 2000 |
PublicationDate | 20231110 |
PublicationDateYYYYMMDD | 2023-11-10 |
PublicationDate_xml | – month: 11 year: 2023 text: 20231110 day: 10 |
PublicationDecade | 2020 |
PublicationPlace | Ithaca |
PublicationPlace_xml | – name: Ithaca |
PublicationTitle | arXiv.org |
PublicationYear | 2023 |
Publisher | Cornell University Library, arXiv.org |
Publisher_xml | – name: Cornell University Library, arXiv.org |
SSID | ssj0002672553 |
Score | 3.5108707 |
SecondaryResourceType | preprint |
Snippet | Cloud-RAN is a recent architecture for mobile networks where the processing units are located in distant data centers while, until now, they were attached to... |
SourceID | proquest |
SourceType | Aggregation Database |
SubjectTerms | Algorithms Antennas Data centers Greedy algorithms Messages Network latency Operations research Polynomials Task scheduling Topology |
Title | Scheduling periodic messages on a shared link |
URI | https://www.proquest.com/docview/2358135341 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB5sF8FbfeGjloBeg81rd3sqKLsWoaX4gN7Kzm5SPdit3Xr1t5tZtnoQegyBJAxhZvLNl_kAblAJDKVErox2XDureBw6wa3NjSgiRIMEDYwn4ehVP87MrAHcqoZWufWJtaMuypww8lv60kkaDVoMV5-cVKOoutpIaLQgkEJTmTa4SybTp1-URYaRz5nVP0dbR4-0A8E0W9n1IezZ5RHs16TLvDoG_uwtVhAVfMGo4XBZvOfsgzRJFrZi5ZJlrHojgjijMusJXKfJy_2Ib_eYN_egmv-dWp1C2z_o7RmwPhqnooGwzvS1yxBjn_QUoc0USjnIzDl0d610sXv6Eg5IEp3XVLUutDfrL3vlA-cGe9CK04deYyM_Gn8nPwMSd_0 |
link.rule.ids | 786,790,12792,21416,33406,33777,43633,43838 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT8MwDLZgE4IbT_EYEAmuEWvzaHfigCgFtgmJIe1W1W0yOLCOZfv_q6MODkg7R0osy7Kdz1_yAdyiCFCHIXKhpOXSGsFjbQNuTKGCMkJUSNDAYKjTD_kyVuMGcHMNrXKdE32iLquCMPI7etJJGg0yuJ_9cFKNoulqI6GxDW0ptKA4j5OnX4wl1FHdMYt_adbXjmQf2m_5zMwPYMtMD2HHUy4LdwT8vfZXSUTwCaPvhqvyq2DfpEgyMY5VU5Yz90n0cEZD1mO4SR5HDylfn5E1UeCyP5vFCbTq67w5BdZFZUXUC4xVXWlzxLhueUptcoFh2MvVGXQ27XS-efkadtPRoJ_1n4evF7BH4ujck9Y60FrMl-ayLqELvPJ-WgETcndt |
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+periodic+messages+on+a+shared+link&rft.jtitle=arXiv.org&rft.au=Guiraud%2C+Ma%C3%ABl&rft.au=Strozecki%2C+Yann&rft.date=2023-11-10&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422 |