Computer Communications最新文献_第2页

Achieving manet protection without the use of superfluous fictitious nodes 在不使用多余虚构节点的情况下实现 manet 保护

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107978

Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman

Mobile ad-hoc networks (manets) are everywhere. They are the basis for many current technologies (including vanets, iot, etc.), and used in multiple domains (including military, disaster zones, etc.). For them to function, routing protocols have been defined, taking into account the high mobility of network nodes. These protocols, however, are vulnerable to devastating attacks. Many solutions have been proposed for various attacks, including dcfm (Denial Contradictions with Fictitious nodes Mechanism) for the node isolation and gray-hole variants. In this work we present a refinement for dcfm, calculate its cost, and compare alternative algorithms. It will be shown that the entire fictitious mechanism is superfluous for some required security level. Examination of the results when under attack show that using dcfm’s contradiction rules alone achieves the best cost-benefit ratio for networks with and without movement. In terms of packet delivery ratio (pdr), however, the proposed algorithm achieves 93% for a 50-node static network, stabilizing on 100% for 90 nodes and above. When movement is present, the success drops to 67%, which is slightly better than the alternatives examined.

移动 ad-hoc 网络（manets）无处不在。它们是当前许多技术（包括万维网、物联网等）的基础，并应用于多个领域（包括军事、灾区等）。考虑到网络节点的高流动性，路由协议已被定义，以确保其正常运行。然而，这些协议很容易受到毁灭性攻击。针对各种攻击提出了许多解决方案，包括针对节点隔离和灰洞变体的 dcfm（虚构节点拒绝矛盾机制）。在这项工作中，我们提出了 dcfm 的改进方案，计算了其成本，并比较了其他算法。我们将证明，对于某些所需的安全级别，整个虚构机制是多余的。对受到攻击时的结果的研究表明，在有移动和无移动的网络中，仅使用 dcfm 的矛盾规则就能达到最佳的成本效益比。然而，就数据包传送率（pdr）而言，所提出的算法在 50 个节点的静态网络中达到了 93%，在 90 个节点及以上的网络中稳定在 100%。当出现移动时，成功率下降到 67%，略好于所研究的其他算法。

