IEEE Transactions on Network and Service Management最新文献

筛选
英文 中文
Guest Editors’ Introduction: Special section on Research Advances Toward Effective and Sustainable Next Generation Networks 特邀编辑导言:关于有效和可持续的下一代网络研究进展的特别部分
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-10-07 DOI: 10.1109/TNSM.2025.3612131
Alessio Sacco;Kohei Shiomoto;Mohamed Faten Zhani;Guido Marchetto;Shahid Mumtaz;Michael Welzl;Ramón J. Durán Barroso
{"title":"Guest Editors’ Introduction: Special section on Research Advances Toward Effective and Sustainable Next Generation Networks","authors":"Alessio Sacco;Kohei Shiomoto;Mohamed Faten Zhani;Guido Marchetto;Shahid Mumtaz;Michael Welzl;Ramón J. Durán Barroso","doi":"10.1109/TNSM.2025.3612131","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3612131","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3764-3768"},"PeriodicalIF":5.4,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11194282","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315478","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
Understanding Linux Kernel-Based Packet Switching on WiFi Access Points 了解基于Linux内核的WiFi接入点分组交换
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-08-29 DOI: 10.1109/TNSM.2025.3603597
Shiqi Zhang;Mridul Gupta;Behnam Dezfouli
{"title":"Understanding Linux Kernel-Based Packet Switching on WiFi Access Points","authors":"Shiqi Zhang;Mridul Gupta;Behnam Dezfouli","doi":"10.1109/TNSM.2025.3603597","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3603597","url":null,"abstract":"As the number of WiFi devices and their traffic demands continue to rise, the need for a scalable and high-performance wireless infrastructure becomes increasingly essential. Central to this infrastructure are WiFi Access Points (APs), which facilitate packet switching between Ethernet and WiFi interfaces. Despite APs’ reliance on the Linux kernel’s data plane for packet switching, the detailed operations and complexities of switching packets between Ethernet and WiFi interfaces have not been investigated in existing works. This paper makes the following contributions towards filling this research gap. Through macro and micro-analysis of empirical experiments, our study reveals insights in two distinct categories. Firstly, while the kernel’s statistics offer valuable insights into system operations, we identify and discuss potential pitfalls that can severely affect system analysis. For instance, we reveal how packet switching rate and the implementation of drivers influence the meaning and accuracy of statistics related to packet-switching tasks and processor utilization. Secondly, we analyze the impact of the packet switching path and core configuration on performance and power consumption. Specifically, we identify the differences in Ethernet-to-WiFi and WiFi-to-Ethernet data paths regarding processing components, multi-core utilization, and energy efficiency.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3792-3808"},"PeriodicalIF":5.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315532","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
Deep Reinforcement Learning-Based Contract Incentive and Computation Offloading for Mobile Edge Computing-Enabled Blockchain 基于深度强化学习的移动边缘计算契约激励与计算卸载[j]
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-28 DOI: 10.1109/TNSM.2025.3592979
Wenjie Zhang;Yi Liu;Hong Zhao;Chai Kiat Yeo
{"title":"Deep Reinforcement Learning-Based Contract Incentive and Computation Offloading for Mobile Edge Computing-Enabled Blockchain","authors":"Wenjie Zhang;Yi Liu;Hong Zhao;Chai Kiat Yeo","doi":"10.1109/TNSM.2025.3592979","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3592979","url":null,"abstract":"The resolution of proof-of-work problem in blockchain requires significant amount of resources, while the lack of computing power on mobile devices limits the development of blockchain in mobile applications. To mitigate this issue, the combination of blockchain and mobile edge computing (MEC) has attracted much attention. In this paper, we consider an edge-enabled blockchain system that includes one single edge service provider (ESP), multiple types of miners and edge nodes. Each miner submits offloading request to ESP. In response, ESP designs contract to incentivize various types of edge nodes to contribute resources and offer computational services to the miners. This problem is a joint optimization problem of offloading decisions and contract design. Due to the time-variability of network environment, the randomness of miners’ task demands, and the asymmetric information between the ESP and edge nodes, solving this problem is challenging. We propose a deep reinforcement learning contract mechanism (DRLCM) for incentive-based computation offloading strategies, which divides the original problem into two sub-problems: computation offloading and contract design. Initially, the deep Q-network (DQN) algorithm is used to update the offloading decisions based on the evolving task demands and network conditions. Secondly, contract is designed to motivate edge nodes to participate in resource sharing. The problem is simplified by analyzing the necessary and sufficient conditions of feasible contract, and the Lagrange multiplier method is used to approximate the optimal contract. Simulation experiments demonstrate the effectiveness of the DRLCM algorithm, which shows better convergence and performance compared to traditional DQN, Double-DQN algorithms and Dueling-DQN.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"5137-5151"},"PeriodicalIF":5.4,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145230094","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
On the Risk-Aware Connection Defragmentation in OCS-Based Data-Center Networks 基于ocs的数据中心网络中风险感知的连接碎片整理
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-25 DOI: 10.1109/TNSM.2025.3592355
Xiaoyan Dong;Xiaoliang Chen;Zuqing Zhu
{"title":"On the Risk-Aware Connection Defragmentation in OCS-Based Data-Center Networks","authors":"Xiaoyan Dong;Xiaoliang Chen;Zuqing Zhu","doi":"10.1109/TNSM.2025.3592355","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3592355","url":null,"abstract":"The dynamic traffic changes in an optical circuit switching based data-center network (ODCN) can make the utilization of its optical connections fragmented, degrading the efficiency of service provisioning in the ODCN. Consequently, connection defragmentation becomes imperative. However, consolidating traffic onto fewer connections may unilaterally add the risk of bandwidth contention and undermine ODCNs’ robustness against unexpected traffic bursts. To address this issue, we propose risk-aware connection defragmentation (RA-cDF), which explores the topology flexibility of ODCN to consolidate traffic such that the active optical connections through optical circuit switching (OCS) switches can be minimized together with the risk of future bandwidth contention on remaining connections. We formulate a mixed integer linear programming (MILP) model to address the RA-cDF problem exactly, followed by a heuristic to solve it time-efficiently. Extensive simulations confirm the effectiveness of our proposals.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3909-3920"},"PeriodicalIF":5.4,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315446","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
DINT-Based DWRR: Decentralized INT-Based Packet Scheduling Method for Multipath Communication 基于int的DWRR:多路径通信中基于int的分散分组调度方法
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-25 DOI: 10.1109/TNSM.2025.3592748
Yuhang Liu;Fanqin Zhou;Lei Feng;Wenjing Li;Jing Gao
{"title":"DINT-Based DWRR: Decentralized INT-Based Packet Scheduling Method for Multipath Communication","authors":"Yuhang Liu;Fanqin Zhou;Lei Feng;Wenjing Li;Jing Gao","doi":"10.1109/TNSM.2025.3592748","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3592748","url":null,"abstract":"Multipath communication is a technique that utilizes multipath transmission to improve network transmission efficiency. Multipath transport protocols like MPTCP usually require complex signaling control and lack adaptability to instantaneous network changes. The advent of programmable switches and INT has addressed these issues to some extent. In this paper, we propose DINT-Based DWRR (Decentralised INT-Based Dynamic Weight Round Robin), a dynamic weight round-robin packet scheduler based on non-centralized telemetry technology. It aims to collect telemetry information and update path weights with millisecond granularity, and efficiently achieve load balancing while reducing telemetry overhead. The core idea of DINT-Based DWRR is to leverage data-plane programmability to achieve the convergence of the forwarding node and the computing node. The forwarding nodes forward the packets using the DWRR (Dynamic Weight Round Robin) method and periodically generate telemetry messages. The computing nodes are dispersed across the forwarding nodes and efficiently update weights to the forwarding nodes. After testing in various experimental scenarios, it is proven that DINT-Based DWRR can provide better scheduling policies, reduce the link packet loss rate, and increase link bandwidth utilization.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"4871-4883"},"PeriodicalIF":5.4,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145255899","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
Next-Generation Wireless Backhaul Design for Rural Areas 农村地区下一代无线回程设计
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-24 DOI: 10.1109/TNSM.2025.3592442
Gabriele Gemmi;Llorenç Cerdà-Alabern;Leonardo Maccari
{"title":"Next-Generation Wireless Backhaul Design for Rural Areas","authors":"Gabriele Gemmi;Llorenç Cerdà-Alabern;Leonardo Maccari","doi":"10.1109/TNSM.2025.3592442","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3592442","url":null,"abstract":"Rural areas often face significant challenges in accessing reliable broadband Internet due to high infrastructure costs and low population density. To address this issue, we propose a model for evaluating the performance and the cost of a mesh-based, last- and middle-mile replacement for broadband connection in these underserved regions. We use open data from ten underserved municipalities to assess the demand, plan the mesh network, and estimate the allocated capacity per user. We consider two designs: a low-cost network using the classical 5 GHz unlicensed band, and a high-performance one using mmWave frequency. For both designs, we estimate the Operating Expenditure and the amortized Capital Expenditure using realistic device prices and operating cost estimations. We compare the price of the mesh-based solution with alternatives based on xDSL and satellite connectivity and show that it has competitive prices compared to existing offers, covering a larger portion of households than DSL. We open-source both the code and the elaborated data to reproduce, extend, and improve our results in different settings.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3921-3932"},"PeriodicalIF":5.4,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315493","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
Semi-Supervised Learning for Anomaly Traffic Detection via Bidirectional Normalizing Flows 基于双向归一化流的半监督学习异常流量检测
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-22 DOI: 10.1109/TNSM.2025.3591533
Zhangxuan Dang;Yu Zheng;Xinglin Lian;Chunlei Peng;Qiuyu Chen;Xinbo Gao
{"title":"Semi-Supervised Learning for Anomaly Traffic Detection via Bidirectional Normalizing Flows","authors":"Zhangxuan Dang;Yu Zheng;Xinglin Lian;Chunlei Peng;Qiuyu Chen;Xinbo Gao","doi":"10.1109/TNSM.2025.3591533","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3591533","url":null,"abstract":"With the rapid development of the Internet, various types of anomaly traffic are threatening network security. However, the difficulty of collecting and labelling anomalous traffic is a significant challenge, so this paper proposes a semi-supervised anomaly detection framework. Considering normal and abnormal traffic have different data distributions, our framework can generate pseudo anomaly samples without prior knowledge of anomalies to achieve the detection of anomaly data. The framework comprises three principal components. Firstly, a pre-trained feature extractor is employed to extract a feature representation of the network traffic. Secondly, a bidirectional normalizing flow module establishes a reversible transformation between the latent data distribution and a Gaussian space. Through this bidirectional mapping, samples first undergo transformation manipulation within the Gaussian distribution space, and are then transported through the generative direction of normalizing flows, translating mathematical transformations into semantic feature evolutions in the latent data space. Finally, a simple classifier explicitly learns the potential differences between anomaly and normal samples to facilitate better anomaly detection. During inference, our framework requires only two modules to detect anomalous samples, leading to a considerable reduction in model size. According to the experiments, our method achieves the state-of-the-art results on the common benchmarking datasets of anomaly network traffic detection. Furthermore, it exhibits good generalisation performance across datasets.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"5106-5117"},"PeriodicalIF":5.4,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145230086","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
FL-ORA: Optimized and Decentralized Resource Allocation Scheme for D2D Communication FL-ORA: D2D通信的优化分散资源分配方案
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-22 DOI: 10.1109/TNSM.2025.3591644
Nilesh Kumar Jadav;Sudeep Tanwar
{"title":"FL-ORA: Optimized and Decentralized Resource Allocation Scheme for D2D Communication","authors":"Nilesh Kumar Jadav;Sudeep Tanwar","doi":"10.1109/TNSM.2025.3591644","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3591644","url":null,"abstract":"This article presents an optimized and decentralized resource allocation approach aimed at maximizing the system throughput and energy efficiency of device-to-device (D2D) communication. The proposed scheme modifies the meta-heuristic whale optimization algorithm (WOA) by blending the differential evolution (DE) technique in the WOA’s exploration phase to offer intelligence and reduce the computational overburden. The hybrid WOA (DE+WOA) serves as a physical layer access control that efficiently finds the optimal cellular users (CUs) and D2D users (DUs) based on their channel conditions. The proposed access control acts as a restrictive filter, where only optimal CU-DUs can participate in resource allocation tasks. Furthermore, a dataset has been prepared using the optimal CUs-DUs channel conditions from the hybrid WOA to serve as input for the federated learning (FL)-based resource allocation. We utilized statistical tests (e.g., Spearman’s test) to analyze the generated dataset’s non-independent and identically distributed (non-IID) characteristics, thus providing generalization in the AI training. Allowing only the optimal CUs and DUs (from hybrid WOA) in the FL-based resource allocation substantially reduces the computational cost of AI training and improves energy efficiency. In the FL-based resource allocation, we used a sequential convolutional neural network (CNN) trained on the aforementioned dataset to provide proactive resource allocation decisions. Furthermore, we used momentum-based weight aggregation in the FL to reduce the computational burden on the central server. The proposed scheme is assessed by utilizing different standard metrics, such as training accuracy (98.93%), training time, overall system throughput (35.62 Mbps), energy efficiency (96.42 bits/joule), and resource fairness.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"5031-5047"},"PeriodicalIF":5.4,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145230071","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
Hierarchical Adaptive Learning-Based Congestion Control With Low Training Overhead for Datacenter Networks 基于分层自适应学习的低训练开销数据中心网络拥塞控制
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-16 DOI: 10.1109/TNSM.2025.3589637
Jinbin Hu;Zikai Zhou;Jing Wang
{"title":"Hierarchical Adaptive Learning-Based Congestion Control With Low Training Overhead for Datacenter Networks","authors":"Jinbin Hu;Zikai Zhou;Jing Wang","doi":"10.1109/TNSM.2025.3589637","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3589637","url":null,"abstract":"Most congestion control mechanisms perform well in specific datacenter networks, but none can consistently deliver good performance across varying scenarios. Recently proposed frameworks based on reinforcement learning can flexibly select congestion control algorithms to adapt to dynamic network. However, frequently altering the congestion control mechanisms during relatively stable periods of the network actually leads to instability and unnecessary computational overhead. In this paper, we propose a lightweight and hierarchical adaptive congestion control algorithm (LACC) to be resilient to the varying network. LACC dynamically selects the appropriate congestion control mechanism only when the current congestion control algorithm is not suitable for the current network state, rather than changing the congestion control scheme every training cycle to ensure network stability. The simulation results show that LACC significantly reduces the average overhead by 31% and improves throughput by up to 47%, 35%, 23% and 15% compared to Cubic, Reno, BBR and Antelope, respectively.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"4061-4069"},"PeriodicalIF":5.4,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315432","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
Routing Optimization Under an SDN Architecture for 802.11 MANETs 基于SDN架构的802.11 manet路由优化
IF 5.4 2区 计算机科学
IEEE Transactions on Network and Service Management Pub Date : 2025-07-16 DOI: 10.1109/TNSM.2025.3589665
Ippokratis Koukoulis;Ilias Syrigos;Apostolis Prassas;Kostas Choumas;Thanasis Korakis
{"title":"Routing Optimization Under an SDN Architecture for 802.11 MANETs","authors":"Ippokratis Koukoulis;Ilias Syrigos;Apostolis Prassas;Kostas Choumas;Thanasis Korakis","doi":"10.1109/TNSM.2025.3589665","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3589665","url":null,"abstract":"The adoption of the Software Defined Networking (SDN) paradigm is experiencing rapid growth, extending beyond typical datacenter networks to encompass 5G and IoT deployments. This expansion is primarily driven by the inherent flexibility offered by SDN in terms of network management and control. Mobile Ad-Hoc Networks (MANETs) have not yet fully embraced the advantages of the SDN approach due to their specific requirements arising from the dynamic nature of mobility and the unpredictable conditions of the wireless medium. The progress of adoption has been impeded by technical obstacles and the inherent conflict between the centralized nature of SDN and the decentralized approach of conventional MANET protocols. This paper introduces our implementation of a comprehensive SDN scheme that aims to address the divide between different networking approaches by integrating the advantages of both worlds. Our prototype has the capability to integrate with 802.11 Ad-Hoc networks. It provides several important features: a) fault tolerance for the SDN controller, which involves recovering from failures by electing a new controller, b) dynamic network topology discovery, and c) the ability to deploy globally optimal routing policies, based on the Multicommodity Flow Problem (MCFP), and following a cross-layer approach that utilizes the 802.11 MAC layer statistics. The applicability and performance benefits of our framework were assessed through the evaluation of our proposed scheme in contrast to a traditional MANET routing protocol.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3995-4008"},"PeriodicalIF":5.4,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315445","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信