无需缓冲即可在共享链路上调度定期信息

IF 1.4 4区 工程技术 Q4 ENGINEERING, MANUFACTURING
Maël Guiraud, Yann Strozecki
{"title":"无需缓冲即可在共享链路上调度定期信息","authors":"Maël Guiraud, Yann Strozecki","doi":"10.1007/s10951-024-00813-0","DOIUrl":null,"url":null,"abstract":"<p>Cloud RAN, a novel architecture for modern mobile networks, relocates processing units from antenna to distant data centers. This shift introduces the challenge of ensuring low latency for the periodic messages exchanged between antennas and their respective processing units. In this study, we tackle the problem of devising an efficient periodic message assignment scheme under the constraints of fixed message size and period <i>without contention nor buffering</i>. We address this problem by modeling it on a common network topology, wherein contention arises from a single shared link servicing multiple antennas. While reminiscent of coupled task scheduling, the introduction of periodicity adds a unique dimension to the problem. We study how the problem behaves with regard to the <i>load</i> of the shared link, and we focus on proving that, for load as high as possible, a solution <i>always</i> exists and it can be found in polynomial time. The main contributions of this article are two polynomial time algorithms, which find a solution for messages of any size and load at most 2/5 or for messages of size one and load at most <span>\\(\\phi - 1\\)</span>, the golden ratio conjugate. We also prove that a randomized greedy algorithm finds a solution on almost all instances with high probability, shedding light on the effectiveness of greedy algorithms in practical applications.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling periodic messages on a shared link without buffering\",\"authors\":\"Maël Guiraud, Yann Strozecki\",\"doi\":\"10.1007/s10951-024-00813-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Cloud RAN, a novel architecture for modern mobile networks, relocates processing units from antenna to distant data centers. This shift introduces the challenge of ensuring low latency for the periodic messages exchanged between antennas and their respective processing units. In this study, we tackle the problem of devising an efficient periodic message assignment scheme under the constraints of fixed message size and period <i>without contention nor buffering</i>. We address this problem by modeling it on a common network topology, wherein contention arises from a single shared link servicing multiple antennas. While reminiscent of coupled task scheduling, the introduction of periodicity adds a unique dimension to the problem. We study how the problem behaves with regard to the <i>load</i> of the shared link, and we focus on proving that, for load as high as possible, a solution <i>always</i> exists and it can be found in polynomial time. The main contributions of this article are two polynomial time algorithms, which find a solution for messages of any size and load at most 2/5 or for messages of size one and load at most <span>\\\\(\\\\phi - 1\\\\)</span>, the golden ratio conjugate. We also prove that a randomized greedy algorithm finds a solution on almost all instances with high probability, shedding light on the effectiveness of greedy algorithms in practical applications.</p>\",\"PeriodicalId\":50061,\"journal\":{\"name\":\"Journal of Scheduling\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Scheduling\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1007/s10951-024-00813-0\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-024-00813-0","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

摘要

云 RAN 是现代移动网络的一种新型架构,它将处理单元从天线迁移到遥远的数据中心。这种转移带来了一个挑战,即如何确保天线与各自处理单元之间的周期性信息交换具有较低的延迟。在本研究中,我们要解决的问题是,在固定信息大小和周期的约束下,设计一种既无争用又无缓冲的高效定期信息分配方案。我们通过在普通网络拓扑结构上建模来解决这个问题,其中争用产生于为多个天线提供服务的单个共享链路。虽然让人联想到耦合任务调度,但周期性的引入为问题增添了一个独特的维度。我们研究了该问题在共享链路负载方面的表现,并重点证明了在负载尽可能高的情况下,解决方案总是存在的,而且可以在多项式时间内找到。本文的主要贡献在于两个多项式时间算法,它们可以为任意大小的信息和最多 2/5 的负载,或者为大小为 1 的信息和最多 \(\phi - 1\)的负载(黄金比率共轭)找到一个解决方案。我们还证明了一种随机贪婪算法几乎能在所有情况下都高概率地找到解,从而揭示了贪婪算法在实际应用中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Scheduling periodic messages on a shared link without buffering

Scheduling periodic messages on a shared link without buffering

Cloud RAN, a novel architecture for modern mobile networks, relocates processing units from antenna to distant data centers. This shift introduces the challenge of ensuring low latency for the periodic messages exchanged between antennas and their respective processing units. In this study, we tackle the problem of devising an efficient periodic message assignment scheme under the constraints of fixed message size and period without contention nor buffering. We address this problem by modeling it on a common network topology, wherein contention arises from a single shared link servicing multiple antennas. While reminiscent of coupled task scheduling, the introduction of periodicity adds a unique dimension to the problem. We study how the problem behaves with regard to the load of the shared link, and we focus on proving that, for load as high as possible, a solution always exists and it can be found in polynomial time. The main contributions of this article are two polynomial time algorithms, which find a solution for messages of any size 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, shedding light on the effectiveness of greedy algorithms in practical applications.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Scheduling
Journal of Scheduling 工程技术-工程:制造
CiteScore
3.80
自引率
10.00%
发文量
49
审稿时长
6-12 weeks
期刊介绍: The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信