{"title":"Achieving manet protection without the use of superfluous fictitious nodes","authors":"Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman","doi":"10.1016/j.comcom.2024.107978","DOIUrl":"10.1016/j.comcom.2024.107978","url":null,"abstract":"<div><div>Mobile ad-hoc networks (<span>manet</span>s) are everywhere. They are the basis for many current technologies (including <span>vanet</span>s, <span>i</span>o<span>t</span>, etc.), and used in multiple domains (including military, disaster zones, etc.). For them to function, routing protocols have been defined, taking into account the high mobility of network nodes. These protocols, however, are vulnerable to devastating attacks. Many solutions have been proposed for various attacks, including <span>dcfm</span> (Denial Contradictions with Fictitious nodes Mechanism) for the node isolation and gray-hole variants. In this work we present a refinement for <span>dcfm</span>, calculate its cost, and compare alternative algorithms. It will be shown that the entire fictitious mechanism is superfluous for some required security level. Examination of the results when under attack show that using <span>dcfm</span>’s contradiction rules alone achieves the best cost-benefit ratio for networks with and without movement. In terms of packet delivery ratio (<span>pdr</span>), however, the proposed algorithm achieves 93% for a 50-node static network, stabilizing on 100% for 90 nodes and above. When movement is present, the success drops to 67%, which is slightly better than the alternatives examined.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107978"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Supporting critical downlink traffic in LoRaWAN 支持 LoRaWAN 中的关键下行链路流量

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107981

Dimitrios Zorbas, Aruzhan Sabyrbek

LoRaWAN, a low-power wide-area network (LPWAN) technology, has been successfully used in the Internet of Things (IoT) industry over the last decade. It is an easy-to-use, long-distance communication protocol combined with minimal power consumption. Supporting critical downlink traffic in LoRaWAN networks is crucial for ensuring the reliable and efficient delivery of essential data in certain actuating applications. However, challenges arise when prioritizing critical downlink traffic, including commands, alerts, and emergency notifications that demand immediate attention from actuating devices. This paper explores strategies to improve downlink traffic delivery in LoRaWAN networks, focusing on enhancing reliability, fairness, and energy efficiency through prioritization techniques and network parameter configurations in the EU868 spectrum. Theoretical as well as simulation results provide insights into the effectiveness of the available solutions for supporting critical downlink traffic in LoRaWAN networks.

LoRaWAN 是一种低功耗广域网（LPWAN）技术，在过去十年中已成功应用于物联网（IoT）行业。它是一种易于使用的长距离通信协议，功耗极低。在某些执行应用中，支持 LoRaWAN 网络中的关键下行链路流量对于确保可靠、高效地传输重要数据至关重要。然而，在确定关键下行链路流量（包括需要执行设备立即关注的命令、警报和紧急通知）的优先级时，会出现一些挑战。本文探讨了改善 LoRaWAN 网络下行链路流量传输的策略，重点是通过 EU868 频谱中的优先级技术和网络参数配置来提高可靠性、公平性和能效。理论和仿真结果有助于深入了解现有解决方案在 LoRaWAN 网络中支持关键下行链路流量的有效性。

引用次数: 0

Editorial special issue: Extended papers from the 18th wireless on-demand Network Systems and Services “WONS 2023” conference 编辑特刊：第 18 届无线按需网络系统与服务 "WONS 2023 "会议的扩展论文

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107988

Renato Lo Cigno, Stefano Basagni, Paolo Casari

引用次数: 0

Special issue of IFIP Networking 2023 IFIP Networking 2023》特刊

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107987

Mun Choon Chan, Xavier Gelabert, Violet R. Syrotiuk

引用次数: 0

HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid HMLB：用于 SDN 智能电网中预防性控制器负载平衡的整体多代理方法

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107984

Marjan Keramati, Sauleh Etemedi, Nasser Mozayani

Smart grid networks present advantages like improving reliability, security, scalability, etc. However, designing an efficient communication infrastructure for smart grid networks is a great challenge. This is because of its dependency on proprietary protocols and specific vendors. Software-defined-enabled smart grid (SDN-SG) tackles this problem by incorporating diverse protocols and standards including open source platforms. One of the most important questions in Software-defined Networking (SDN) is the controller placement problem being NP-Hard in nature. Therefore, the predominant goal of this paper is to diminish the time complexity by modeling the controller placement problem based on the holonic multi-agent system. The hierarchical structure of a holonic organization improves the computational complexity through the divide and conquer mechanism. Such an idea also decreases the distributed controllers' synchronization overhead which is an issue in the realm of SDN. On the other hand, the proper functioning of the smart grid has a strict dependency on time-critical services. Accordingly, the controller placement is supposed to be a Quality of Service-aware (QoS-aware) one. Also, intermittent topology changes in the smart grid and the occasional joining and leaving of members result in an unsteady traffic pattern and dynamicity of controller load. This research is a pioneer in providing a QoS-aware and dynamic controller placement mechanism for SDN-SG. Experimental results certify the preponderance of the approach over similar ones concerning computational complexity, packet loss, controllers’ synchronization overhead, and also load-balancing overhead.

智能电网网络具有提高可靠性、安全性和可扩展性等优势。然而，为智能电网网络设计高效的通信基础设施是一项巨大的挑战。这是因为它依赖于专有协议和特定的供应商。软件定义的智能电网（SDN-SG）通过整合各种协议和标准（包括开源平台）来解决这一问题。软件定义网络（SDN）中最重要的问题之一是控制器的安置问题，其本质是 NP-Hard。因此，本文的主要目标是通过对基于整体多代理系统的控制器放置问题建模来降低时间复杂性。整体组织的分层结构通过分而治之的机制提高了计算复杂度。这种想法还能减少分布式控制器的同步开销，而同步开销是 SDN 领域的一个问题。另一方面，智能电网的正常运行严格依赖于时间关键型服务。因此，控制器的布置应该是服务质量感知（QoS-aware）的。此外，智能电网中拓扑结构的间歇性变化以及成员的间歇性加入和退出导致了流量模式的不稳定性和控制器负载的动态性。这项研究开创性地为 SDN-SG 提供了 QoS 感知和动态控制器放置机制。实验结果证明，该方法在计算复杂性、数据包丢失、控制器同步开销以及负载平衡开销方面优于同类方法。

{"title":"HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid","authors":"Marjan Keramati, Sauleh Etemedi, Nasser Mozayani","doi":"10.1016/j.comcom.2024.107984","DOIUrl":"10.1016/j.comcom.2024.107984","url":null,"abstract":"<div><div>Smart grid networks present advantages like improving reliability, security, scalability, etc. However, designing an efficient communication infrastructure for smart grid networks is a great challenge. This is because of its dependency on proprietary protocols and specific vendors. Software-defined-enabled smart grid (SDN-SG) tackles this problem by incorporating diverse protocols and standards including open source platforms. One of the most important questions in Software-defined Networking (SDN) is the controller placement problem being NP-Hard in nature. Therefore, the predominant goal of this paper is to diminish the time complexity by modeling the controller placement problem based on the holonic multi-agent system. The hierarchical structure of a holonic organization improves the computational complexity through the divide and conquer mechanism. Such an idea also decreases the distributed controllers' synchronization overhead which is an issue in the realm of SDN. On the other hand, the proper functioning of the smart grid has a strict dependency on time-critical services. Accordingly, the controller placement is supposed to be a Quality of Service-aware (QoS-aware) one. Also, intermittent topology changes in the smart grid and the occasional joining and leaving of members result in an unsteady traffic pattern and dynamicity of controller load. This research is a pioneer in providing a QoS-aware and dynamic controller placement mechanism for SDN-SG. Experimental results certify the preponderance of the approach over similar ones concerning computational complexity, packet loss, controllers’ synchronization overhead, and also load-balancing overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107984"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142551834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning DAR-DRL：基于深度强化学习的动态自适应路由方法

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107983

Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng

Mobile-centric wireless networks offer users a diverse range of services and experiences. However, existing intelligent routing methods often struggle to make suitable routing decisions during dynamic network changes, significantly limiting transmission performance. This paper proposes a dynamic adaptive routing method based on Deep Reinforcement Learning (DAR-DRL) to effectively address these challenges. First, to accurately model network state information in complex and dynamically changing routing tasks, we introduce a link-aware graph learning model (LA-GNN) that efficiently senses network information of varying structures through a hierarchical aggregated message-passing neural network. Second, to ensure routing reliability in dynamic environments, we design a hop-by-hop routing strategy featuring a large acceptance domain and a reliability guarantee reward function. This mechanism adaptively avoids routing holes and loops across various network scenarios while enhancing the robustness of routing under dynamic conditions. Experimental results demonstrate that the proposed DAR-DRL method achieves the network routing task with shorter end-to-end delays, lower packet loss rates, and higher throughput compared to existing mainstream methods across common dynamic network scenarios, including cases with dynamic traffic variations, random link failures (small topology changes), and significant topology alterations.

以移动为中心的无线网络为用户提供了多种多样的服务和体验。然而，现有的智能路由方法往往难以在网络动态变化时做出合适的路由决策，从而大大限制了传输性能。本文提出了一种基于深度强化学习（DAR-DRL）的动态自适应路由方法，以有效应对这些挑战。首先，为准确模拟复杂动态变化路由任务中的网络状态信息，我们引入了链路感知图学习模型（LA-GNN），通过分层聚合消息传递神经网络高效感知不同结构的网络信息。其次，为了确保动态环境中的路由可靠性，我们设计了一种逐跳路由策略，具有较大的接受域和可靠性保证奖励函数。这种机制能在各种网络场景中自适应地避免路由漏洞和环路，同时增强路由在动态条件下的鲁棒性。实验结果表明，与现有的主流方法相比，所提出的 DAR-DRL 方法能在常见的动态网络场景中以更短的端到端延迟、更低的丢包率和更高的吞吐量完成网络路由任务，这些场景包括动态流量变化、随机链路故障（小的拓扑变化）和显著的拓扑变化。

{"title":"DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning","authors":"Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng","doi":"10.1016/j.comcom.2024.107983","DOIUrl":"10.1016/j.comcom.2024.107983","url":null,"abstract":"<div><div>Mobile-centric wireless networks offer users a diverse range of services and experiences. However, existing intelligent routing methods often struggle to make suitable routing decisions during dynamic network changes, significantly limiting transmission performance. This paper proposes a dynamic adaptive routing method based on Deep Reinforcement Learning (DAR-DRL) to effectively address these challenges. First, to accurately model network state information in complex and dynamically changing routing tasks, we introduce a link-aware graph learning model (LA-GNN) that efficiently senses network information of varying structures through a hierarchical aggregated message-passing neural network. Second, to ensure routing reliability in dynamic environments, we design a hop-by-hop routing strategy featuring a large acceptance domain and a reliability guarantee reward function. This mechanism adaptively avoids routing holes and loops across various network scenarios while enhancing the robustness of routing under dynamic conditions. Experimental results demonstrate that the proposed DAR-DRL method achieves the network routing task with shorter end-to-end delays, lower packet loss rates, and higher throughput compared to existing mainstream methods across common dynamic network scenarios, including cases with dynamic traffic variations, random link failures (small topology changes), and significant topology alterations.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107983"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility 预测商用和运营 5G 平台中 5G 指标的机器学习方法：5G 和移动性

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-21 DOI: 10.1016/j.comcom.2024.107974

Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento

The demand for more secure, available, reliable, and fast networks emerges in a more interconnected society. In this context, 5G networks aim to transform how we communicate and interact. However, studies using 5G data are sparse since there are only a few number of publicly available 5G datasets (especially about commercial 5G network metrics with real users).

In this work, we analyze the data of a commercial 5G deployment with real users, and propose forecasting techniques to help understand the trends and to manage 5G networks. We propose the creation of a metric to measure the traffic load. We forecast the metric using several machine learning models, and we choose LightGBM as the best approach. We observe that this approach obtains results with a good accuracy, and better than other machine learning approaches, but its performance decreases if the patterns contain unexpected events. Taking advantage of the lower accuracy in the performance, this is used to detect changes in the patterns and manage the network in real-time, supporting network resource elasticity by generating alarms and automating the scaling during these unpredictable fluctuations.

Moreover, we introduce mobility data and integrate it with the previously traffic load metric, understanding its correlation and the prediction of 5G metrics through the use of the mobility data. We show again that LightGBM is the best model in predicting both types of 5G handovers, intra- and inter-gNB handovers, using the mobility information through Radars in the several roads, and lanes, near the 5G cells.

在互联性更强的社会中，对更安全、可用、可靠和快速网络的需求不断涌现。在此背景下，5G 网络旨在改变我们的通信和互动方式。在这项工作中，我们分析了商用 5G 部署的真实用户数据，并提出了预测技术，以帮助理解趋势和管理 5G 网络。我们建议创建一个指标来衡量流量负载。我们使用多种机器学习模型对该指标进行预测，并选择 LightGBM 作为最佳方法。我们发现，这种方法获得的结果准确性较高，优于其他机器学习方法，但如果模式中包含突发事件，其性能就会下降。此外，我们还引入了移动性数据，并将其与之前的流量负载指标相结合，通过使用移动性数据了解其相关性并预测 5G 指标。我们再次证明，LightGBM 是预测两种类型的 5G 切换（GNB 内切换和 GNB 间切换）的最佳模型，它使用了 5G 小区附近几条道路和车道上的雷达提供的移动信息。

{"title":"A machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility","authors":"Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento","doi":"10.1016/j.comcom.2024.107974","DOIUrl":"10.1016/j.comcom.2024.107974","url":null,"abstract":"<div><div>The demand for more secure, available, reliable, and fast networks emerges in a more interconnected society. In this context, 5G networks aim to transform how we communicate and interact. However, studies using 5G data are sparse since there are only a few number of publicly available 5G datasets (especially about commercial 5G network metrics with real users).</div><div>In this work, we analyze the data of a commercial 5G deployment with real users, and propose forecasting techniques to help understand the trends and to manage 5G networks. We propose the creation of a metric to measure the traffic load. We forecast the metric using several machine learning models, and we choose LightGBM as the best approach. We observe that this approach obtains results with a good accuracy, and better than other machine learning approaches, but its performance decreases if the patterns contain unexpected events. Taking advantage of the lower accuracy in the performance, this is used to detect changes in the patterns and manage the network in real-time, supporting network resource elasticity by generating alarms and automating the scaling during these unpredictable fluctuations.</div><div>Moreover, we introduce mobility data and integrate it with the previously traffic load metric, understanding its correlation and the prediction of 5G metrics through the use of the mobility data. We show again that LightGBM is the best model in predicting both types of 5G handovers, intra- and inter-gNB handovers, using the mobility information through Radars in the several roads, and lanes, near the 5G cells.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107974"},"PeriodicalIF":4.5,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Proactive Scheduling for mmWave Wireless LANs 毫米波无线局域网的主动调度

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-20 DOI: 10.1016/j.comcom.2024.107979

Ang Deng , Douglas M. Blough

To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.

为了满足日益增长的无线带宽需求，毫米波（mmWave）通信被认为是一种有希望提供 Gbps 吞吐量的技术。然而，由于毫米波信号易受阻塞影响，当用户四处移动时，信道条件会发生快速而显著的变化，应用程序的性能也会随之发生很大的变化。在这种情况下，与传统调度器相比，利用未来数据速率预测的主动调度器有可能显著提高性能。在这项工作中，我们探索了利用移动性预测和一些环境知识来预测未来信道条件的主动调度的可能性。我们提出了一种基于整数线性规划公式的最优主动调度器，为主动调度性能提供了一个上限，同时还提出了一种适合实际应用的贪婪启发式主动调度器。广泛的仿真结果表明，与传统的比例公平调度器相比，主动调度有可能将用户平均数据传输速率提高 35%，而不会损失任何公平性，只会导致抖动的少量增加。结果还显示，高效的主动启发式调度器的性能收益是最优主动调度器的 60% 至 75%。最后，研究结果表明，主动调度性能对移动性预测的质量非常敏感，因此必须使用最先进的移动性预测技术才能充分发挥其潜力。

{"title":"Proactive Scheduling for mmWave Wireless LANs","authors":"Ang Deng , Douglas M. Blough","doi":"10.1016/j.comcom.2024.107979","DOIUrl":"10.1016/j.comcom.2024.107979","url":null,"abstract":"<div><div>To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107979"},"PeriodicalIF":4.5,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142552126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms 通过数字孪生辅助服务协调机制优化基于意图的网络中的关键价值指标

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-19 DOI: 10.1016/j.comcom.2024.107977

Federica de Trizio , Giancarlo Sciddurlo , Ilaria Cianci , Giuseppe Piro , Gennaro Boggia

For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.

多年来，网络资源和服务的协调一直是通过考虑同质通信基础设施和简单的服务水平协议（SLA）来解决的，这些协议通常是通过一系列传统的关键性能指标（KPI）来定义的。遗憾的是，对于未来的电信系统而言，最先进的解决方案有可能无法奏效。例如，超越 5G 的网络正在形成一个复杂的异构生态系统，在这个生态系统中，属于不同网络域的资源具有不断发展的能力，可以动态地暴露出来，以支持更加复杂的跨域服务和应用。同时，在定义 SLA 时还要考虑新的性能需求，包括安全、经济和环境需求。基于这些前提，本研究提出了一种新颖的协调策略，旨在满足通过关键价值指标（KVI）表达的服务要求，同时结合网络数字孪生和基于意图的网络的潜力。利用网络数字孪生的洞察力，探索多种服务协调选项，以优化资源利用率。同时，采用基于意图的网络技术，通过意图简化网络管理，通过 KPI 和 KVI 明确超越 5G 的要求。通过多标准决策算法以及映射到意图中的域和服务请求之间的多对多匹配游戏，构想出了一种最佳协调方案，旨在最大限度地减少随着时间推移违反服务水平协议的情况。在现实场景中通过计算机模拟对所构想解决方案的性能进行了研究。所获得的结果清楚地表明了它的有效性，并证明与其他基准技术相比，它能够将违反服务水平协议的情况（与延迟、吞吐量、成本和网络风险要求相关）减少 22.44%。

{"title":"Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms","authors":"Federica de Trizio , Giancarlo Sciddurlo , Ilaria Cianci , Giuseppe Piro , Gennaro Boggia","doi":"10.1016/j.comcom.2024.107977","DOIUrl":"10.1016/j.comcom.2024.107977","url":null,"abstract":"<div><div>For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107977"},"PeriodicalIF":4.5,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An efficient Proof-of-Authority consensus scheme against cloning attacks 对抗克隆攻击的高效权威证明共识方案

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2024-10-18 DOI: 10.1016/j.comcom.2024.107975

Shu-Ping Lu , Chin-Laung Lei , Meng-Han Tsai

Proof-of-Authorization (PoA) consensus algorithms are widely used in permissioned blockchain networks due to their high throughput, security, and efficiency. However, PoA is susceptible to cloning attacks, where attackers copy the authenticator identity and key, thereby compromising the consensus integrity. This study proposes a novel randomized authenticator within the PoA framework to mitigate cloning attacks and solve the leader selection bottleneck. The main contributions include 1) Introducing unpredictability in leader selection through Verifiable Random Functions (VRFs) to prevent identity duplication.2) Dynamic group management using a hierarchical decentralized architecture of distributed ledgers that balances security and performance.3) Using threshold signatures to avoid a single point of failure among validators.4) Comprehensively analyzing attacks, security, randomness, and availability.5) Evaluating the effectiveness of a randomized authenticator by means of OMNET++ simulations to assess efficiency. By integrating randomness into leader selection and robust consensus design, the approach enables reliable and secure dynamic group management in decentralized networks.

