Computer Communications最新文献_第2页

MDTA: An efficient, scalable and fast Multiple Disjoint Tree Algorithm for dynamic environments MDTA：适用于动态环境的高效、可扩展且快速的多叉树算法

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-11-02 DOI: 10.1016/j.comcom.2024.107989

Diego Lopez-Pajares , Elisa Rojas , Mankamana Prasad Mishra , Parveen Jindgar , Joaquin Alvarez-Horcajo , Nicolas Manso , Jonathan Desmarais

{"title":"MDTA: An efficient, scalable and fast Multiple Disjoint Tree Algorithm for dynamic environments","authors":"Diego Lopez-Pajares , Elisa Rojas , Mankamana Prasad Mishra , Parveen Jindgar , Joaquin Alvarez-Horcajo , Nicolas Manso , Jonathan Desmarais","doi":"10.1016/j.comcom.2024.107989","DOIUrl":"10.1016/j.comcom.2024.107989","url":null,"abstract":"<div><div>Emerging applications such as telemedicine, the tactile Internet or live streaming place high demands on low latency to ensure a satisfactory Quality of Experience (QoE). In these scenarios the use of trees can be particularly interesting to efficiently deliver traffic to groups of users because they further enhance network performance by providing redundancy and fault tolerance, ensuring service continuity when network failure or congestion scenarios occur. Furthermore, if trees are isolated from each other (they do not share common communication elements as links and/or nodes), their benefits are further enhanced since events such as failures or congestion in one tree do not affect others. However, the challenge of computing fully disjoint trees (both link- and node-disjoint) introduces significant mathematical complexity, resulting in longer computation times, which negatively impacts latency-sensitive applications.</div><div>In this article, we propose a novel algorithm designed to rapidly compute multiple fully (either link- or node-) disjoint trees while maintaining efficiency and scalability, specifically focused on targeting the low-latency requirements of emerging services and applications. The proposed algorithm addresses the complexity of ensuring disjointedness between trees without sacrificing performance. Our solution has been tested in a variety of network environments, including both wired and wireless scenarios.</div><div>The results showcase that our proposed method is approximately 100 times faster than existing techniques, while achieving a comparable success rate in terms of number of obtained disjoint trees. This significant improvement in computational speed makes our approach highly suitable for the low-latency requirements of next-generation networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107989"},"PeriodicalIF":4.5,"publicationDate":"2024-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655175","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

Safe load balancing in software-defined-networking 软件定义网络的安全负载平衡

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-29 DOI: 10.1016/j.comcom.2024.107985

Lam Dinh, Pham Tran Anh Quang, Jérémie Leguay

{"title":"Safe load balancing in software-defined-networking","authors":"Lam Dinh, Pham Tran Anh Quang, Jérémie Leguay","doi":"10.1016/j.comcom.2024.107985","DOIUrl":"10.1016/j.comcom.2024.107985","url":null,"abstract":"<div><div>High performance, reliability and safety are crucial properties of any Software-Defined-Networking (SDN) system. Although the use of Deep Reinforcement Learning (DRL) algorithms has been widely studied to improve performance, their practical applications are still limited as they fail to ensure safe operations in exploration and decision-making. To fill this gap, we explore the design of a Control Barrier Function (CBF) on top of Deep Reinforcement Learning (DRL) algorithms for load-balancing. We show that our DRL-CBF approach is capable of meeting safety requirements during training and testing while achieving near-optimal performance in testing. We provide results using two simulators: a flow-based simulator, which is used for proof-of-concept and benchmarking, and a packet-based simulator that implements real protocols and scheduling. Thanks to the flow-based simulator, we compared the performance against the optimal policy, solving a Non Linear Programming (NLP) problem with the SCIP solver. Furthermore, we showed that pre-trained models in the flow-based simulator, which is faster, can be transferred to the packet simulator, which is slower but more accurate, with some fine-tuning. Overall, the results suggest that near-optimal Quality-of-Service (QoS) performance in terms of end-to-end delay can be achieved while safety requirements related to link capacity constraints are guaranteed. In the packet-based simulator, we also show that our DRL-CBF algorithms outperform non-RL baseline algorithms. When the models are fine-tuned over a few episodes, we achieved smoother QoS and safety in training, and similar performance in testing compared to the case where models have been trained from scratch.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107985"},"PeriodicalIF":4.5,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578599","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 hierarchical adaptive federated reinforcement learning for efficient resource allocation and task scheduling in hierarchical IoT network 分层物联网网络中高效资源分配和任务调度的分层自适应联合强化学习

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-29 DOI: 10.1016/j.comcom.2024.107969

A.S.M. Sharifuzzaman Sagar, Amir Haider, Hyung Seok Kim

