IEEE/ACM Transactions on Networking最新文献_第5页

IEEE/ACM Transactions on Networking Publication Information IEEE/ACM Transactions on Networking 出版信息

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-20 DOI: 10.1109/TNET.2024.3429991

引用次数: 0

FOSS: Towards Fine-Grained Unknown Class Detection Against the Open-Set Attack Spectrum With Variable Legitimate Traffic :针对具有可变合法流量的开放集攻击频谱，实现细粒度未知类别检测

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-19 DOI: 10.1109/TNET.2024.3413789

Ziming Zhao;Zhaoxuan Li;Xiaofei Xie;Jiongchi Yu;Fan Zhang;Rui Zhang;Binbin Chen;Xiangyang Luo;Ming Hu;Wenrui Ma

{"title":"FOSS: Towards Fine-Grained Unknown Class Detection Against the Open-Set Attack Spectrum With Variable Legitimate Traffic","authors":"Ziming Zhao;Zhaoxuan Li;Xiaofei Xie;Jiongchi Yu;Fan Zhang;Rui Zhang;Binbin Chen;Xiangyang Luo;Ming Hu;Wenrui Ma","doi":"10.1109/TNET.2024.3413789","DOIUrl":"10.1109/TNET.2024.3413789","url":null,"abstract":"Anomaly-based network intrusion detection systems (NIDSs) are essential for ensuring cybersecurity. However, the security communities realize some limitations when they put most existing proposals into practice. The challenges are mainly concerned with (i) fine-grained unknown attack detection and (ii) ever-changing legitimate traffic adaptation. To tackle these problem, we present three key design norms. The core idea is to construct a model to split the data distribution hyperplane and leverage the concept of isolation, as well as advance the incremental model update. We utilize the isolation tree as the backbone to design our model, named FOSS, to echo back three norms. By analyzing the popular dataset of network intrusion traces, we show that FOSS significantly outperforms the state-of-the-art methods. Further, we perform an initial deployment of FOSS by working with the Internet Service Provider (ISP) to detect distributed denial of service (DDoS) attacks. With real-world tests and manual analysis, we demonstrate the effectiveness of FOSS to identify previously-unseen attacks in a fine-grained manner.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 5","pages":"3945-3960"},"PeriodicalIF":3.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227533","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

Straggler-Aware Gradient Aggregation for Large-Scale Distributed Deep Learning System 面向大规模分布式深度学习系统的 "意识到落伍者 "梯度聚合技术

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-19 DOI: 10.1109/TNET.2024.3441039

Yijun Li;Jiawei Huang;Zhaoyi Li;Jingling Liu;Shengwen Zhou;Tao Zhang;Wanchun Jiang;Jianxin Wang

{"title":"Straggler-Aware Gradient Aggregation for Large-Scale Distributed Deep Learning System","authors":"Yijun Li;Jiawei Huang;Zhaoyi Li;Jingling Liu;Shengwen Zhou;Tao Zhang;Wanchun Jiang;Jianxin Wang","doi":"10.1109/TNET.2024.3441039","DOIUrl":"10.1109/TNET.2024.3441039","url":null,"abstract":"Deep Neural Network (DNN) is a critical component of a wide range of applications. However, with the rapid growth of the training dataset and model size, communication becomes the bottleneck, resulting in low utilization of computing resources. To accelerate communication, recent works propose to aggregate gradients from multiple workers in the programmable switch to reduce the volume of exchanged data. Unfortunately, since using synchronization transmission to aggregate data, current in-network aggregation designs suffer from the straggler problem, which often occurs in shared clusters due to resource contention. To address this issue, we propose a straggler-aware aggregation transport protocol (SA-ATP), which enables the leading worker to leverage the spare computing and storage resources to help the straggling worker. We implement SA-ATP atop clusters using P4-programmable switches. The evaluation results show that SA-ATP reduces the iteration time by up to 57% and accelerates training by up to \u0000<inline-formula> <tex-math>$1.8times $ </tex-math></inline-formula>\u0000 in real-world benchmark models.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4917-4930"},"PeriodicalIF":3.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142223326","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

Precise Wireless Charging in Complicated Environments 在复杂环境中实现精确无线充电

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-16 DOI: 10.1109/TNET.2024.3441113

Wei Yang;Chi Lin;Haipeng Dai;Jiankang Ren;Lei Wang;Guowei Wu;Qiang Zhang

