首页 > 最新文献

Annals of Telecommunications最新文献

英文 中文
Editorial of 6GNet 2023 special issue 6GNet 2023 特刊编辑
IF 1.8 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-10-23 DOI: 10.1007/s12243-024-01060-2
Raouf Boutaba, Guy Pujolle, Amina Boudendir, Abdallah Shami, Daniel Benevides da Costa
{"title":"Editorial of 6GNet 2023 special issue","authors":"Raouf Boutaba, Guy Pujolle, Amina Boudendir, Abdallah Shami, Daniel Benevides da Costa","doi":"10.1007/s12243-024-01060-2","DOIUrl":"10.1007/s12243-024-01060-2","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the (in)efficiency of fuzzing network protocols 论模糊网络协议的(不)效率
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-08-13 DOI: 10.1007/s12243-024-01058-w
Seyed Behnam Andarzian, Cristian Daniele, Erik Poll

Fuzzing is a widely used and effective technique to test software. Unfortunately, certain systems, including network protocols, are more challenging to fuzz than others. An important complication with fuzzing network protocols is that this tends to be a slow process, which is problematic as fuzzing involves many test inputs. This article analyzes the root causes behind the inefficiency of fuzzing network protocols and strategies to avoid them. It extends our earlier work on network protocol fuzzers, which explored some of these strategies, to give a more comprehensive overview of overheads in fuzzing and ways to reduce them.

模糊测试是一种广泛使用且有效的软件测试技术。遗憾的是,某些系统(包括网络协议)比其他系统更难进行模糊测试。对网络协议进行模糊测试的一个重要复杂因素是,模糊测试往往是一个缓慢的过程,由于模糊测试涉及许多测试输入,这就造成了问题。本文分析了模糊网络协议效率低下的根本原因,以及避免这些原因的策略。我们早前在网络协议模糊器方面的工作曾探讨过其中一些策略,本文对这些策略进行了扩展,以更全面地概述模糊过程中的开销以及减少开销的方法。
{"title":"On the (in)efficiency of fuzzing network protocols","authors":"Seyed Behnam Andarzian, Cristian Daniele, Erik Poll","doi":"10.1007/s12243-024-01058-w","DOIUrl":"https://doi.org/10.1007/s12243-024-01058-w","url":null,"abstract":"<p>Fuzzing is a widely used and effective technique to test software. Unfortunately, certain systems, including network protocols, are more challenging to fuzz than others. An important complication with fuzzing network protocols is that this tends to be a slow process, which is problematic as fuzzing involves many test inputs. This article analyzes the root causes behind the inefficiency of fuzzing network protocols and strategies to avoid them. It extends our earlier work on network protocol fuzzers, which explored some of these strategies, to give a more comprehensive overview of overheads in fuzzing and ways to reduce them.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mixed $$mathcal {H}_{2}$$/$$mathcal {H}_{infty }$$ fault detection and control for uncertain delta operator systems with mixed random delays and multiple data packet dropouts 具有混合随机延迟和多数据包丢失的不确定三角算子系统的混合 $$mathcal {H}_{2}$$/$$mathcal {H}_{infty }$ 故障检测与控制
IF 1.8 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-08-09 DOI: 10.1007/s12243-024-01057-x
George Nartey, Duanjin Zhang
{"title":"Mixed $$mathcal {H}_{2}$$/$$mathcal {H}_{infty }$$ fault detection and control for uncertain delta operator systems with mixed random delays and multiple data packet dropouts","authors":"George Nartey, Duanjin Zhang","doi":"10.1007/s12243-024-01057-x","DOIUrl":"https://doi.org/10.1007/s12243-024-01057-x","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141925426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investigation of LDPC codes with interleaving for 5G wireless networks 针对 5G 无线网络的交织 LDPC 码研究
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-23 DOI: 10.1007/s12243-024-01054-0
Pooja Pathak, Richa Bhatia

Low-density parity check (LDPC) codes are employed for data channels due to their capability of achieving high throughput and good performance. However, the belief propagation decoding algorithm for LDPC codes has high computational complexity. The min-sum approach reduces decoding complexity at the expense of performance loss. In this paper, we investigate the performance of LDPC codes using interleaving. The codes are investigated using BPSK modulation for short to moderate message lengths for various numbers of iterations using the min-sum decoding algorithm. The paper aims to improve the block error rate (BLER) and bit error rate (BER) for short to moderate block lengths required for massive machine-type communications (mMTC) supporting numerous IoT devices with short data packets, and ultra-reliable low-latency communications (URLLC) for delay-sensitive services of 5G. By incorporating interleaving alongside min-sum decoding, the performance is not only improved but also reaches a level of comparability with established algorithms such as the belief propagation algorithm (BPA) and the sum-product algorithm (SPA). LDPC coding with interleaving and subsequent min-sum decoding is a promising approach for improving the performance metrics of codes for short to moderate block length without incurring a significant increase in decoding complexity.

低密度奇偶校验(LDPC)码具有吞吐量大、性能好的特点,因此被用于数据信道。然而,LDPC 码的信念传播解码算法具有很高的计算复杂度。最小和方法以性能损失为代价降低了解码复杂度。本文研究了使用交织的 LDPC 码的性能。我们使用 BPSK 调制对这些编码进行了研究,并使用最小和解码算法对不同迭代次数的短至中等信息长度进行了研究。本文旨在提高中短信息块长度的块误码率(BLER)和比特误码率(BER),以满足支持大量物联网设备的短数据包大规模机器型通信(mMTC)和 5G 时延敏感服务的超可靠低延迟通信(URLLC)的要求。通过将交错与最小和解码相结合,不仅提高了性能,而且达到了与信念传播算法(BPA)和和积算法(SPA)等成熟算法相当的水平。采用交错和后续最小和解码的 LDPC 编码是一种很有前途的方法,可在不显著增加解码复杂度的情况下,改善中短码块长度编码的性能指标。
{"title":"Investigation of LDPC codes with interleaving for 5G wireless networks","authors":"Pooja Pathak, Richa Bhatia","doi":"10.1007/s12243-024-01054-0","DOIUrl":"https://doi.org/10.1007/s12243-024-01054-0","url":null,"abstract":"<p>Low-density parity check (LDPC) codes are employed for data channels due to their capability of achieving high throughput and good performance. However, the belief propagation decoding algorithm for LDPC codes has high computational complexity. The min-sum approach reduces decoding complexity at the expense of performance loss. In this paper, we investigate the performance of LDPC codes using interleaving. The codes are investigated using BPSK modulation for short to moderate message lengths for various numbers of iterations using the min-sum decoding algorithm. The paper aims to improve the block error rate (BLER) and bit error rate (BER) for short to moderate block lengths required for massive machine-type communications (mMTC) supporting numerous IoT devices with short data packets, and ultra-reliable low-latency communications (URLLC) for delay-sensitive services of 5G. By incorporating interleaving alongside min-sum decoding, the performance is not only improved but also reaches a level of comparability with established algorithms such as the belief propagation algorithm (BPA) and the sum-product algorithm (SPA). LDPC coding with interleaving and subsequent min-sum decoding is a promising approach for improving the performance metrics of codes for short to moderate block length without incurring a significant increase in decoding complexity.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Joint MEC selection and wireless resource allocation in 5G RAN 5G RAN 中的联合 MEC 选择和无线资源分配
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-23 DOI: 10.1007/s12243-024-01050-4
Tengteng Ma, Chen Li, Yuanmou Chen, Zehui Li, Zhenyu Zhang, Jing Zhao

With the vigorous development of the Internet of Things (IoT), the demand for user equipment (UE) computing capacity is increasing. Multiaccess edge computing (MEC) provides users with high-performance and low-latency services by offloading computational tasks to the nearest MEC server-configured 5G radio access network (RAN). However, these computationally intensive tasks may lead to a sharp increase in the energy consumption of UE and cause downtime. In this paper, to address this challenge, we design an intelligent scheduling and management system (ISMS) to jointly optimize the allocation of MEC resources and wireless communication resources. The resource allocation problem is a mixed-integer nonlinear programming problem (MINLP), an NP-hard problem. The ISMS models this problem as an MDP with a state, action, reward, and policy and adopts a modified deep deterministic policy gradient (mDDPG) algorithm to ensure the weighted minimization of the energy consumption, latency, and cost of users. The simulation results show that the ISMS can effectively reduce the system’s energy consumption, latency, and cost. The proposed algorithm can provide more stable and efficient performance than other algorithms.

随着物联网(IoT)的蓬勃发展,对用户设备(UE)计算能力的需求与日俱增。多接入边缘计算(MEC)通过将计算任务卸载到最近的MEC服务器配置的5G无线接入网络(RAN),为用户提供高性能和低延迟的服务。然而,这些计算密集型任务可能会导致 UE 的能耗急剧增加并造成停机。本文针对这一挑战,设计了一种智能调度和管理系统(ISMS),以联合优化 MEC 资源和无线通信资源的分配。资源分配问题是一个混合整数非线性编程问题(MINLP),是一个 NP 难问题。ISMS 将该问题建模为包含状态、行动、奖励和策略的 MDP,并采用改进的深度确定性策略梯度(mDDPG)算法来确保用户的能耗、延迟和成本的加权最小化。仿真结果表明,ISMS 可以有效降低系统的能耗、延迟和成本。与其他算法相比,所提出的算法能提供更稳定、更高效的性能。
{"title":"Joint MEC selection and wireless resource allocation in 5G RAN","authors":"Tengteng Ma, Chen Li, Yuanmou Chen, Zehui Li, Zhenyu Zhang, Jing Zhao","doi":"10.1007/s12243-024-01050-4","DOIUrl":"https://doi.org/10.1007/s12243-024-01050-4","url":null,"abstract":"<p>With the vigorous development of the Internet of Things (IoT), the demand for user equipment (UE) computing capacity is increasing. Multiaccess edge computing (MEC) provides users with high-performance and low-latency services by offloading computational tasks to the nearest MEC server-configured 5G radio access network (RAN). However, these computationally intensive tasks may lead to a sharp increase in the energy consumption of UE and cause downtime. In this paper, to address this challenge, we design an intelligent scheduling and management system (ISMS) to jointly optimize the allocation of MEC resources and wireless communication resources. The resource allocation problem is a mixed-integer nonlinear programming problem (MINLP), an NP-hard problem. The ISMS models this problem as an MDP with a state, action, reward, and policy and adopts a modified deep deterministic policy gradient (mDDPG) algorithm to ensure the weighted minimization of the energy consumption, latency, and cost of users. The simulation results show that the ISMS can effectively reduce the system’s energy consumption, latency, and cost. The proposed algorithm can provide more stable and efficient performance than other algorithms.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism 利用节能数据聚合机制在物联网网络中进行机会性数据收集
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-23 DOI: 10.1007/s12243-024-01055-z
Edvar Afonso, Miguel Elias M. Campista

Internet of Things (IoT) applications rely on data collection and centralized processing to assist decision-making. Nevertheless, in multi-hop Low Power and Lossy Networks (LLN) scenarios, data forwarding can be troublesome as it imposes multiple retransmissions, consuming more energy. This paper revisits the concept of mobile agents to collect data from sensors more efficiently. Upon receiving a data request, the IoT gateway performs a cache lookup and promptly dispatches a mobile agent to collect data if this is not available. Data collection then uses closed-loop itineraries computed using a Traveling Salesman Problem (TSP) heuristic starting at the network gateway. The itinerary goes through nodes producing solicited and unsolicited data. We assume that the unsolicited data will be requested soon, and opportunistically collecting it avoids future agent transmissions. We limit the collection capacity of each agent using a knapsack problem approach. Simulation results show that our proposal reduces the network traffic and energy consumption compared with a traditional mobile agent without opportunistic data collection. In addition, we show that data aggregation can further improve the performance of our proposal.

物联网(IoT)应用依赖数据收集和集中处理来辅助决策。然而,在多跳低功耗和有损网络(LLN)场景中,数据转发可能会带来麻烦,因为它需要多次重传,消耗更多能量。本文重新审视了移动代理的概念,以更高效地从传感器收集数据。在收到数据请求后,物联网网关会执行缓存查询,并在无法获得数据时及时派遣移动代理收集数据。数据收集采用闭环路线,以网络网关为起点,通过旅行推销员问题(TSP)启发式计算得出。行程会经过产生请求数据和非请求数据的节点。我们假定主动提供的数据很快就会被请求,因此在收集这些数据时可以避免未来的代理传输。我们使用一个 "背包 "问题方法来限制每个代理的收集能力。仿真结果表明,与没有机会数据收集功能的传统移动代理相比,我们的建议减少了网络流量和能耗。此外,我们还表明,数据聚合可以进一步提高我们建议的性能。
{"title":"Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism","authors":"Edvar Afonso, Miguel Elias M. Campista","doi":"10.1007/s12243-024-01055-z","DOIUrl":"https://doi.org/10.1007/s12243-024-01055-z","url":null,"abstract":"<p>Internet of Things (IoT) applications rely on data collection and centralized processing to assist decision-making. Nevertheless, in multi-hop Low Power and Lossy Networks (LLN) scenarios, data forwarding can be troublesome as it imposes multiple retransmissions, consuming more energy. This paper revisits the concept of mobile agents to collect data from sensors more efficiently. Upon receiving a data request, the IoT gateway performs a cache lookup and promptly dispatches a mobile agent to collect data if this is not available. Data collection then uses closed-loop itineraries computed using a Traveling Salesman Problem (TSP) heuristic starting at the network gateway. The itinerary goes through nodes producing solicited and unsolicited data. We assume that the unsolicited data will be requested soon, and opportunistically collecting it avoids future agent transmissions. We limit the collection capacity of each agent using a knapsack problem approach. Simulation results show that our proposal reduces the network traffic and energy consumption compared with a traditional mobile agent without opportunistic data collection. In addition, we show that data aggregation can further improve the performance of our proposal.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep learning based channel estimation in PLC systems 基于深度学习的 PLC 系统信道估计
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-20 DOI: 10.1007/s12243-024-01051-3
Nasser Sadeghi, Masoumeh Azghani

Power line communication systems (PLC) are used for data transmission. Accurate channel state information (CSI) is essential for the receiver design in such systems, however, impulsive noise poses a challenge for the channel estimation task. In this paper, we propose a deep learning based method for PLC channel estimation which is resistant against impulsive noise as well as the additive white Gaussian noise (AWGN). The proposed deep neural network consists of three sub-networks: The first one is a denoising network which aims to remove the noise from the received signal. The second sub-network offers a low-accuracy estimation of the channel using the denoised signal. The third sub-network is designed for high-accuracy channel estimation. The training of the proposed network is done in two stages: Firstly, the denoising sub-network is trained. Secondly, by freezing the trained parameters of the denoising network, the two-channel estimation sub-networks are trained. Moreover, we have derived the Cramer Rao lower bound of the PLC channel estimation problem. The proposed method has been evaluated through various simulation scenarios which confirm the superiority of the proposed method over its counterpart. The suggested algorithm indicates acceptable resistance against impulsive and Gaussian noises.

电力线通信系统(PLC)用于数据传输。准确的信道状态信息(CSI)对此类系统的接收器设计至关重要,然而,脉冲噪声给信道估计任务带来了挑战。在本文中,我们提出了一种基于深度学习的 PLC 信道估计方法,该方法可抵御脉冲噪声和加性白高斯噪声(AWGN)。所提出的深度神经网络由三个子网络组成:第一个是去噪网络,旨在去除接收信号中的噪声。第二个子网络利用去噪信号对信道进行低精度估计。第三个子网络是为高精度信道估计而设计的。拟议网络的训练分两个阶段进行:首先,训练去噪子网络。其次,通过冻结去噪网络的训练参数,训练双信道估计子网络。此外,我们还推导出了 PLC 信道估计问题的 Cramer Rao 下界。我们通过各种模拟场景对所提出的方法进行了评估,结果证实该方法优于其他方法。建议的算法对脉冲噪声和高斯噪声具有可接受的抵抗力。
{"title":"Deep learning based channel estimation in PLC systems","authors":"Nasser Sadeghi, Masoumeh Azghani","doi":"10.1007/s12243-024-01051-3","DOIUrl":"https://doi.org/10.1007/s12243-024-01051-3","url":null,"abstract":"<p>Power line communication systems (PLC) are used for data transmission. Accurate channel state information (CSI) is essential for the receiver design in such systems, however, impulsive noise poses a challenge for the channel estimation task. In this paper, we propose a deep learning based method for PLC channel estimation which is resistant against impulsive noise as well as the additive white Gaussian noise (AWGN). The proposed deep neural network consists of three sub-networks: The first one is a denoising network which aims to remove the noise from the received signal. The second sub-network offers a low-accuracy estimation of the channel using the denoised signal. The third sub-network is designed for high-accuracy channel estimation. The training of the proposed network is done in two stages: Firstly, the denoising sub-network is trained. Secondly, by freezing the trained parameters of the denoising network, the two-channel estimation sub-networks are trained. Moreover, we have derived the Cramer Rao lower bound of the PLC channel estimation problem. The proposed method has been evaluated through various simulation scenarios which confirm the superiority of the proposed method over its counterpart. The suggested algorithm indicates acceptable resistance against impulsive and Gaussian noises.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141742452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Throughput and latency targeted RL spectrum allocation in heterogeneous OTN 异构 OTN 中针对吞吐量和延迟的 RL 频谱分配
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-17 DOI: 10.1007/s12243-024-01056-y
Sam Aleyadeh, Abbas Javadtalab, Abdallah Shami

The increased adoption and development of 5 G-based services have greatly increased the dynamic nature of traffic, including types, sizes, and requirements. Flex-grid elastic optical networks (EONs) have become prolific in supporting these services. However, this transition led to issues such as lower traffic throughput and resource wastage in the form of bandwidth fragmentation. With the continued growth of these services, proper traffic management to reduce this issue has become essential. To overcome this challenge, we propose a Throughput and Latency-First Reinforcement Learning-based spectrum allocation algorithm (TLFRL) in IP-over-fixed/flex-grid optical networks. The main target of TLFRL is to reduce the need to reallocate the spectrum by lowering the fragmentation and blocking probability. We achieve this by leveraging advanced demand organization techniques while using traditional networking infrastructure intelligently to offload compatible services, avoiding latency violations. Extensive simulations evaluated traffic throughput, fragmentation, and average latency. The results show that the proposed solution outperforms contemporary fixed grid-based and heuristic approaches. It also provides comparable results to state-of-the-art flex-grid spectrum allocation techniques.

随着基于 5 G 的服务越来越多地采用和发展,流量的动态性质(包括类型、规模和要求)也大大增加。柔性光栅弹性光网络(EON)已成为支持这些服务的重要手段。然而,这种过渡导致了流量吞吐量降低和以带宽碎片形式出现的资源浪费等问题。随着这些服务的持续增长,为减少这一问题而进行适当的流量管理已变得至关重要。为了克服这一挑战,我们提出了一种基于吞吐量和延迟优先强化学习的频谱分配算法(TLFRL)。TLFRL 的主要目标是通过降低碎片和阻塞概率来减少重新分配频谱的需求。我们利用先进的需求组织技术来实现这一目标,同时智能地使用传统网络基础设施来卸载兼容服务,避免延迟违规。大量模拟评估了流量吞吐量、碎片和平均延迟。结果表明,所提出的解决方案优于当代基于固定网格的方法和启发式方法。它还提供了与最先进的灵活网格频谱分配技术相当的结果。
{"title":"Throughput and latency targeted RL spectrum allocation in heterogeneous OTN","authors":"Sam Aleyadeh, Abbas Javadtalab, Abdallah Shami","doi":"10.1007/s12243-024-01056-y","DOIUrl":"https://doi.org/10.1007/s12243-024-01056-y","url":null,"abstract":"<p>The increased adoption and development of 5 G-based services have greatly increased the dynamic nature of traffic, including types, sizes, and requirements. Flex-grid elastic optical networks (EONs) have become prolific in supporting these services. However, this transition led to issues such as lower traffic throughput and resource wastage in the form of bandwidth fragmentation. With the continued growth of these services, proper traffic management to reduce this issue has become essential. To overcome this challenge, we propose a Throughput and Latency-First Reinforcement Learning-based spectrum allocation algorithm (TLFRL) in IP-over-fixed/flex-grid optical networks. The main target of TLFRL is to reduce the need to reallocate the spectrum by lowering the fragmentation and blocking probability. We achieve this by leveraging advanced demand organization techniques while using traditional networking infrastructure intelligently to offload compatible services, avoiding latency violations. Extensive simulations evaluated traffic throughput, fragmentation, and average latency. The results show that the proposed solution outperforms contemporary fixed grid-based and heuristic approaches. It also provides comparable results to state-of-the-art flex-grid spectrum allocation techniques.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141718795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Discreet: distributed delivery service with context-aware cooperation Discreet:具有情境感知合作功能的分布式交付服务
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-11 DOI: 10.1007/s12243-024-01053-1
Ludovic Paillat, Claudia-Lavinia Ignat, Davide Frey, Mathieu Turuani, Amine Ismail

End-to-end encrypted messaging applications such as Signal became widely popular thanks to their capability to ensure the confidentiality and integrity of online communication. While the highest security guarantees were long reserved for two-party communication, solutions for n-party communication remained either inefficient or less secure until the standardization of the MLS protocol (Messaging Layer Security). This new protocol offers an efficient way to provide end-to-end secure communication with the same guarantees originally offered by the Signal protocol for two-party communication. However, both solutions still rely on a centralized component for message delivery, called the Delivery Service in the MLS protocol. The centralization of the delivery service makes it an ideal target for attackers and threatens the availability of any protocol relying on MLS. In order to overcome this issue, we propose DiSCreet (Distributed delIvery Service with Context-awaRE coopEraTion), a design that allows clients to exchange protocol messages efficiently and without any intermediary. It uses a probabilistic reliable-broadcast mechanism to efficiently deliver messages and the Cascade Consensus protocol to handle messages requiring an agreement. Our solution strengthens the availability of the MLS protocol without compromising its security. We compare the theoretical performance of DiSCreet with another distributed solution, the DCGKA protocol, and detail the implementation of our solution.

由于 Signal 等端到端加密信息应用程序能够确保在线通信的保密性和完整性,因此广受欢迎。长期以来,最高的安全保证一直保留在双方通信中,而 n 方通信的解决方案要么效率低下,要么安全性较低,直到 MLS 协议(消息层安全)的标准化。这一新协议提供了一种高效的端到端安全通信方式,与最初用于双方通信的 Signal 协议提供的保证相同。不过,这两种解决方案仍然依赖于一个集中式的信息传递组件,在 MLS 协议中称为传递服务。递送服务的集中化使其成为攻击者的理想目标,并威胁到依赖 MLS 的任何协议的可用性。为了解决这个问题,我们提出了 DiSCreet(Distributed delIvery Service with Context-awaRE coopEraTion),它允许客户端在没有任何中介的情况下高效交换协议信息。它使用概率可靠广播机制来有效传递信息,并使用级联共识协议来处理需要达成一致的信息。我们的解决方案增强了 MLS 协议的可用性,同时又不影响其安全性。我们将 DiSCreet 的理论性能与另一种分布式解决方案 DCGKA 协议进行了比较,并详细介绍了我们解决方案的实现。
{"title":"Discreet: distributed delivery service with context-aware cooperation","authors":"Ludovic Paillat, Claudia-Lavinia Ignat, Davide Frey, Mathieu Turuani, Amine Ismail","doi":"10.1007/s12243-024-01053-1","DOIUrl":"https://doi.org/10.1007/s12243-024-01053-1","url":null,"abstract":"<p>End-to-end encrypted messaging applications such as Signal became widely popular thanks to their capability to ensure the confidentiality and integrity of online communication. While the highest security guarantees were long reserved for two-party communication, solutions for n-party communication remained either inefficient or less secure until the standardization of the MLS protocol (Messaging Layer Security). This new protocol offers an efficient way to provide end-to-end secure communication with the same guarantees originally offered by the Signal protocol for two-party communication. However, both solutions still rely on a centralized component for message delivery, called the Delivery Service in the MLS protocol. The centralization of the delivery service makes it an ideal target for attackers and threatens the availability of any protocol relying on MLS. In order to overcome this issue, we propose DiSCreet (Distributed delIvery Service with Context-awaRE coopEraTion), a design that allows clients to exchange protocol messages efficiently and without any intermediary. It uses a probabilistic reliable-broadcast mechanism to efficiently deliver messages and the Cascade Consensus protocol to handle messages requiring an agreement. Our solution strengthens the availability of the MLS protocol without compromising its security. We compare the theoretical performance of DiSCreet with another distributed solution, the DCGKA protocol, and detail the implementation of our solution.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A revocable attribute-based access control with non-monotonic access structure 基于属性的可撤销访问控制与非单调访问结构
IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS Pub Date : 2024-07-10 DOI: 10.1007/s12243-024-01052-2
Maede Ashouri-Talouki, Nafiseh Kahani, Masoud Barati, Zomorod Abedini

Internet of Things (IoT) has revolutionized data manipulation across various applications, particularly in online healthcare paradigm, where medical data are collected and processed for remote monitoring and analysis. To improve the privacy and security of such sensitive healthcare data, the attribute-based encryption (ABE) with non-monotonic access policies has recently provided a fine-grained access control within cloud and IoT-based healthcare ecosystems. Specifically, the adoption of multi-authority ABE with untrusted authorities has eliminated the need for a trusted authority. However, ensuring the privacy of user’s identity and attribute sets from these untrusted authorities remains a significant challenge in this context. To address this challenge, this paper introduces an enhanced multi-authority ABE approach, incorporating a robust attribute revocation mechanism. This enhancement safeguards user’s identity and attribute-set privacy while remaining resilient against collusion attacks and ensuring backward secrecy. Moreover, the proposed approach provides non-monotonic access policies, which supports positive and negative constraints using NOT operation as well as AND and OR operations.

物联网(IoT)彻底改变了各种应用中的数据操作,特别是在在线医疗保健模式中,医疗数据被收集和处理,用于远程监控和分析。为了提高此类敏感医疗数据的隐私性和安全性,具有非单调访问策略的基于属性的加密(ABE)最近在基于云和物联网的医疗生态系统中提供了一种细粒度访问控制。具体来说,采用具有不可信授权的多授权 ABE 不再需要可信授权。然而,在这种情况下,如何从这些不可信机构确保用户身份和属性集的隐私仍然是一个重大挑战。为应对这一挑战,本文引入了一种增强型多授权 ABE 方法,其中包含一种稳健的属性撤销机制。这种增强方法既能保护用户身份和属性集隐私,又能抵御串通攻击并确保向后保密。此外,所提出的方法还提供了非单调访问策略,使用 NOT 运算以及 AND 和 OR 运算支持正负约束。
{"title":"A revocable attribute-based access control with non-monotonic access structure","authors":"Maede Ashouri-Talouki, Nafiseh Kahani, Masoud Barati, Zomorod Abedini","doi":"10.1007/s12243-024-01052-2","DOIUrl":"https://doi.org/10.1007/s12243-024-01052-2","url":null,"abstract":"<p>Internet of Things (IoT) has revolutionized data manipulation across various applications, particularly in online healthcare paradigm, where medical data are collected and processed for remote monitoring and analysis. To improve the privacy and security of such sensitive healthcare data, the attribute-based encryption (ABE) with non-monotonic access policies has recently provided a fine-grained access control within cloud and IoT-based healthcare ecosystems. Specifically, the adoption of multi-authority ABE with untrusted authorities has eliminated the need for a trusted authority. However, ensuring the privacy of user’s identity and attribute sets from these untrusted authorities remains a significant challenge in this context. To address this challenge, this paper introduces an enhanced multi-authority ABE approach, incorporating a robust attribute revocation mechanism. This enhancement safeguards user’s identity and attribute-set privacy while remaining resilient against collusion attacks and ensuring backward secrecy. Moreover, the proposed approach provides non-monotonic access policies, which supports positive and negative constraints using NOT operation as well as AND and OR operations.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141574941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Annals of Telecommunications
全部 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