Computer Networks最新文献_第4页

PETIT: PUF-enabled trust evaluation framework for IoT networks PETIT：支持 PUF 的物联网网络信任评估框架

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-04 DOI: 10.1016/j.comnet.2024.110772

{"title":"PETIT: PUF-enabled trust evaluation framework for IoT networks","authors":"","doi":"10.1016/j.comnet.2024.110772","DOIUrl":"10.1016/j.comnet.2024.110772","url":null,"abstract":"<div><p>Internet-of-Things (IoT) is characterized by the incorporation of resource constrained devices that are inter-networked in an ad-hoc manner. Given the diversity of the devices and the operating conditions, it is important to assess the trustworthiness of IoT nodes and factor it in the network management. Contemporary trust evaluation and management schemes found in the literature mostly consider observable network-level behavior parameters and initially assume that all nodes are equally trustworthy owing to the absence of historical data or background. Such an equal trust initialization approach raises concerns in terms of accuracy, fairness, and adaptability. This paper aims to mitigate these shortcomings by proposing a novel trust evaluation and aggregation framework. Our framework leverages hardware primitives such as Physical Unclonable Functions (PUFs) to assign trust scores at the network bootstrapping phase. The paper explores the establishment of both direct and recommendation based indirect trust score evaluation and detection of irregularities to ensure the dynamic, safe, and reliable operation of the network. Simulation outcomes demonstrate that the trust value computed through this mechanism effectively and precisely mirrors the node’s credibility.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142163176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Two-timescale joint service caching and resource allocation for task offloading with edge–cloud cooperation 利用边缘-云合作实现任务卸载的双倍规模联合服务缓存和资源分配

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-04 DOI: 10.1016/j.comnet.2024.110771

{"title":"Two-timescale joint service caching and resource allocation for task offloading with edge–cloud cooperation","authors":"","doi":"10.1016/j.comnet.2024.110771","DOIUrl":"10.1016/j.comnet.2024.110771","url":null,"abstract":"<div><p>Task offloading with edge–cloud cooperation has emerged as a pivotal solution for meeting the intricate array of application coupled with dynamically evolving business demand in 6G business scenarios, such as traffic sensing, environmental monitoring, and video surveillance in smart cities. Nonetheless, effectively leveraging heterogeneous edge–cloud network resources for effective task offloading presents substantial challenges. Additionally, the inherent differences in system decision cycles escalate the complexity of the task offloading problem to a new dimension. In this study, we delve into a two-timescale joint service caching and resource allocation optimization for task offloading within edge–cloud cooperation aiming to maximize long-term network performance while adhering to energy constraints. We propose a novel edge–cloud cooperation task offloading scheme that supports both edge–cloud and edge–edge cooperation to effectively balance the edge–cloud and edge–edge loads, promoting the efficient co-utilization of all edge–cloud system resources. Furthermore, we devise an online two-timescale Lyapunov-based joint optimization framework for service caching, task offloading, and computing resource allocation. Our two-timescale decision-making framework can flexibly accommodate the inherent differences in the sensitive decision optimization periods, thereby mitigating the degradation of task offloading performance caused by frequent service caching updates. Finally, theoretical analysis confirms that our proposed algorithm can converge to an approximate optimal solution in polynomial time, and the superiority of our scheme is validated by extensive simulation experiments.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142148188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

PartChain: Scaling blockchain through account-based partitioned sharding PartChain：通过基于账户的分区分片扩展区块链

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-04 DOI: 10.1016/j.comnet.2024.110773

{"title":"PartChain: Scaling blockchain through account-based partitioned sharding","authors":"","doi":"10.1016/j.comnet.2024.110773","DOIUrl":"10.1016/j.comnet.2024.110773","url":null,"abstract":"<div><p>Sharding technology, as one of the mainstream methods for overcoming the scalability bottlenecks in blockchain, divides the nodes of the entire blockchain network into several subsets to process multiple sets of transactions in parallel. However, as the number of shards continues to increase, the number of cross-shard transactions also increases. The proportion of cross-shard transactions may become very high, leading to increased communication costs, higher time expenses, and reduced transaction throughput in the sharded system.</p><p>In this paper, we propose a sharding system called PartChain based on the idea of account partitioning. In PartChain, we partition accounts using aggregation to encourage transactions to occur within a single shard, thereby reducing cross-shard transactions. For the remaining cross-shard transactions, we have designed a cross-shard consensus mechanism based on collective signatures to enhance the security of such transactions. Finally, we have implemented a prototype of PartChain and conducted research and evaluation. Experimental results demonstrate that, compared to traditional solutions, our cross-shard transaction ratio has decreased by 67%, and transaction throughput has increased by 1.9 times.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

eXO: A commons-based community network Internet Service Provider, description and subscribers usage patterns eXO：基于公共资源的社区网络互联网服务提供商、说明和用户使用模式

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-03 DOI: 10.1016/j.comnet.2024.110765

{"title":"eXO: A commons-based community network Internet Service Provider, description and subscribers usage patterns","authors":"","doi":"10.1016/j.comnet.2024.110765","DOIUrl":"10.1016/j.comnet.2024.110765","url":null,"abstract":"<div><p>The advent of Wi-Fi in the 1990s stimulated the creation of Community networks (CNs), a new networking paradigm deployed and maintained by their users. The non-profit and grassroots self-organization of CNs has shown significant potential in enhancing communication technologies grounded in ethical values, transcending mere Internet expansion to contribute to broader social impacts. Since its conception, hundreds of CNs have been deployed worldwide. However, many have faltered, primarily due to a lack of solid economic models and legal setup. This paper presents <em>Expansió Xarxa Oberta (eXO)</em> association, a commons Internet Service Provider (ISP). In contrast to commercial ISPs, eXO follows the same grassroots principles of CNs. Establishing a commons-based ISP is challenging, yet it is a key component for the sustainability and success of CNs. Therefore, our paper aims to dissect the complexity of a commons ISP by explaining eXO, a pioneering example that has already been in production for more than 14 years. To the best of our knowledge, this is the first time that a commons ISP is described in all its components.</p><p>To describe eXO, we have proceeded in two parts. In the first one, we delineate the organizational structure, economics, funding mechanisms, activities, legal framework, and infrastructure. To gain more insight on eXO, in the second part, we conduct a technical analysis of traffic data collected from eXO’s core router, elucidating subscriber usage patterns. Our study encompasses various subscriber categories, including regular and financially subsidized users, Wi-Fi and optical fiber access, and traffic characteristics such as volume, TCP/UDP usage, services accessed, and traffic distribution across countries.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1389128624005978/pdfft?md5=d3b1e3beea5ac07595517347e441e0cb&pid=1-s2.0-S1389128624005978-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142163175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance enhancement of NOMA multi-user networks with aerial reconfigurable intelligent surfaces and aerial relay 利用空中可重构智能表面和空中中继提高 NOMA 多用户网络的性能

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-03 DOI: 10.1016/j.comnet.2024.110767

{"title":"Performance enhancement of NOMA multi-user networks with aerial reconfigurable intelligent surfaces and aerial relay","authors":"","doi":"10.1016/j.comnet.2024.110767","DOIUrl":"10.1016/j.comnet.2024.110767","url":null,"abstract":"<div><p>In this article, we propose a combination of multiple aerial reconfigurable intelligent surfaces (ARISs) with an aerial relay (AR) for improving the performance of multiple users adopting the non-orthogonal multiple access (NOMA) scheme. In particular, two groups of ARIS are utilized, one for aiding ground-to-air (G2A) communication and another one for aiding air-to-ground (A2G) communication. Mathematical formulas of outage probability (OP), throughput, and achievable capacity (AC) of every user in the proposed ARISs-AR-NOMA network are derived over the Nakagami-<span><math><mi>m</mi></math></span> channel. The propagation environment recommended for the fifth generation and beyond (5G/B5G) is applied to enhance the practical behavior of the proposed network. To confirm the performance enhancement, we compare the OP, throughput, and AC of the proposed system with the conventional AR-NOMA network (i.e., without ARISs). Numerical illustrations demonstrate the great benefits of the proposed ARISs-AR-NOMA network, its transmit power is dramatically lower than that of the conventional network. Moreover, the throughput and AC of the proposed network are considerably higher than the conventional network’s. Based on the effect of key parameters and network behaviors, various effective solutions are recommended to enhance the performance of the proposed ARISs-AR-NOMA network.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142147582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

LFGurad: A Defense against Label Flipping Attack in Federated Learning for Vehicular Network LFGurad：防御车载网络联合学习中的标签翻转攻击

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-03 DOI: 10.1016/j.comnet.2024.110768

{"title":"LFGurad: A Defense against Label Flipping Attack in Federated Learning for Vehicular Network","authors":"","doi":"10.1016/j.comnet.2024.110768","DOIUrl":"10.1016/j.comnet.2024.110768","url":null,"abstract":"<div><p>The explosive growth of the interconnected vehicle network creates vast amounts of data within individual vehicles, offering exciting opportunities to develop advanced applications. FL (Federated Learning) is a game-changer for vehicular networks, enabling powerful distributed data processing across vehicles to build intelligent applications while promoting collaborative training and safeguarding data privacy. However, recent research has exposed a critical vulnerability in FL: poisoning attacks, where malicious actors can manipulate data, labels, or models to subvert the system. Despite its advantages, deploying FL in dynamic vehicular environments with a multitude of distributed vehicles presents unique challenges. One such challenge is the potential for a significant number of malicious actors to tamper with data. We propose a hierarchical FL framework for vehicular networks to address these challenges, promising lower latency and coverage. We also present a defense mechanism, LFGuard, which employs a detection system to pinpoint malicious vehicles. It then excludes their local models from the aggregation stage, significantly reducing their influence on the final outcome. We evaluate LFGuard against state-of-the-art techniques using the three popular benchmark datasets in a heterogeneous environment. Results illustrate LFGuard outperforms prior studies in thwarting targeted label-flipping attacks with more than 5% improvement in the global model accuracy, 12% in the source class recall, and a 6% reduction in the attack success rate while maintaining high model utility.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142158040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Collaborative last-hop scheduling strategy for large-scale LEO constellation routing 大规模低地轨道星座路由的末跳协作调度策略

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-03 DOI: 10.1016/j.comnet.2024.110760

{"title":"Collaborative last-hop scheduling strategy for large-scale LEO constellation routing","authors":"","doi":"10.1016/j.comnet.2024.110760","DOIUrl":"10.1016/j.comnet.2024.110760","url":null,"abstract":"<div><p>The transmission of data packets from satellites to Earth Stations (ESs) is the last hop of satellite network routing. As the final stage of packet transmission, the use of different scheduling strategies directly affects the throughput of the satellite network. Traditionally, researchers have attempted to enhance network performance by investigating inter-satellite routing protocols or inter-satellite data offloading strategies. However, these approaches have failed to address scheduling issues in the last hop of large-scale Low Earth Orbit (LEO) constellations. In this paper, we present the first Cooperative Last-Hop Scheduling (CLHS) strategy for routing in large-scale LEO constellations based on a bidirectional communication domain. In this strategy, we first utilize the bidirectional communication domain to determine the communication ranges of satellites and ESs. Subsequently, an information flow is established to interact with ESs and satellites. The ESs receive and reconstruct the Information Matrix (IM) from the information flow. Moreover, we propose the Maximum Decision Value Priority (MDVP) algorithm, which takes the reconstructed IM as input and computes the scheduling commands for satellites within the communication range of the ESs. To address the issue of multiple ESs simultaneously scheduling the same satellite, we introduce the Collision Avoidance Algorithm (CAA). Finally, to enhance the data packet transmission efficiency of the scheduled satellites, we propose the Weighted First-In-First-Out (WFIFO) algorithm, which is specifically designed for satellite packet dequeuing. We validate the CLHS through simulations on two satellite constellations: the first-generation Starlink constellation with 4409 satellites and the GW-2 constellation with 6912 satellites. The results show that CLHS can achieve better network throughput than traditional strategies. CLHS provides a novel method of scheduling the last hop in large-scale satellite constellations.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142135857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

MpScope: Enabling multi-pipeline monitoring inside a switch MpScope：在交换机内部实现多管道监控

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-03 DOI: 10.1016/j.comnet.2024.110764

{"title":"MpScope: Enabling multi-pipeline monitoring inside a switch","authors":"","doi":"10.1016/j.comnet.2024.110764","DOIUrl":"10.1016/j.comnet.2024.110764","url":null,"abstract":"<div><p>The core of programmable switches is the flexible data plane, composed of multiple programmable pipelines in existing programmable switches. These pipelines are isolated from each other and cannot share state and data. However, most of network monitoring systems ignore this condition and implicitly assume that the switch has only a single pipeline. This results in an inaccurate measurement and high communication overhead with the practical switch. To tackle this problem, we propose <em>MpScope</em>, a general multi-pipeline monitoring framework, which centers around the control plane, supporting accurate and efficient network monitoring. Specifically, <em>MpScope</em> combines the switch’s data plane and control plane to achieve comprehensive network monitoring of the whole switch scope. The control plane aggregates the statistical results from multiple pipelines and tunes the monitoring module residing in the different pipelines in the data plane dynamically. The data plane is responsible for real-time traffic measurement and statistic reports. Its behaviors can be adjusted periodically with the instructions from the control plane. Two typical monitoring applications, <em>i.e.</em>, heavy hitter detection and distinct counting, are developed with <em>MpScope</em> to validate the effectiveness of multi-pipeline monitoring. Experiments show that <em>MpScope</em> significantly reduces communication overhead compared to the static threshold scheme while maintaining high detection accuracy over time.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Low-latency intelligent service combination caching strategy with density peak clustering algorithm in vehicle edge computing 车辆边缘计算中采用密度峰值聚类算法的低延迟智能服务组合缓存策略

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-02 DOI: 10.1016/j.comnet.2024.110761

{"title":"Low-latency intelligent service combination caching strategy with density peak clustering algorithm in vehicle edge computing","authors":"","doi":"10.1016/j.comnet.2024.110761","DOIUrl":"10.1016/j.comnet.2024.110761","url":null,"abstract":"<div><p>In the dynamic field of Vehicle Edge Computing (VEC), the demand for intelligent vehicular systems to process vast amounts of data is escalating, driven by advancements in autonomous driving and real-time navigation technologies. Optimizing service latency and minimizing transmission costs are crucial for enhancing the performance of vehicular networks. Traditional service caching strategies, which largely rely on the popularity of individual services, often fail to account for the intricate interdependencies between services. The oversight can result in redundant data transfers and inefficient use of storage resources. In response, our paper introduces a novel approach to service combination caching within a heterogeneous computational framework comprising vehicles, edge servers, and the cloud. Our strategy focuses on minimizing user wait times and data transmission costs during task execution, while adhering to the caching budget constraints of service providers. Key contributions include the development of an Improved Density Peak Clustering (IDPC) algorithm to facilitate cooperative clustering among edge servers and the design of a Service Combination Caching Strategy (SCCS). The SCCS approach reduces caching costs by categorizing servers, forming efficient clusters, and strategically allocating storage. Simulation results demonstrate that the method outperforms existing strategies by significantly decreasing task execution delays and transmission costs, thereby greatly enhancing the quality of service in vehicular applications.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142148190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Intelligent resource allocation in wireless networks: Predictive models for efficient access point management 无线网络中的智能资源分配：高效接入点管理的预测模型

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-09-02 DOI: 10.1016/j.comnet.2024.110762

{"title":"Intelligent resource allocation in wireless networks: Predictive models for efficient access point management","authors":"","doi":"10.1016/j.comnet.2024.110762","DOIUrl":"10.1016/j.comnet.2024.110762","url":null,"abstract":"<div><p>With the significant increase in mobile users connected to the wireless network, coupled with the escalating energy consumption and the risk of network saturation, the search for resource management has become paramount. Managing several access points throughout a whole region is hugely relevant in this context. Moreover, a wireless network must keep its Service Level Agreement, regardless of the number of connected users. With that in mind, in this work, we propose four prediction models that allow one to predict the number of connected users on a wireless network. Once the number of users has been predicted, the network resources can be properly allocated, minimizing the number of active access points. We investigate the use of Particle Swarm Optimization and Genetic Algorithms to hyper-parameterize a Multilayer Perceptron neural network and a Decision Tree. We evaluate our proposal using a campus-based wireless network dataset with more than 20,000 connected users. As a result, our model can considerably improve network performance by intelligently allocating the number of access points, thereby addressing concerns related to energy consumption and network saturation. The results have shown an average accuracy of 95.18%, managing to save network resources effectively.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1389128624005942/pdfft?md5=8db2023c48b0819947efcc292aa13c43&pid=1-s2.0-S1389128624005942-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0