{"title":"Precise Wireless Charging in Complicated Environments","authors":"Wei Yang;Chi Lin;Haipeng Dai;Jiankang Ren;Lei Wang;Guowei Wu;Qiang Zhang","doi":"10.1109/TNET.2024.3441113","DOIUrl":"10.1109/TNET.2024.3441113","url":null,"abstract":"Wireless Rechargeable Sensor Networks (WRSNs) have become an important research issue as they can overcome the energy bottleneck problem of wireless sensor networks. However, inaccurate discretization methods and imprecise charging models yield a huge gap between theoretical results and practical applications, making it difficult for wide adoptions. In this paper, we focus on designing a precise charging method for maximizing charging utility when line-of-sight (LOS) and none-line-of-sight (NLOS) charging cases exist in complicated environments. First, we design discretization methods for charging area and charging orientation for precisely constructing the charging model. Then, we develop a novel electromagnetic wave reflection model to describe the signal propagation model in the presence of obstacles. We formalize the mobile charging problem into a submodular function maximization problem which can be solved by a proposed algorithm with an approximation guarantee. Finally, extensive experiments and simulations demonstrate that our schemes outperform comparison algorithms by 32.5% on average in charging utility in complicated environments.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4944-4959"},"PeriodicalIF":3.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227534","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

Time-Efficient Blockchain-Based Federated Learning 基于区块链的高效时间联合学习

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-14 DOI: 10.1109/TNET.2024.3436862

Rongping Lin;Fan Wang;Shan Luo;Xiong Wang;Moshe Zukerman

{"title":"Time-Efficient Blockchain-Based Federated Learning","authors":"Rongping Lin;Fan Wang;Shan Luo;Xiong Wang;Moshe Zukerman","doi":"10.1109/TNET.2024.3436862","DOIUrl":"10.1109/TNET.2024.3436862","url":null,"abstract":"Federated Learning (FL) is a distributed machine learning method that ensures the privacy and security of participants’ data by avoiding direct data upload to a central node for training. However, the traditional FL typically applies a star structure with cloud servers as the central aggregator for the model parameters from different terminals, leading to problems such as central failure, malicious tampering and malicious participants, resulting in training errors or system crashes. To address these issues, a permissioned blockchain is used to build a secure and reliable data-sharing platform among participating terminals, replacing the central aggregator in the traditional FL called blockchain-based federated learning. However, the block generation method of the blockchain system may introduce significant latency in the federated learning where distributed model parameters upload randomly, resulting in low efficiency of the federated learning. To overcome this, we propose a block generation strategy that groups terminals and generates a block for each group, which minimizes the latency of a single round of federated learning, and an optimal block generation algorithm that considers data distribution, terminal resources, and network resources is provided. The analysis shows that the proposed algorithm can effectively obtain the optimal solution of block generation to minimize the authentication time, and we conduct extensive experiments that demonstrate the time efficiency of the proposed algorithm.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4885-4900"},"PeriodicalIF":3.0,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142223327","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

Warmonger Attack: A Novel Attack Vector in Serverless Computing 暖男攻击：无服务器计算中的新型攻击向量

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-08 DOI: 10.1109/TNET.2024.3437432

Junjie Xiong;Mingkui Wei;Zhuo Lu;Yao Liu

{"title":"Warmonger Attack: A Novel Attack Vector in Serverless Computing","authors":"Junjie Xiong;Mingkui Wei;Zhuo Lu;Yao Liu","doi":"10.1109/TNET.2024.3437432","DOIUrl":"10.1109/TNET.2024.3437432","url":null,"abstract":"We debut the Warmonger attack, a novel attack vector that can cause denial-of-service between a serverless computing platform and an external content server. The Warmonger attack exploits the fact that a serverless computing platform shares the same set of egress IPs among all serverless functions, which belong to different users, to access an external content server. As a result, a malicious user on this platform can purposefully misbehave and cause these egress IPs to be blocked by the content server, resulting in a platform-wide denial of service. To validate the effectiveness of the Warmonger attack, we conducted extensive experiments over several months, collecting and analyzing the egress IP usage patterns of five prominent serverless service providers (SSPs): Amazon Web Service (AWS) Lambda, Google App Engine, Microsoft Azure Functions, Cloudflare Workers, and Alibaba Function Compute. Additionally, we conducted a thorough evaluation of the attacker’s potential actions to compromise an external server and trigger IP blocking. Our findings revealed that certain SSPs employ surprisingly small sets of egress IPs, sometimes as few as four, which are shared among their user base. Furthermore, our research demonstrates that the serverless platform offers ample opportunities for malicious users to engage in well-known disruptive behaviors, ultimately resulting in IP blocking. Our study uncovers a significant security threat within the burgeoning serverless computing platform and sheds light on potential mitigation strategies, such as the detection of malicious serverless functions and the isolation of such entities.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4826-4841"},"PeriodicalIF":3.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937383","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