{"title":"A hierarchical adaptive federated reinforcement learning for efficient resource allocation and task scheduling in hierarchical IoT network","authors":"A.S.M. Sharifuzzaman Sagar, Amir Haider, Hyung Seok Kim","doi":"10.1016/j.comcom.2024.107969","DOIUrl":"10.1016/j.comcom.2024.107969","url":null,"abstract":"<div><div>The increasing demand for processing numerous data from IoT devices in a hierarchical IoT network drives researchers to propose different resource allocation methods in the edge hosts efficiently. Traditional approaches often compromise on one of these aspects: either prioritizing local decision-making at the edge, which lacks global system insights or centralizing decisions in cloud systems, which raises privacy concerns. Additionally, most solutions do not consider scheduling tasks at the same time to effectively complete the prioritized task accordingly. This study introduces the hierarchical adaptive federated reinforcement learning (HAFedRL) framework for robust resource allocation and task scheduling in hierarchical IoT networks. At the local edge host level, a primal–dual update based deep deterministic policy gradient (DDPG) method is introduced for effective individual task resource allocation and scheduling. Concurrently, the central server utilizes an adaptive multi-objective policy gradient (AMOPG) which integrates a multi-objective policy adaptation (MOPA) with dynamic federated reward aggregation (DFRA) method to allocate resources across connected edge hosts. An adaptive learning rate modulation (ALRM) is proposed for faster convergence and to ensure high performance output from HAFedRL. Our proposed HAFedRL enables the effective integration of reward from edge hosts, ensuring the alignment of local and global optimization goals. The experimental results of HAFedRL showcase its efficacy in improving system-wide utility, average task completion rate, and optimizing resource utilization, establishing it as a robust solution for hierarchical IoT networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107969"},"PeriodicalIF":4.5,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655117","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

5G core network control plane: Network security challenges and solution requirements 5G 核心网络控制平面：网络安全挑战和解决方案要求

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107982

Rajendra Patil , Zixu Tian , Mohan Gurusamy , Joshua McCloud

引用次数: 0

Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices 评估 COTS Wi-Fi 设备 FTM 测距程序中突发大小的影响

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107980

Enrica Zola, Israel Martin-Escalona

{"title":"Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices","authors":"Enrica Zola, Israel Martin-Escalona","doi":"10.1016/j.comcom.2024.107980","DOIUrl":"10.1016/j.comcom.2024.107980","url":null,"abstract":"<div><div>The wide availability of the Wi-Fi infrastructure together with the recent integration of the IEEE 802.11mc capability in common-off-the-shelf (COTS) devices, have contributed to increasing the interest of the research community in the fine time measurement (FTM) technique, which allows two Wi-Fi devices to estimate distances between each other. However, one of the main issues yet to be solved is how it scales with an increasing number of Wi-Fi devices injecting location-specific traffic in the shared medium. While the recently released IEEE 802.11az standard will still take time before being integrated in COTS devices, this paper aims at assessing the impact of the burst size on the ranging performance of COTS Wi-Fi Android devices running release 12. While increasing the burst size is expected to bring higher stability in the observed distance, on the other hand a longer transmission period for location-only purposes may jeopardize the transmission of data traffic among Wi-Fi users. Several models of smartphones and APs, and different frequency bands, have been considered in order to evaluate the behavior of the FTM procedure in real devices, showing that not always the newest or most expensive ones perform better. Also, it is shown that using the minimum burst size significantly decreases the performance and it is thus not recommended. While bursts longer than 8 may no be always supported by all the models and/or frequency bands, the small improvements in ranging estimations obtained when they are used do not always justify the increased location traffic injected in the network.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107980"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571857","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

Communication-efficient heterogeneous multi-UAV task allocation based on clustering 基于聚类的通信高效异构多无人机任务分配

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107986

Na Dong, Shuai Liu, Xiaoming Mai

{"title":"Communication-efficient heterogeneous multi-UAV task allocation based on clustering","authors":"Na Dong, Shuai Liu, Xiaoming Mai","doi":"10.1016/j.comcom.2024.107986","DOIUrl":"10.1016/j.comcom.2024.107986","url":null,"abstract":"<div><div>The heterogeneous unmanned aerial vehicle (UAV) system aims to achieve higher-level task coordination and execution by integrating UAVs of different types, functionalities, and scales. Addressing the diverse and complex requirements of tasks, the allocation algorithm for decentralized multi-UAV systems often encounters communication redundancy, leading to the issue of excessive communication overhead. This paper proposes a clustering-based Consensus-Based Bundle Algorithm (Clustering-CBBA), which introduces a novel bundle construction, an improved consensus strategy, and a distance-based UAV grouping approach. Specifically, utilizing the k-means++ method based on distance factors, UAVs are initially partitioned into different clusters, breaking down the large-scale problem into smaller ones. Subsequently, the first UAV in each cluster is designated as the leader UAV. The proposed algorithm can handle multi-UAV tasks by improving the task bundle construction method and consensus algorithm. Additionally, intra-cluster UAVs employ an internal conflict resolution method to gather the latest information, while inter-cluster UAVs use an external conflict resolution method to ensure conflict-free task allocation, continuing until the algorithm converges. Experimental results demonstrate that the proposed method, compared to DMCHBA, G-CBBA, and baseline CBBA, significantly reduces communication overhead across different task scales and UAV quantities. Moreover, it maintains ideal performance regarding task completion and global task reward, showcasing higher efficiency and practicality.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107986"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593858","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

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

IF 4.5 3区计算机科学

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

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

{"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区计算机科学

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

Dimitrios Zorbas, Aruzhan Sabyrbek

引用次数: 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区计算机科学

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》特刊