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 ${mathcal {O}}{(N)}$ 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 ${mathcal {O}}{(K)}$ . We supplement our analytical results with simulations using synthetic and trace-based arrivals.
{"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}
Pub Date : 2025-01-14DOI: 10.1109/LNET.2025.3529514
Akanksha Sharma;Sharda Tripathi;Sandeep Joshi
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.
{"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}
Pub Date : 2025-01-09DOI: 10.1109/LNET.2025.3527683
Salim El Ghalbzouri;Karim Boutiba;Adlen Ksentini;Mustapha Benjillali
In this letter, we propose an O-RAN-based framework for reconfigurable Intelligent Surfaces (RIS) control in 6G. The key objective is to enable the development of RIS control algorithms as xApps running at the real-time intelligent controller (RIC) of Open RAN (O-RAN). To validate the proposed framework, we developed a Golang-based RIS simulator, GoSimRIS, intended to mimic and examine RIS behavior in various environmental scenarios. The simulator is linked with the RIC via a specialized Service Model (SM) devised in this letter, namely E2SM RIS, which allows the design of xApps that dynamically optimize RIS coefficients by computing the ideal phase shifts and applying them in real-time to maximize network performance using channel information that is retrieved from the GoSimRIS environment. Finally, we introduce an ML-based RIS control mechanism that runs as an xApp using only the positions of the transmitter (Tx) and receiver (Rx) and the presence of Line-of-Sight (LOS) conditions, which corresponds to a realistic indoor scenario in 6G such industry 4.0
在这封信中，我们提出了一个基于o - ran的框架，用于6G中可重构智能表面（RIS）控制。关键目标是使RIS控制算法的开发成为在Open RAN （O-RAN）的实时智能控制器（RIC）上运行的xApps。为了验证提出的框架，我们开发了一个基于golang的RIS模拟器GoSimRIS，旨在模拟和检查RIS在各种环境场景中的行为。模拟器通过本信函中设计的专用服务模型（SM）（即E2SM RIS）与RIC相连，该模型允许设计xApps，通过计算理想相移来动态优化RIS系数，并使用从GoSimRIS环境中检索的通道信息实时应用它们以最大化网络性能。最后，我们介绍了一种基于ml的RIS控制机制，该机制作为xApp运行，仅使用发射器（Tx）和接收器（Rx）的位置以及视线（LOS）条件的存在，这对应于6G等工业4.0中的现实室内场景
{"title":"Neural-Driven Control of RIS in 6G Networks: A GoSimRIS and xApp-Based Framework","authors":"Salim El Ghalbzouri;Karim Boutiba;Adlen Ksentini;Mustapha Benjillali","doi":"10.1109/LNET.2025.3527683","DOIUrl":"https://doi.org/10.1109/LNET.2025.3527683","url":null,"abstract":"In this letter, we propose an O-RAN-based framework for reconfigurable Intelligent Surfaces (RIS) control in 6G. The key objective is to enable the development of RIS control algorithms as xApps running at the real-time intelligent controller (RIC) of Open RAN (O-RAN). To validate the proposed framework, we developed a Golang-based RIS simulator, GoSimRIS, intended to mimic and examine RIS behavior in various environmental scenarios. The simulator is linked with the RIC via a specialized Service Model (SM) devised in this letter, namely E2SM RIS, which allows the design of xApps that dynamically optimize RIS coefficients by computing the ideal phase shifts and applying them in real-time to maximize network performance using channel information that is retrieved from the GoSimRIS environment. Finally, we introduce an ML-based RIS control mechanism that runs as an xApp using only the positions of the transmitter (Tx) and receiver (Rx) and the presence of Line-of-Sight (LOS) conditions, which corresponds to a realistic indoor scenario in 6G such industry 4.0","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645265","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}
Pub Date : 2025-01-08DOI: 10.1109/LNET.2025.3527161
Seyed Mohammad Azimi-Abarghouyi;Nicola Bastianello;Karl H. Johansson;Viktoria Fodor
In this letter, we depart from the widely-used gradient descent-based hierarchical federated learning (FL) algorithms to develop a novel hierarchical FL framework based on the alternating direction method of multipliers (ADMM), leveraging a network architecture consisting of a single cloud server and multiple edge servers, where each edge server is dedicated to a specific client set. Within this framework, we propose two novel FL algorithms, which both use ADMM in the top layer: one that employs ADMM in the lower layer and another that uses the conventional gradient descent-based approach. The proposed framework enhances privacy, and experiments demonstrate the superiority of the proposed algorithms compared to the conventional algorithms in terms of learning convergence and accuracy. Additionally, gradient descent on the lower layer performs well even if the number of local steps is very limited, while ADMM on both layers lead to better performance otherwise.
{"title":"Hierarchical Federated ADMM","authors":"Seyed Mohammad Azimi-Abarghouyi;Nicola Bastianello;Karl H. Johansson;Viktoria Fodor","doi":"10.1109/LNET.2025.3527161","DOIUrl":"https://doi.org/10.1109/LNET.2025.3527161","url":null,"abstract":"In this letter, we depart from the widely-used gradient descent-based hierarchical federated learning (FL) algorithms to develop a novel hierarchical FL framework based on the alternating direction method of multipliers (ADMM), leveraging a network architecture consisting of a single cloud server and multiple edge servers, where each edge server is dedicated to a specific client set. Within this framework, we propose two novel FL algorithms, which both use ADMM in the top layer: one that employs ADMM in the lower layer and another that uses the conventional gradient descent-based approach. The proposed framework enhances privacy, and experiments demonstrate the superiority of the proposed algorithms compared to the conventional algorithms in terms of learning convergence and accuracy. Additionally, gradient descent on the lower layer performs well even if the number of local steps is very limited, while ADMM on both layers lead to better performance otherwise.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10833716","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645252","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}
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.
{"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}
This letter focuses on tackling the challenge of accurately determining the timing of buffalo calving while prioritizing power efficiency. To achieve this, a novel, compact, lightweight and power efficient device is designed for buffalo comfort and can be conveniently attached to the tail. The device wirelessly transmits data to a gateway using Bluetooth Low Energy (BLE). This functionality becomes particularly crucial when the tail movement increases in the last 12 hrs before calving and is regarded as a key behavioral indicator for predicting the onset of labor. Moreover, when an accelerometer is tied to the buffalo’s tail, the Z axis, which represents the vertical axis perpendicular to ground is anticipated to show the most notable deflections during this period as discussed in the literature. Thus, to conserve power, data is only transmitted when significant tail movement is detected, typically 12 hrs before calving, i.e., when Mean Z >-3 m/$s^{2}$ . This approach reduces the device’s power consumption, extending its battery life to more than 6.08 years (approx.) using 620 mAh / 3V battery.
这封信的重点是解决在优先考虑能源效率的同时准确确定水牛产犊时间的挑战。为了实现这一目标，一种新颖、紧凑、轻便、节能的装置被设计出来，可以方便地附着在水牛的尾巴上。设备通过蓝牙低功耗（BLE）无线传输数据到网关。在产犊前的最后12小时，当尾巴运动增加时，这种功能变得尤为重要，被认为是预测分娩开始的关键行为指标。此外，当加速度计被绑在水牛的尾巴上时，Z轴（代表垂直于地面的垂直轴）预计会在这段时间内显示出最显著的偏转，如文献中所讨论的那样。因此，为了节省电力，数据仅在检测到明显的尾巴运动时传输，通常是在产犊前12小时，即当Mean Z >-3 m/ $s^{2}$时。这种方法降低了设备的功耗，使用620mah / 3V电池将其电池寿命延长至超过6.08年（大约）。
{"title":"Bluetooth Low Energy-Based Novel Power Efficient Buffalo Calving Detection Solution","authors":"Radhika Raina;Kamal Jeet Singh;Suman Kumar;Sarthak Jain","doi":"10.1109/LNET.2025.3526658","DOIUrl":"https://doi.org/10.1109/LNET.2025.3526658","url":null,"abstract":"This letter focuses on tackling the challenge of accurately determining the timing of buffalo calving while prioritizing power efficiency. To achieve this, a novel, compact, lightweight and power efficient device is designed for buffalo comfort and can be conveniently attached to the tail. The device wirelessly transmits data to a gateway using Bluetooth Low Energy (BLE). This functionality becomes particularly crucial when the tail movement increases in the last 12 hrs before calving and is regarded as a key behavioral indicator for predicting the onset of labor. Moreover, when an accelerometer is tied to the buffalo’s tail, the Z axis, which represents the vertical axis perpendicular to ground is anticipated to show the most notable deflections during this period as discussed in the literature. Thus, to conserve power, data is only transmitted when significant tail movement is detected, typically 12 hrs before calving, i.e., when Mean Z >-3 m/<inline-formula> <tex-math>$s^{2}$ </tex-math></inline-formula>. This approach reduces the device’s power consumption, extending its battery life to more than 6.08 years (approx.) using 620 mAh / 3V battery.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"6-10"},"PeriodicalIF":0.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645266","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}
Pub Date : 2025-01-03DOI: 10.1109/LNET.2025.3525901
Kahraman Kostas;Mike Just;Michael A. Lones
Machine learning is increasingly employed for intrusion detection in IoT networks. This letter provides the first empirical evidence of the risks associated with modeling network traffic using individual packet features (IPF). Through a comprehensive literature review and novel experimental case studies, we identify critical limitations of IPF, such as information leakage and low data complexity. We offer the first in-depth critique of IPF-based detection systems, highlighting their risks for real-world deployment. Our results demonstrate that IPF-based models can achieve deceptively high detection rates (up to 100% in some cases), but these rates fail to generalize to new datasets, with performance dropping by more than 90% in cross-session tests. These findings underscore the importance of considering packet interactions and contextual information, rather than relying solely on IPF, for developing robust and reliable intrusion detection systems in IoT environments.
{"title":"Individual Packet Features are a Risk to Model Generalization in ML-Based Intrusion Detection","authors":"Kahraman Kostas;Mike Just;Michael A. Lones","doi":"10.1109/LNET.2025.3525901","DOIUrl":"https://doi.org/10.1109/LNET.2025.3525901","url":null,"abstract":"Machine learning is increasingly employed for intrusion detection in IoT networks. This letter provides the first empirical evidence of the risks associated with modeling network traffic using individual packet features (IPF). Through a comprehensive literature review and novel experimental case studies, we identify critical limitations of IPF, such as information leakage and low data complexity. We offer the first in-depth critique of IPF-based detection systems, highlighting their risks for real-world deployment. Our results demonstrate that IPF-based models can achieve deceptively high detection rates (up to 100% in some cases), but these rates fail to generalize to new datasets, with performance dropping by more than 90% in cross-session tests. These findings underscore the importance of considering packet interactions and contextual information, rather than relying solely on IPF, for developing robust and reliable intrusion detection systems in IoT environments.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"66-70"},"PeriodicalIF":0.0,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645192","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}
Pub Date : 2024-12-26DOI: 10.1109/LNET.2024.3522966
Shahroz Abbas;Ajmery Sultana;Georges Kaddoum
With the advances of quantum computing the security of existing cryptographic frameworks is increasingly at risk. Accordingly, in the present study, we investigate the integration of post-quantum cryptographic algorithms into Hyperledger Fabric, a blockchain framework, to safeguard it against emerging quantum threats. To this end, a modified Cryptogen tool was developed to generate X.509 certificates with both classical and post-quantum cryptographic keys. Furthermore, using tools like Hyperledger Caliper and Prometheus for empirical analysis, we demonstrate that this hybrid approach effectively strengthens security without affecting system performance. These results not only improve the security of Hyperledger Fabric, but also offer a practical guide for adding post-quantum cryptography to blockchain technologies.
{"title":"Quantum-Safe Blockchain in Hyperledger Fabric","authors":"Shahroz Abbas;Ajmery Sultana;Georges Kaddoum","doi":"10.1109/LNET.2024.3522966","DOIUrl":"https://doi.org/10.1109/LNET.2024.3522966","url":null,"abstract":"With the advances of quantum computing the security of existing cryptographic frameworks is increasingly at risk. Accordingly, in the present study, we investigate the integration of post-quantum cryptographic algorithms into Hyperledger Fabric, a blockchain framework, to safeguard it against emerging quantum threats. To this end, a modified Cryptogen tool was developed to generate X.509 certificates with both classical and post-quantum cryptographic keys. Furthermore, using tools like Hyperledger Caliper and Prometheus for empirical analysis, we demonstrate that this hybrid approach effectively strengthens security without affecting system performance. These results not only improve the security of Hyperledger Fabric, but also offer a practical guide for adding post-quantum cryptography to blockchain technologies.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"61-65"},"PeriodicalIF":0.0,"publicationDate":"2024-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645176","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}
Payment channels support off-chain transactions by enhancing transaction speed and reducing fees in the main blockchain. However, the costs and complexity of the network increase as we increase the size of the network. To address these challenges, we propose Heuristic-Based Routing with Scheduling (HeRo) combining heuristic-based routing and scheduling techniques in Payment Channel Networks (PCNs). HeRo achieves a cost reduction of 32.71% and 73.08% compared with multi-charge PCN (MPCN-RP) and Dijkstra algorithms, respectively.
{"title":"HeRo: Heuristic-Based Routing in Payment Channel Networks","authors":"Shruti Mishra;Virat Aggarwal;Sujata Pal;Vidushi Agarwal","doi":"10.1109/LNET.2024.3520350","DOIUrl":"https://doi.org/10.1109/LNET.2024.3520350","url":null,"abstract":"Payment channels support off-chain transactions by enhancing transaction speed and reducing fees in the main blockchain. However, the costs and complexity of the network increase as we increase the size of the network. To address these challenges, we propose Heuristic-Based Routing with Scheduling (HeRo) combining heuristic-based routing and scheduling techniques in Payment Channel Networks (PCNs). HeRo achieves a cost reduction of 32.71% and 73.08% compared with multi-charge PCN (MPCN-RP) and Dijkstra algorithms, respectively.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"56-60"},"PeriodicalIF":0.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645264","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}
Pub Date : 2024-12-11DOI: 10.1109/LNET.2024.3516321
Zhenghao Sha;Kechao Cai;Jinbei Zhang
Online caching at the network edge is becoming increasingly important for alleviating the transmission pressure on backbone networks. Previous studies on online caching policies mainly use the static regret as the performance metric, which relies on a fixed benchmark and lacks the capacity to ensure optimal performance in non-stationary environments. In this letter, we introduce the strongly adaptive regret into online caching and propose a Strongly Adaptive online caching scheme (SAcache). Our SAcache scheme focuses on the performance over time intervals with a length between $tau _{min }$ and $tau _{max }$ , where $tau _{min }$ and $tau _{max }$ are the lower and upper bound on how long the environment changes, respectively. SAcache consists of multiple interval caches operating in a lazy restart mode to make candidate caching decisions, and an aggregated cache that weights the these candidate decisions to determine the final caching decision. We prove that the regret upper bound is sub-linear with respect to the time interval’s length $tau $ , i.e., $O(sqrt {tau log (tau _{max }/tau _{min })})$ . Our experiment results demonstrate that SAcache achieves the highest cache hit ratio and the lowest regret compared to other caching policies in non-stationary environments.
{"title":"SAcache: A Strongly Adaptive Online Caching Scheme for Non-Stationary Environments","authors":"Zhenghao Sha;Kechao Cai;Jinbei Zhang","doi":"10.1109/LNET.2024.3516321","DOIUrl":"https://doi.org/10.1109/LNET.2024.3516321","url":null,"abstract":"Online caching at the network edge is becoming increasingly important for alleviating the transmission pressure on backbone networks. Previous studies on online caching policies mainly use the static regret as the performance metric, which relies on a fixed benchmark and lacks the capacity to ensure optimal performance in non-stationary environments. In this letter, we introduce the strongly adaptive regret into online caching and propose a Strongly Adaptive online caching scheme (SAcache). Our SAcache scheme focuses on the performance over time intervals with a length between <inline-formula> <tex-math>$tau _{min }$ </tex-math></inline-formula> and <inline-formula> <tex-math>$tau _{max }$ </tex-math></inline-formula>, where <inline-formula> <tex-math>$tau _{min }$ </tex-math></inline-formula> and <inline-formula> <tex-math>$tau _{max }$ </tex-math></inline-formula> are the lower and upper bound on how long the environment changes, respectively. SAcache consists of multiple interval caches operating in a lazy restart mode to make candidate caching decisions, and an aggregated cache that weights the these candidate decisions to determine the final caching decision. We prove that the regret upper bound is sub-linear with respect to the time interval’s length <inline-formula> <tex-math>$tau $ </tex-math></inline-formula>, i.e., <inline-formula> <tex-math>$O(sqrt {tau log (tau _{max }/tau _{min })})$ </tex-math></inline-formula>. Our experiment results demonstrate that SAcache achieves the highest cache hit ratio and the lowest regret compared to other caching policies in non-stationary environments.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"46-50"},"PeriodicalIF":0.0,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645191","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：