Cost-Efficient Federated Learning for Edge Intelligence in Multi-Cell Networks 为多细胞网络中的边缘智能提供低成本高效率的联合学习

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-07 DOI: 10.1109/TNET.2024.3423316

Tao Wu;Yuben Qu;Chunsheng Liu;Haipeng Dai;Chao Dong;Jiannong Cao

{"title":"Cost-Efficient Federated Learning for Edge Intelligence in Multi-Cell Networks","authors":"Tao Wu;Yuben Qu;Chunsheng Liu;Haipeng Dai;Chao Dong;Jiannong Cao","doi":"10.1109/TNET.2024.3423316","DOIUrl":"10.1109/TNET.2024.3423316","url":null,"abstract":"The proliferation of various mobile devices with massive data and improving computing capacity have prompted the rise of edge artificial intelligence (Edge AI). Without revealing the raw data, federated learning (FL) becomes a promising distributed learning paradigm that caters to the above trend. Nevertheless, due to periodical communication for model aggregation, it would incur inevitable costs in terms of training latency and energy consumption, especially in multi-cell edge networks. Thus motivated, we study the joint edge aggregation and association problem to achieve the cost-efficient FL performance, where the model aggregation over multiple cells just happens at the network edge. After analyzing the NP-hardness with complex coupled variables, we transform it into a set function optimization problem and prove the objective function shows neither submodular nor supermodular property. By decomposing the complex objective function, we reconstruct a substitute function with the supermodularity and the bounded gap. On this basis, we design a two-stage search-based algorithm with theoretical performance guarantee. We further extend to the case of flexible bandwidth allocation and design the decoupled resource allocation algorithm with reduced computation size. Finally, extensive simulations and field experiments based on the testbed are conducted to validate both the effectiveness and near-optimality of our proposed solution.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 5","pages":"4472-4487"},"PeriodicalIF":3.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937386","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

Polygon: A QUIC-Based CDN Server Selection System Supporting Multiple Resource Demands 多边形：基于 QUIC 的 CDN 服务器选择系统，支持多种资源需求

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-08-01 DOI: 10.1109/TNET.2024.3425227

Mengying Zhou;Tiancheng Guo;Yang Chen;Yupeng Li;Meng Niu;Xin Wang;Pan Hui

{"title":"Polygon: A QUIC-Based CDN Server Selection System Supporting Multiple Resource Demands","authors":"Mengying Zhou;Tiancheng Guo;Yang Chen;Yupeng Li;Meng Niu;Xin Wang;Pan Hui","doi":"10.1109/TNET.2024.3425227","DOIUrl":"10.1109/TNET.2024.3425227","url":null,"abstract":"CDN is a crucial Internet infrastructure ensuring quick access to Internet content. With the expansion of CDN scenarios, beyond delay, resource types like bandwidth and CPU are also important for CDN performance. Our measurements highlight the distinct impacts of various resource types on different CDN requests. Unfortunately, mainstream CDN server selection schemes only consider a single resource type and are unable to choose the most suitable servers when faced with diverse resource types. To fill this gap, we propose Polygon, a QUIC-powered CDN server selection system that is aware of multiple resource demands. Being an advanced transport layer protocol, QUIC equips Polygon with customizable transport parameters to enable the seamless handling of resource requirements in requests. Its 0-RTT and connection migration mechanisms are also utilized to minimize delays in connection and forwarding. A set of collaborative measurement probes and dispatchers are designed to support Polygon, being responsible for capturing various resource information and forwarding requests to suitable CDN servers. Real-world evaluations on the Google Cloud Platform and extensive simulations demonstrate Polygon’s ability to enhance QoE and optimize resource utilization. The results show up to a 54.8% reduction in job completion time, and resource utilization improvements of 13% in bandwidth and 7% in CPU.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4585-4599"},"PeriodicalIF":3.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141881002","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

ProbeGeo: A Comprehensive Landmark Mining Framework Based on Web Content ProbeGeo：基于网络内容的综合地标挖掘框架

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-07-30 DOI: 10.1109/TNET.2024.3422089

Jinlei Lin;Chenglong Li;Wenwen Gong;Guanglei Song;Linna Fan;Zhiliang Wang;Jiahai Yang

