发布求助
文献互助 智能选刊 最新文献

IEEE Networking Letters最新文献

筛选
英文 中文
IEEE Networking Letters Author Guidelines IEEE Networking Letters 作者指南
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 增强移动网络的城市空中交通连接性
IEEE Networking Letters Pub Date : 2024-04-17 DOI: 10.1109/LNET.2024.3390610
Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi
{"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 基于安全私有区块链的社交媒体服务即时通讯平台
IEEE Networking Letters Pub Date : 2024-04-10 DOI: 10.1109/LNET.2024.3386974
Marc Jayson Baucas;Petros Spachos
{"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：多服务切片网络的延迟敏感型网络设计方案
IEEE Networking Letters Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385008
Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
{"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 联合学习中分布式资源管理的价格歧视博弈
IEEE Networking Letters Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385679
Han Zhang;Halvin Yang;Guopeng Zhang
{"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 性能分析
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
首页 上一页 下一页 尾页
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学术官方微信