授权证明（PoA）共识算法因其高吞吐量、安全性和高效性而被广泛应用于许可区块链网络中。然而，PoA 容易受到克隆攻击，即攻击者复制验证器身份和密钥，从而破坏共识的完整性。本研究在 PoA 框架内提出了一种新型随机验证器，以缓解克隆攻击，解决领导者选择瓶颈。主要贡献包括：1）通过可验证随机函数（VRF）在领导者选择中引入不可预测性，以防止身份重复；2）使用分布式账本的分层分散架构进行动态组管理，以平衡安全性和性能；3）使用阈值签名以避免验证者之间的单点故障；4）全面分析攻击、安全性、随机性和可用性；5）通过 OMNET++ 模拟评估随机验证器的有效性，以评估效率。通过将随机性整合到领导者选择和稳健共识设计中，该方法实现了分散网络中可靠、安全的动态群组管理。

{"title":"An efficient Proof-of-Authority consensus scheme against cloning attacks","authors":"Shu-Ping Lu , Chin-Laung Lei , Meng-Han Tsai","doi":"10.1016/j.comcom.2024.107975","DOIUrl":"10.1016/j.comcom.2024.107975","url":null,"abstract":"<div><div>Proof-of-Authorization (PoA) consensus algorithms are widely used in permissioned blockchain networks due to their high throughput, security, and efficiency. However, PoA is susceptible to cloning attacks, where attackers copy the authenticator identity and key, thereby compromising the consensus integrity. This study proposes a novel randomized authenticator within the PoA framework to mitigate cloning attacks and solve the leader selection bottleneck. The main contributions include 1) Introducing unpredictability in leader selection through Verifiable Random Functions (VRFs) to prevent identity duplication.2) Dynamic group management using a hierarchical decentralized architecture of distributed ledgers that balances security and performance.3) Using threshold signatures to avoid a single point of failure among validators.4) Comprehensively analyzing attacks, security, randomness, and availability.5) Evaluating the effectiveness of a randomized authenticator by means of OMNET++ simulations to assess efficiency. By integrating randomness into leader selection and robust consensus design, the approach enables reliable and secure dynamic group management in decentralized networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107975"},"PeriodicalIF":4.5,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0