{"title":"ProbeGeo: A Comprehensive Landmark Mining Framework Based on Web Content","authors":"Jinlei Lin;Chenglong Li;Wenwen Gong;Guanglei Song;Linna Fan;Zhiliang Wang;Jiahai Yang","doi":"10.1109/TNET.2024.3422089","DOIUrl":"10.1109/TNET.2024.3422089","url":null,"abstract":"IP geolocation is essential for various location-aware Internet applications. High-quality IP geolocation landmarks play a decisive role in IP geolocation accuracy. However, the previous research works focusing on mining landmarks from the Internet are hampered by limited quantity, poor coverage, and insufficient landmark quality. In this paper, we present a new framework called ProbeGeo to mine high-quality landmarks automatically. We divide landmarks into common landmarks and probe landmarks, providing systematic mining methods based on online retrieval and web content. ProbeGeo expands traditional common landmarks by taking advantage of the exposure of multiple IoT (Internet of Things) devices on the Internet, mining them based on search engines and webpage contents. Common landmarks, consisting of multi-type devices, significantly improve landmark quantity and coverage. Furthermore, ProbeGeo establishes a methodology for acquiring new probe landmarks from Internet VPs (Vantage Points) webpages, extracting geographical locations from heterogeneous webpages and utilizing active probe functions. Probe landmarks enhance landmark quality and functions, bringing new geolocation frameworks and breaking through the geolocation accuracy bottleneck. We develop the ProbeGeo as a continuously running system and conduct real-world experiments to validate its efficacy. Our results show that ProbeGeo can detect 89,849 high-quality landmarks, including 6,874 probe landmarks and 82,975 common landmarks. ProbeGeo landmarks are about 10x more than existing work, distributed in 181 countries and 7,094 cities. ProbeGeo landmarks cover more than 8 types of devices, and more than 60% of them remain stable over one month. Moreover, the landmark accuracy of more than 58% of ProbeGeo landmarks is above street level, which has not been achieved in previous works. ProbeGeo can provide geolocation services with higher landmark accuracy and broader coverage by correlating a large scale of landmarks.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 5","pages":"4398-4413"},"PeriodicalIF":3.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862856","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

Analysis of Fork-Join Scheduling on Heterogeneous Parallel Servers 异构并行服务器上的叉接调度分析

IF 3 3区计算机科学

IEEE/ACM Transactions on Networking Pub Date : 2024-07-29 DOI: 10.1109/TNET.2024.3432183

Moonmoon Mohanty;Gaurav Gautam;Vaneet Aggarwal;Parimal Parag

{"title":"Analysis of Fork-Join Scheduling on Heterogeneous Parallel Servers","authors":"Moonmoon Mohanty;Gaurav Gautam;Vaneet Aggarwal;Parimal Parag","doi":"10.1109/TNET.2024.3432183","DOIUrl":"10.1109/TNET.2024.3432183","url":null,"abstract":"This paper investigates the \u0000<inline-formula> <tex-math>$(k,k)$ </tex-math></inline-formula>\u0000 fork-join scheduling scheme on a system of n parallel servers comprising both slow and fast servers. Tasks arriving in the system are divided into k sub-tasks and assigned to a random set of k servers, where each task can be assigned independently to a distinct slow or fast server with selection probability \u0000<inline-formula> <tex-math>$p_{s}$ </tex-math></inline-formula>\u0000 or \u0000<inline-formula> <tex-math>$1-p_{s}$ </tex-math></inline-formula>\u0000, respectively. Our analysis demonstrates that the joint distribution of the stationary workload across any set of k queues becomes asymptotically independent as the number of servers n grows, with k scaling as \u0000<inline-formula> <tex-math>$oleft ({{n^{frac {1}{4}}}}right)$ </tex-math></inline-formula>\u0000. Under asymptotic independence, the limiting mean task completion time can be expressed as an integral. However, it is analytically challenging to compute the optimal selection probability \u0000<inline-formula> <tex-math>$p_{s}^{ast } $ </tex-math></inline-formula>\u0000 that minimizes this integral. To address this, we provide an upper bound on the limiting mean task completion time and identify the selection probability \u0000<inline-formula> <tex-math>$hat {p}_{s}$ </tex-math></inline-formula>\u0000 that minimizes this bound. We validate that this selection probability \u0000<inline-formula> <tex-math>$hat {p}_{s}$ </tex-math></inline-formula>\u0000 yields a near-optimal performance through numerical experiments.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4798-4809"},"PeriodicalIF":3.0,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862857","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