IEEE Networking Letters最新文献_第3页

IEEE Networking Letters Society Information IEEE网络通讯协会信息

IEEE Networking Letters Pub Date : 2025-02-11 DOI: 10.1109/LNET.2025.3526352

引用次数: 0

IEEE Networking Letters Publication Information IEEE网络通讯出版信息

IEEE Networking Letters Pub Date : 2025-02-11 DOI: 10.1109/LNET.2025.3526348

引用次数: 0

A Novel Framework of Horizontal-Vertical Hybrid Federated Learning for EdgeIoT 一种面向边缘物联网的水平-垂直混合联邦学习新框架

IEEE Networking Letters Pub Date : 2025-02-10 DOI: 10.1109/LNET.2025.3540268

Kai Li;Yilei Liang;Xin Yuan;Wei Ni;Jon Crowcroft;Chau Yuen;Ozgur B. Akan

引用次数: 0

AoI-Aware and Privacy Protection Incentive Mechanism for Crowdsensing Networks 众测网络的aoi感知与隐私保护激励机制

IEEE Networking Letters Pub Date : 2025-02-03 DOI: 10.1109/LNET.2025.3538172

Xuying Zhou;Jingyi Xu;Wenqian Zhou;Dusit Niyato;Chau Yuen

引用次数: 0

Fairness-Aware Demodulator Allocation in LoRa Multi-Gateway Networks LoRa多网关网络中的公平感知解调器分配

IEEE Networking Letters Pub Date : 2025-01-22 DOI: 10.1109/LNET.2025.3532765

Alexandre Guitton;Megumi Kaneko

引用次数: 0

Efficient Regret-Optimal Online Caching 高效后悔最优在线缓存

IEEE Networking Letters Pub Date : 2025-01-14 DOI: 10.1109/LNET.2025.3529461

Amrit Rao;Joel Anto Paul;Sharayu Moharir;Nikhil Karamchandani

{"title":"Efficient Regret-Optimal Online Caching","authors":"Amrit Rao;Joel Anto Paul;Sharayu Moharir;Nikhil Karamchandani","doi":"10.1109/LNET.2025.3529461","DOIUrl":"https://doi.org/10.1109/LNET.2025.3529461","url":null,"abstract":"We focus on the online caching problem with a catalog of N equal-sized files and a cache that can store up to K files at a time. We consider a time-slotted system with the cache receiving one request per slot. We consider two types of request arrival processes: stochastic arrivals, where requests are generated by an i.i.d. process with an unknown distribution, and adversarial arrivals where we make no structural assumptions on the arrival process. We use regret as the performance metric to evaluate caching policies. It is known that Follow the Perturbed Leader (FTPL) has order-optimal regret performance for both stochastic and adversarial arrivals. A key limitation of FTPL is its <inline-formula> <tex-math>${mathcal {O}}{(N)}$ </tex-math></inline-formula> computational complexity, which can be prohibitively large for applications with huge catalogs. To address this, we propose a novel variant of FTPL and show that it has the same regret performance at a significantly lower computational complexity of <inline-formula> <tex-math>${mathcal {O}}{(K)}$ </tex-math></inline-formula>. We supplement our analytical results with simulations using synthetic and trace-based arrivals.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 2","pages":"145-149"},"PeriodicalIF":0.0,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308555","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

When to Reach for the Skies? A DRL-Based Routing Framework for Non-Terrestrial Networks 何时到达天空？一种基于drl的非地面网络路由框架

IEEE Networking Letters Pub Date : 2025-01-14 DOI: 10.1109/LNET.2025.3529514

Akanksha Sharma;Sharda Tripathi;Sandeep Joshi

{"title":"When to Reach for the Skies? A DRL-Based Routing Framework for Non-Terrestrial Networks","authors":"Akanksha Sharma;Sharda Tripathi;Sandeep Joshi","doi":"10.1109/LNET.2025.3529514","DOIUrl":"https://doi.org/10.1109/LNET.2025.3529514","url":null,"abstract":"Non-terrestrial networks are envisioned to be an integral component of the beyond-fifth-generation wireless communication networks, catering to both conventional and emerging communication applications. In particular, a plethora of use cases are emerging for ultra-reliable low-latency communication, which require dynamic and quality of service compliant frameworks. In this letter, we formulate a binary integer non-linear programming problem to route time-critical traffic through non-terrestrial nodes. As the problem is NP-hard, we propose the solution using a deep reinforcement learning framework, taking into account the interactions between the terrestrial and various non-terrestrial nodes with an end-to-end latency target while maximizing the coverage probability. We perform simulations for multiple latency deadlines and outage thresholds and the results corroborate the efficiency of the proposed framework. Furthermore, we benchmark the proposed framework and show an improvement of 96.31% in coverage while incurring only 3.2% latency violations compared to the state-of-the-art.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"16-20"},"PeriodicalIF":0.0,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10841394","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645267","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

Neural-Driven Control of RIS in 6G Networks: A GoSimRIS and xApp-Based Framework 6G网络中RIS的神经驱动控制：一个基于GoSimRIS和xapp的框架

IEEE Networking Letters Pub Date : 2025-01-09 DOI: 10.1109/LNET.2025.3527683

Salim El Ghalbzouri;Karim Boutiba;Adlen Ksentini;Mustapha Benjillali

引用次数: 0

Hierarchical Federated ADMM 分层联邦ADMM

IEEE Networking Letters Pub Date : 2025-01-08 DOI: 10.1109/LNET.2025.3527161

Seyed Mohammad Azimi-Abarghouyi;Nicola Bastianello;Karl H. Johansson;Viktoria Fodor

引用次数: 0

SGMFuzz: State Guided Mutation Protocol Fuzzing 状态引导突变协议模糊

IEEE Networking Letters Pub Date : 2025-01-07 DOI: 10.1109/LNET.2025.3526776

Zhenyu Wen;Jianfeng Yu;Zening Huang;Yiming Wu;Zhen Hong;Rajiv Ranjan

{"title":"SGMFuzz: State Guided Mutation Protocol Fuzzing","authors":"Zhenyu Wen;Jianfeng Yu;Zening Huang;Yiming Wu;Zhen Hong;Rajiv Ranjan","doi":"10.1109/LNET.2025.3526776","DOIUrl":"https://doi.org/10.1109/LNET.2025.3526776","url":null,"abstract":"Protocol implementations are fundamental components in network communication systems, and their security is crucial to the overall system. Fuzzing is one of the most popular techniques for detecting vulnerabilities and has been widely applied to the security evaluation of protocol implementations. However, due to the lack of machine-understandable prior knowledge and effective state-guided strategies, existing protocol fuzzing tools tailored for stateful network protocol implementations often suffer from shallow state coverage and generate numerous invalid test cases, thereby impacting the effectiveness of the testing process. In this letter, we introduce SGMFuzz, a grey-box fuzzing tool that combines a state-guided mutation mechanism to detect security vulnerabilities in protocol implementations. SGMFuzz uses the feedback collected during fuzzing to construct a finite-state machine, which aids in a deeper exploration of the program. Additionally, we design a message-aware module to enhance the tool’s ability to generate valid test cases. Our evaluation demonstrates that, compared to the most advanced and widely used network protocol fuzzing tools, SGMFuzz increases the number of discovered execution paths by over 15% on average and improves state transition coverage by over 10%, providing a more comprehensive security assessment of protocol implementations.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"71-75"},"PeriodicalIF":0.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645194","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