IEEE Networking Letters最新文献

筛选
英文 中文
Performance Analysis of Slotted-Aloha With Mandatory Access and Retries in a Finite Frame 有限框架中带有强制访问和重试功能的插槽-Aloha 性能分析
IEEE Networking Letters Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385661
Diogo Pereira;Rodolfo Oliveira;Daniel Benevides da Costa;Hyong Kim
{"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 调度算法
IEEE Networking Letters Pub Date : 2024-04-01 DOI: 10.1109/LNET.2024.3383601
Anmol Kumar;Gaurav Somani;Mayank Agarwal
{"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 的必要条件和充分条件
IEEE Networking Letters Pub Date : 2024-03-28 DOI: 10.1109/LNET.2024.3382955
Natchanon Luangsomboon;Jörg Liebeherr
{"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
DDoS Mitigation in IoT Using Machine Learning and Blockchain Integration 利用机器学习和区块链集成缓解物联网中的 DDoS
IEEE Networking Letters Pub Date : 2024-03-18 DOI: 10.1109/LNET.2024.3377355
Ammar Ibrahim El Sayed;Mahmoud Abdelaziz;Mohamed Hussein;Ashraf D. Elbayoumy
{"title":"DDoS Mitigation in IoT Using Machine Learning and Blockchain Integration","authors":"Ammar Ibrahim El Sayed;Mahmoud Abdelaziz;Mohamed Hussein;Ashraf D. Elbayoumy","doi":"10.1109/LNET.2024.3377355","DOIUrl":"https://doi.org/10.1109/LNET.2024.3377355","url":null,"abstract":"The Internet of Things (IoT) has brought about flexible data management and monitoring, but it is increasingly vulnerable to distributed denial-of-service (DDoS) attacks. To counter these threats and bolster IoT device trust and computational capacity, we propose an innovative solution by integrating machine learning (ML) techniques with blockchain as a supporting framework. Analyzing IoT traffic datasets, we reveal the presence of DDoS attacks, highlighting the need for robust defenses. After evaluating multiple ML models, we choose the most effective one and integrate it with blockchain for enhanced detection and mitigation of DDoS threats, reinforcing IoT network security. This approach enhances device resilience, presenting a promising contribution to the secure IoT landscape.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"152-155"},"PeriodicalIF":0.0,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286739","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
Blockchain-Enabled Variational Information Bottleneck for IoT Networks 物联网网络的区块链变异信息瓶颈
IEEE Networking Letters Pub Date : 2024-03-18 DOI: 10.1109/LNET.2024.3376435
Qiong Wu;Le Kuai;Pingyi Fan;Qiang Fan;Junhui Zhao;Jiangzhou Wang
{"title":"Blockchain-Enabled Variational Information Bottleneck for IoT Networks","authors":"Qiong Wu;Le Kuai;Pingyi Fan;Qiang Fan;Junhui Zhao;Jiangzhou Wang","doi":"10.1109/LNET.2024.3376435","DOIUrl":"10.1109/LNET.2024.3376435","url":null,"abstract":"In Internet of Things (IoT) networks, the amount of data sensed by user devices may be huge, resulting in the serious network congestion. To solve this problem, intelligent data compression is critical. The variational information bottleneck (VIB) approach, combined with machine learning, can be employed to train the encoder and decoder, so that the required transmission data size can be reduced significantly. However, VIB suffers from the computing burden and network insecurity. In this letter, we propose a blockchain-enabled VIB (BVIB) approach to relieve the computing burden while guaranteeing network security. Extensive simulations conducted by Python and C++ demonstrate that BVIB outperforms VIB by 36%, 22% and 57% in terms of time and CPU cycles cost, mutual information, and accuracy under attack, respectively.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"92-96"},"PeriodicalIF":0.0,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140255059","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
Unlocking Reconfigurability for Deep Reinforcement Learning in SFC Provisioning 在 SFC 配置中释放深度强化学习的可重构性
IEEE Networking Letters Pub Date : 2024-03-13 DOI: 10.1109/LNET.2024.3400764
Murat Arda Onsu;Poonam Lohan;Burak Kantarci;Emil Janulewicz;Sergio Slobodrian
{"title":"Unlocking Reconfigurability for Deep Reinforcement Learning in SFC Provisioning","authors":"Murat Arda Onsu;Poonam Lohan;Burak Kantarci;Emil Janulewicz;Sergio Slobodrian","doi":"10.1109/LNET.2024.3400764","DOIUrl":"https://doi.org/10.1109/LNET.2024.3400764","url":null,"abstract":"Network function virtualization (NFV) is a key foundational technology for 5G and beyond networks, wherein to offer network services, execution of Virtual Network Functions (VNFs) in a defined sequence is crucial for high-quality Service Function Chaining (SFC) provisioning. To provide fast, reliable, and automatic VNFs placement, Machine Learning (ML) algorithms such as Deep Reinforcement Learning (DRL) are widely being investigated. However, due to the requirement of fixed-size inputs in DRL models, these algorithms are highly dependent on network configuration such as the number of data centers (DCs) where VNFs can be placed and the logical connections among DCs. In this letter, a novel approach using the DRL technique is proposed for SFC provisioning which unlocks the reconfigurability of the networks, i.e., the same proposed model can be applied in different network configurations without additional training. Moreover, an advanced Deep Neural Network (DNN) architecture is constructed for DRL with an attention layer that improves the performance of SFC provisioning while considering the efficient resource utilization and the End-to-End (E2E) delay of SFC requests by looking up their priority points. Numerical results demonstrate that the proposed model surpasses the baseline heuristic method with an increase in the overall SFC acceptance ratio by 20.3% and a reduction in resource consumption and E2E delay by 50% and 42.65%, respectively.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"193-197"},"PeriodicalIF":0.0,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517983","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 COMMUNICATIONS SOCIETY IEEE 通信学会
IEEE Networking Letters Pub Date : 2024-03-05 DOI: 10.1109/LNET.2024.3365241
{"title":"IEEE COMMUNICATIONS SOCIETY","authors":"","doi":"10.1109/LNET.2024.3365241","DOIUrl":"https://doi.org/10.1109/LNET.2024.3365241","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10460368","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042932","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 电气和电子工程师学会通信协会
IEEE Networking Letters Pub Date : 2024-03-05 DOI: 10.1109/LNET.2024.3365245
{"title":"IEEE Communications Society","authors":"","doi":"10.1109/LNET.2024.3365245","DOIUrl":"https://doi.org/10.1109/LNET.2024.3365245","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"C3-C3"},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10460369","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042859","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 作者指南
IEEE Networking Letters Pub Date : 2024-03-05 DOI: 10.1109/LNET.2024.3365243
{"title":"IEEE Networking Letters Author Guidelines","authors":"","doi":"10.1109/LNET.2024.3365243","DOIUrl":"https://doi.org/10.1109/LNET.2024.3365243","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"75-76"},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10460361","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042913","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
Admission Shaping With Network Calculus 利用网络微积分进行接纳整形
IEEE Networking Letters Pub Date : 2024-03-01 DOI: 10.1109/LNET.2024.3372407
Anne Bouillard
{"title":"Admission Shaping With Network Calculus","authors":"Anne Bouillard","doi":"10.1109/LNET.2024.3372407","DOIUrl":"https://doi.org/10.1109/LNET.2024.3372407","url":null,"abstract":"Several techniques can be used for computing deterministic performance bounds in FIFO networks. The most popular one, as far as Network Calculus is concerned, is Total Flow Analysis (TFA). Its advantages are its algorithmic efficiency, acceptable accuracy and adapted to general topologies. However, handling cyclic dependencies is mostly solved for token-bucket arrival curves. Moreover, in many situations, flows are shaped at their admission in a network, and the network analysis does not fully take advantage of it. In this letter, we generalize the approach to piece-wise linear concave arrival curves and to shaping several flows together at their admission into the network. We show through numerical evaluation that the performance bounds are drastically improved.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"115-118"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286615","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信