首页 > 最新文献

IEEE Networking Letters最新文献

英文 中文
IEEE COMMUNICATIONS SOCIETY IEEE 通信学会
Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401267
{"title":"IEEE COMMUNICATIONS SOCIETY","authors":"","doi":"10.1109/LNET.2024.3401267","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401267","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551662","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Communications Society 电气和电子工程师学会通信协会
Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401331
{"title":"IEEE Communications Society","authors":"","doi":"10.1109/LNET.2024.3401331","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401331","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"C3-C3"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551674","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Networking Letters Author Guidelines IEEE Networking Letters 作者指南
Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401329
{"title":"IEEE Networking Letters Author Guidelines","authors":"","doi":"10.1109/LNET.2024.3401329","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401329","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"156-157"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551677","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing Mobile Networks for Urban Air Mobility Connectivity 增强移动网络的城市空中交通连接性
Pub Date : 2024-04-17 DOI: 10.1109/LNET.2024.3390610
Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi
Aerial technologies represent a fundamental part of transport systems, and the overload of terrestrial transportation as well as the high demand in urban scenarios are forcing for new solutions. From this perspective, Urban Air Mobility (UAM) is emerging as an outperforming solution to guarantee high-speed vertical transportation taking advantage of low altitudes. Connectivity is a key factor for UAM vehicles, and mobile networks represent the best solution to provide immediate connectivity with high-performance and low expenses. This calls for the development of enhancement strategies for terrestrial radio access networks. This letter aims to investigate a strategy to provide connectivity for UAM vehicles while minimizing the number of base stations required to provide UAM connectivity. Insights on the impact of different design parameters on the number of enhanced BSs required to guarantee average and minimum throughput requirements for UAM users are provided.
航空技术是运输系统的重要组成部分,地面运输的超负荷以及城市的高需求迫使人们寻求新的解决方案。从这一角度来看,城市空中交通(UAM)正在成为一种出色的解决方案,可利用低空优势确保高速垂直运输。连接性是 UAM 车辆的关键因素,而移动网络是提供高性能、低成本即时连接的最佳解决方案。这就需要为地面无线接入网络制定增强战略。这封信旨在研究一种战略,在为 UAM 车辆提供连接的同时,尽量减少提供 UAM 连接所需的基站数量。本文深入探讨了不同设计参数对保证 UAM 用户平均和最低吞吐量要求所需的增强型基站数量的影响。
{"title":"Enhancing Mobile Networks for Urban Air Mobility Connectivity","authors":"Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi","doi":"10.1109/LNET.2024.3390610","DOIUrl":"https://doi.org/10.1109/LNET.2024.3390610","url":null,"abstract":"Aerial technologies represent a fundamental part of transport systems, and the overload of terrestrial transportation as well as the high demand in urban scenarios are forcing for new solutions. From this perspective, Urban Air Mobility (UAM) is emerging as an outperforming solution to guarantee high-speed vertical transportation taking advantage of low altitudes. Connectivity is a key factor for UAM vehicles, and mobile networks represent the best solution to provide immediate connectivity with high-performance and low expenses. This calls for the development of enhancement strategies for terrestrial radio access networks. This letter aims to investigate a strategy to provide connectivity for UAM vehicles while minimizing the number of base stations required to provide UAM connectivity. Insights on the impact of different design parameters on the number of enhanced BSs required to guarantee average and minimum throughput requirements for UAM users are provided.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"110-114"},"PeriodicalIF":0.0,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10504640","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services 基于安全私有区块链的社交媒体服务即时通讯平台
Pub Date : 2024-04-10 DOI: 10.1109/LNET.2024.3386974
Marc Jayson Baucas;Petros Spachos
Social media services enable global communication via instant messaging (IM) platforms. However, their widespread usage has resulted in server regulation issues because most are centralized, while they also pose privacy concerns due to endpoint-based security vulnerabilities. In response, we present a private blockchain-based IM platform that utilizes blockchains to secure data through immutability. We implement it in a RESTful Application Programming Interface (REST API) Web server for better load balancing compared to the centralized IM architectures via decentralization. We further implement end-to-end encryption (E2EE) using public-private key pairs to improve data privacy. We evaluated the proposed design by highlighting its advantages over centralized IM platforms.
社交媒体服务通过即时信息(IM)平台实现了全球通信。然而,由于大多数即时通讯平台都是集中式的,其广泛使用导致了服务器监管问题,同时由于基于终端的安全漏洞,也带来了隐私问题。为此,我们提出了一个基于区块链的私人即时通讯平台,该平台利用区块链通过不变性来确保数据安全。我们在 RESTful 应用编程接口(REST API)Web 服务器中实现了该平台,通过去中心化实现了比集中式即时通讯架构更好的负载平衡。我们还进一步使用公私密钥对实现了端到端加密(E2EE),以提高数据的私密性。我们对所提出的设计进行了评估,强调了它与集中式即时通讯平台相比的优势。
{"title":"Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services","authors":"Marc Jayson Baucas;Petros Spachos","doi":"10.1109/LNET.2024.3386974","DOIUrl":"https://doi.org/10.1109/LNET.2024.3386974","url":null,"abstract":"Social media services enable global communication via instant messaging (IM) platforms. However, their widespread usage has resulted in server regulation issues because most are centralized, while they also pose privacy concerns due to endpoint-based security vulnerabilities. In response, we present a private blockchain-based IM platform that utilizes blockchains to secure data through immutability. We implement it in a RESTful Application Programming Interface (REST API) Web server for better load balancing compared to the centralized IM architectures via decentralization. We further implement end-to-end encryption (E2EE) using public-private key pairs to improve data privacy. We evaluated the proposed design by highlighting its advantages over centralized IM platforms.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"106-109"},"PeriodicalIF":0.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks DSND:多服务切片网络的延迟敏感型网络设计方案
Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385008
Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.
本文为多业务切片网络提出了一种对延迟敏感的网络设计方案--DSND。DSND 为虚拟处理系统做出了贡献,在该系统中,用户可以共享相同的应用空间,而不受距离相关延迟的影响。DSND 引入了服务切片和服务虚拟时间的概念。服务片是由用户和服务器节点组成的虚拟网络。服务虚拟时间是消除距离造成的延迟差异的时间,用户的事件按发生顺序重新排序。当前时间与服务虚拟时间之差就是同一服务片内所有用户共享的端到端延迟。我们将 DSND 表述为一个整数线性规划问题,并比较了 DSND 与每个用户选择最近服务器的基准方案之间的延迟。数值结果表明,与基准方案相比,DSND 可将延迟降低 4-38%。
{"title":"DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks","authors":"Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki","doi":"10.1109/LNET.2024.3385008","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385008","url":null,"abstract":"This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"143-147"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Price-Discrimination Game for Distributed Resource Management in Federated Learning 联合学习中分布式资源管理的价格歧视博弈
Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385679
Han Zhang;Halvin Yang;Guopeng Zhang
In federated learning (FL) systems, the parameter server (PS) and clients form a monopolistic market, where the number of PS is far less than the number of clients. To improve the performance of FL and reduce the cost to incentive clients, this letter suggests distinguishing the pricing of FL services provided by different clients, rather than applying the same pricing to them. The price is differentiated based on the performance improvements brought to FL by clients and their heterogeneity in computing and communication capabilities. To this end, a price-discrimination game (PDG) is formulated to comprehensively address the distributed resource management problems in FL, including multi-objective trade-off, client selection, and incentive mechanism. As the PDG includes a mixed-integer nonlinear programming problem, a distributed semi-heuristic algorithm with low computational complexity and low communication overhead is designed to solve the Nash equilibrium (NE) of the PDG. The simulation result verifies that the NE achieves a good tradeoff between the training loss, training time, and the cost of motivating clients to participate in FL.
在联合学习(FL)系统中,参数服务器(PS)和客户端构成了一个垄断市场,PS的数量远远少于客户端的数量。为了提高联合学习系统的性能,降低激励客户的成本,本信建议对不同客户提供的联合学习服务进行区分定价,而不是对它们采用相同的定价。根据客户为 FL 带来的性能改进及其计算和通信能力的异质性来区分价格。为此,我们提出了一个价格歧视博弈(PDG),以全面解决 FL 中的分布式资源管理问题,包括多目标权衡、客户选择和激励机制。由于 PDG 包括一个混合整数非线性编程问题,因此设计了一种计算复杂度低、通信开销小的分布式半启发式算法来求解 PDG 的纳什均衡(NE)。仿真结果验证了纳什均衡在训练损失、训练时间和激励客户参与 FL 的成本之间实现了良好的权衡。
{"title":"Price-Discrimination Game for Distributed Resource Management in Federated Learning","authors":"Han Zhang;Halvin Yang;Guopeng Zhang","doi":"10.1109/LNET.2024.3385679","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385679","url":null,"abstract":"In federated learning (FL) systems, the parameter server (PS) and clients form a monopolistic market, where the number of PS is far less than the number of clients. To improve the performance of FL and reduce the cost to incentive clients, this letter suggests distinguishing the pricing of FL services provided by different clients, rather than applying the same pricing to them. The price is differentiated based on the performance improvements brought to FL by clients and their heterogeneity in computing and communication capabilities. To this end, a price-discrimination game (PDG) is formulated to comprehensively address the distributed resource management problems in FL, including multi-objective trade-off, client selection, and incentive mechanism. As the PDG includes a mixed-integer nonlinear programming problem, a distributed semi-heuristic algorithm with low computational complexity and low communication overhead is designed to solve the Nash equilibrium (NE) of the PDG. The simulation result verifies that the NE achieves a good tradeoff between the training loss, training time, and the cost of motivating clients to participate in FL.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"124-128"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance Analysis of Slotted-Aloha With Mandatory Access and Retries in a Finite Frame 有限框架中带有强制访问和重试功能的插槽-Aloha 性能分析
Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385661
Diogo Pereira;Rodolfo Oliveira;Daniel Benevides da Costa;Hyong Kim
In recent medium access control (MAC) protocols, such as the ones adopted in IEEE 802.11ad and IEEE 802.11ay, stations mandatorily access one of the $N_{S} gt 0 $ consecutive slots forming a frame. This can be seen as a variant of the traditional slotted-aloha (SA), where instead of accessing a slot with probability p and not accessing in the finite frame with probability $(1-p)^{N_{S}}$ , a station always accesses at least once in a frame, i.e., stations mandatorily access in a frame’s slot. Additionally, a station can also perform multiple retries in the frame when the previous attempt did not succeed. Given the lack of modeling efforts and performance evaluation for SA schemes with mandatory access and retries (SAMAR), in this letter, we evaluate the expected number of stations that can successfully access the channel in a frame composed of a finite number of slots. Contrarily to SA, the analysis of SAMAR performance is challenging due to its enumerative nature. We propose an innovative recursive model of SAMAR performance, showing that SAMAR can achieve higher performance than that of SA parameterized with asymptotically optimal access probabilities. A comparative analysis shows the operational region where SAMAR overpasses SA’s performance, which is of crucial importance to define the number of slots of the SAMAR frame.
在最近的介质访问控制(MAC)协议中,例如在 IEEE 802.11ad 和 IEEE 802.11ay 中采用的协议,站点必须访问构成帧的 $N_{S}gt 0 $ 连续时隙中的一个。这可以看作是传统插槽式网络(SA)的一种变体,在这种变体中,一个站不是以概率 p 访问一个插槽,而是以概率 $(1-p)^{N_{S}}$ 在有限帧中不访问,在一个帧中总是至少访问一次,也就是说,站必须在一个帧的插槽中访问。此外,如果上一次尝试不成功,站点还可以在帧中进行多次重试。鉴于目前缺乏对强制接入和重试的 SA 方案(SAMAR)的建模工作和性能评估,我们在这封信中评估了在由有限个时隙组成的帧中能成功接入信道的台站的预期数量。与 SA 不同,SAMAR 的性能分析因其枚举性而具有挑战性。我们提出了一种创新的 SAMAR 性能递归模型,表明 SAMAR 可以达到比以渐近最优接入概率为参数的 SA 更高的性能。对比分析表明了 SAMAR 性能超过 SA 性能的运行区域,这对确定 SAMAR 框架的时隙数至关重要。
{"title":"Performance Analysis of Slotted-Aloha With Mandatory Access and Retries in a Finite Frame","authors":"Diogo Pereira;Rodolfo Oliveira;Daniel Benevides da Costa;Hyong Kim","doi":"10.1109/LNET.2024.3385661","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385661","url":null,"abstract":"In recent medium access control (MAC) protocols, such as the ones adopted in IEEE 802.11ad and IEEE 802.11ay, stations mandatorily access one of the \u0000<inline-formula> <tex-math>$N_{S} gt 0 $ </tex-math></inline-formula>\u0000 consecutive slots forming a frame. This can be seen as a variant of the traditional slotted-aloha (SA), where instead of accessing a slot with probability p and not accessing in the finite frame with probability \u0000<inline-formula> <tex-math>$(1-p)^{N_{S}}$ </tex-math></inline-formula>\u0000, a station always accesses at least once in a frame, i.e., stations mandatorily access in a frame’s slot. Additionally, a station can also perform multiple retries in the frame when the previous attempt did not succeed. Given the lack of modeling efforts and performance evaluation for SA schemes with mandatory access and retries (SAMAR), in this letter, we evaluate the expected number of stations that can successfully access the channel in a frame composed of a finite number of slots. Contrarily to SA, the analysis of SAMAR performance is challenging due to its enumerative nature. We propose an innovative recursive model of SAMAR performance, showing that SAMAR can achieve higher performance than that of SA parameterized with asymptotically optimal access probabilities. A comparative analysis shows the operational region where SAMAR overpasses SA’s performance, which is of crucial importance to define the number of slots of the SAMAR frame.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"101-105"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparing HAProxy Scheduling Algorithms During the DDoS Attacks 比较 DDoS 攻击期间的 HAProxy 调度算法
Pub Date : 2024-04-01 DOI: 10.1109/LNET.2024.3383601
Anmol Kumar;Gaurav Somani;Mayank Agarwal
Web-services have become most common IT enablers today. Cyber attacks such as the distributed denial of service (DDoS) attacks pose availability concerns which may result into service outages and consequently financial and reputation losses. Load balancing software such as HAProxy (high availability proxy) is an important building block of the Web service delivery today. Load balancing software provides incoming request distribution among Web-servers and admission control which may even help with combating DDoS attacks. In this letter, we study and explore the performance of different load distribution or scheduling strategies in the presence of DDoS attacks. With the help of attack experiments, we find that First, HDR, Source, and URI scheduling algorithms performs best for both static and Poisson arrivals.
网络服务已成为当今最常见的 IT 手段。分布式拒绝服务(DDoS)攻击等网络攻击带来了可用性问题,可能导致服务中断,进而造成经济和声誉损失。负载平衡软件,如 HAProxy(高可用性代理),是当今网络服务交付的重要组成部分。负载均衡软件可在网络服务器之间分配接收到的请求,并进行接纳控制,甚至可帮助打击 DDoS 攻击。在这封信中,我们研究并探讨了在 DDoS 攻击情况下不同负载分配或调度策略的性能。在攻击实验的帮助下,我们发现 First、HDR、Source 和 URI 调度算法在静态和泊松到达情况下都表现最佳。
{"title":"Comparing HAProxy Scheduling Algorithms During the DDoS Attacks","authors":"Anmol Kumar;Gaurav Somani;Mayank Agarwal","doi":"10.1109/LNET.2024.3383601","DOIUrl":"https://doi.org/10.1109/LNET.2024.3383601","url":null,"abstract":"Web-services have become most common IT enablers today. Cyber attacks such as the distributed denial of service (DDoS) attacks pose availability concerns which may result into service outages and consequently financial and reputation losses. Load balancing software such as HAProxy (high availability proxy) is an important building block of the Web service delivery today. Load balancing software provides incoming request distribution among Web-servers and admission control which may even help with combating DDoS attacks. In this letter, we study and explore the performance of different load distribution or scheduling strategies in the presence of DDoS attacks. With the help of attack experiments, we find that First, HDR, Source, and URI scheduling algorithms performs best for both static and Poisson arrivals.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"139-142"},"PeriodicalIF":0.0,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Necessary and Sufficient Condition for Triggering ECN Before PFC in Shared Memory Switches 共享内存开关中 PFC 前触发 ECN 的必要条件和充分条件
Pub Date : 2024-03-28 DOI: 10.1109/LNET.2024.3382955
Natchanon Luangsomboon;Jörg Liebeherr
Flow control in a data center network (DCN) prevents packet losses by pausing transmissions from upstream switches, whereas congestion control prevents network overload by regulating traffic sources. For two widely deployed flow and congestion control algorithms, namely PFC and DCQCN, we derive a necessary and sufficient condition that ensures that congestion control mechanisms in a shared-memory switch are triggered before flow control. The condition creates an imbalance of buffer requirements at the ingress and egress of a switch. For fair queuing and priority scheduling at the egress, we present traffic scenarios that saturate the condition. The lack of such traffic scenarios for FIFO scheduling suggests that choosing appropriate schedulers may help reducing minimal buffer requirements.
数据中心网络(DCN)中的流量控制通过暂停上游交换机的传输来防止数据包丢失,而拥塞控制则通过调节流量源来防止网络过载。对于两种广泛部署的流量和拥塞控制算法,即 PFC 和 DCQCN,我们推导出一个必要条件和充分条件,确保共享内存交换机中的拥塞控制机制在流量控制之前触发。该条件造成了交换机入口和出口缓冲区需求的不平衡。对于出口处的公平队列和优先级调度,我们提出了使该条件达到饱和的流量场景。先进先出调度缺乏此类流量场景,这表明选择适当的调度器可能有助于减少对缓冲区的最小需求。
{"title":"Necessary and Sufficient Condition for Triggering ECN Before PFC in Shared Memory Switches","authors":"Natchanon Luangsomboon;Jörg Liebeherr","doi":"10.1109/LNET.2024.3382955","DOIUrl":"https://doi.org/10.1109/LNET.2024.3382955","url":null,"abstract":"Flow control in a data center network (DCN) prevents packet losses by pausing transmissions from upstream switches, whereas congestion control prevents network overload by regulating traffic sources. For two widely deployed flow and congestion control algorithms, namely PFC and DCQCN, we derive a necessary and sufficient condition that ensures that congestion control mechanisms in a shared-memory switch are triggered before flow control. The condition creates an imbalance of buffer requirements at the ingress and egress of a switch. For fair queuing and priority scheduling at the egress, we present traffic scenarios that saturate the condition. The lack of such traffic scenarios for FIFO scheduling suggests that choosing appropriate schedulers may help reducing minimal buffer requirements.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"119-123"},"PeriodicalIF":0.0,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
IEEE Networking Letters
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1