Computer Networks最新文献_第4页

Gradient correlation based detection of adversarial attacks on vehicular networks 基于梯度相关性的车载网络对抗性攻击检测

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-29 DOI: 10.1016/j.comnet.2024.110868

Yingxu Lai , Jingwen Wei , Ye Chen

引用次数: 0

Slice admission control in 5G wireless communication with multi-dimensional state space and distributed action space: A sequential twin actor-critic approach 具有多维状态空间和分布式行动空间的 5G 无线通信中的分片准入控制：顺序孪生行为批评方法

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-29 DOI: 10.1016/j.comnet.2024.110878

Mourice Otieno Ojijo , Daniel Ramotsoela , Ruth A. Oginga

{"title":"Slice admission control in 5G wireless communication with multi-dimensional state space and distributed action space: A sequential twin actor-critic approach","authors":"Mourice Otieno Ojijo , Daniel Ramotsoela , Ruth A. Oginga","doi":"10.1016/j.comnet.2024.110878","DOIUrl":"10.1016/j.comnet.2024.110878","url":null,"abstract":"<div><div>Network slicing represents a paradigm shift in the way resources are allocated for different 5G network functions through network function virtualization. This innovation aims to facilitate logical resource allocation, accommodating the anticipated surge in network resource requirements. This will harness automatic processing, scheduling, and orchestration for efficient management. To overcome the challenge of managing network resources under heavy demand, slice providers need to leverage both artificial intelligence and slice admission control strategies. While 5G network resources can be allocated to maintain a slice, the logical allocation and real-time network evaluation must be continuously examined and adjusted if network resilience is to be maintained. The complex task of leveraging slice admission control to maintain 5G network resilience has not been fully investigated. To tackle this problem, we propose a machine learning approach for slice admission control and resource allocation optimization so as to maintain network resilience. Machine learning algorithms offer a powerful tool for making robust and autonomous decisions, which are crucial for effective slice admission control. By intelligently allocating resources based on real-time demand and network conditions, these algorithms can help ensure long-term network resilience and achieve key objectives. While various machine learning algorithms hold promise for 5G resource management and admission control, reinforcement learning (RL) has emerged as a particularly exciting solution. Its ability to mimic human learning processes makes it a versatile solution, well-suited to tackle the complex challenges of network control. To fill this gap, we propose a new technique known as sequential twin actor critic (STAC). Simulations show that the STAC improves network resilience through enhanced admission probability and overall utility.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110878"},"PeriodicalIF":4.4,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587237","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

Quantitative analysis of segmented satellite network architectures: A maritime surveillance case study 分段卫星网络架构的定量分析：海上监视案例研究

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-28 DOI: 10.1016/j.comnet.2024.110874

Juan A. Fraire , Santiago Henn , Gregory Stock , Robin Ohs , Holger Hermanns , Felix Walter , Lynn Van Broock , Gabriel Ruffini , Federico Machado , Pablo Serratti , Jose Relloso

{"title":"Quantitative analysis of segmented satellite network architectures: A maritime surveillance case study","authors":"Juan A. Fraire , Santiago Henn , Gregory Stock , Robin Ohs , Holger Hermanns , Felix Walter , Lynn Van Broock , Gabriel Ruffini , Federico Machado , Pablo Serratti , Jose Relloso","doi":"10.1016/j.comnet.2024.110874","DOIUrl":"10.1016/j.comnet.2024.110874","url":null,"abstract":"<div><div>This paper presents an in-depth trade-off analysis of a Swarm Satellite Constellation (SSC) Mission for Earth observation that leverages Segmented Architecture (SA), a concept designed by the Argentinian Space Agency (CONAE) within the New Space philosophy. This architecture consists of a scenario featuring a networked constellation of small, cooperative satellites to enhance mission flexibility, reliability, coverage, and cost-effectiveness. Despite its promising prospects, SA features challenges in its mission design and definition phases due to the complex interplay between distributed space systems, technological innovation, and geographical landscapes. Our study analyzes an innovative quantitative analysis framework integrated with Ansys’ Systems Toolkit (STK). The resulting software tool models critical components, including ground and space segments, orbital dynamics, coverage, onboard processing, and communication links. We focus on a hypothetical SARE mission to detect illicit maritime activity near Argentina’s Exclusive Economic Zone (EEZ). This case study constitutes an archetypal mission elucidating the architecture’s benefits and complexities, addressing swarm coverage, contact dynamics, and data handling strategies. Results contribute to discussions on the practical trade-off in current and future Segmented Satellite Architectures with multiple mission objectives.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110874"},"PeriodicalIF":4.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142552345","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

Machine learning-driven integration of terrestrial and non-terrestrial networks for enhanced 6G connectivity 以机器学习为驱动整合地面和非地面网络，增强 6G 连接性

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-28 DOI: 10.1016/j.comnet.2024.110875

Mehmet Ali Aygul , Halise Turkmen , Hakan Ali Cirpan , Huseyin Arslan

{"title":"Machine learning-driven integration of terrestrial and non-terrestrial networks for enhanced 6G connectivity","authors":"Mehmet Ali Aygul , Halise Turkmen , Hakan Ali Cirpan , Huseyin Arslan","doi":"10.1016/j.comnet.2024.110875","DOIUrl":"10.1016/j.comnet.2024.110875","url":null,"abstract":"<div><div>Non-terrestrial networks (NTN)s are essential for achieving the persistent connectivity goal of sixth-generation networks, especially in areas lacking terrestrial infrastructure. However, integrating NTNs with terrestrial networks presents several challenges. The dynamic and complex nature of NTN communication scenarios makes traditional model-based approaches for resource allocation and parameter optimization computationally intensive and often impractical. Machine learning (ML)-based solutions are critical here because they can efficiently identify patterns in dynamic, multi-dimensional data, offering enhanced performance with reduced complexity. ML algorithms are categorized based on learning style—supervised, unsupervised, and reinforcement learning—and architecture, including centralized, decentralized, and distributed ML. Each approach has advantages and limitations in different contexts, making it crucial to select the most suitable ML strategy for each specific scenario in the integration of terrestrial and non-terrestrial networks (TNTN)s. This paper reviews the integration architectures of TNTNs as outlined in the 3rd Generation Partnership Project, examines ML-based existing work, and discusses suitable ML learning styles and architectures for various TNTN scenarios. Subsequently, it delves into the capabilities and challenges of different ML approaches through a case study in a specific scenario.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110875"},"PeriodicalIF":4.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142560806","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

Evaluating integration methods of a quantum random number generator in OpenSSL for TLS 评估用于 TLS 的 OpenSSL 中量子随机数发生器的集成方法

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-25 DOI: 10.1016/j.comnet.2024.110877

Javier Blanco-Romero, Vicente Lorenzo, Florina Almenares, Daniel Díaz-Sánchez, Carlos García Rubio, Celeste Campo, Andrés Marín

{"title":"Evaluating integration methods of a quantum random number generator in OpenSSL for TLS","authors":"Javier Blanco-Romero, Vicente Lorenzo, Florina Almenares, Daniel Díaz-Sánchez, Carlos García Rubio, Celeste Campo, Andrés Marín","doi":"10.1016/j.comnet.2024.110877","DOIUrl":"10.1016/j.comnet.2024.110877","url":null,"abstract":"<div><div>The rapid advancement of quantum computing poses a significant threat to conventional cryptography. Whilst post-quantum cryptography (PQC) stands as the prevailing trend for fortifying the security of cryptographic systems, the coexistence of quantum and classical computing paradigms presents an opportunity to leverage the strengths of both technologies, for instance, nowadays the use of Quantum Random Number Generators (QRNGs) – considered as True Random Number Generators (TRNGs) – opens up the possibility of discussing hybrid systems. In this paper, we evaluate both aspects, on the one hand, we use hybrid TLS (Transport Layer Security) protocol that leverages the widely used secure protocol on the Internet and integrates PQC algorithms, and, on the other hand, we evaluate two approaches to integrate a QRNG, i.e., Quantis PCIe-240M, in OpenSSL 3.0 to be used by TLS. Both approaches are compared through a Nginx Web server, that uses OpenSSL’s implementation of TLS 1.3 for secure web communication. Our findings highlight the importance of optimizing such integration method, because while direct integration can lead to performance penalties specific to the method and hardware used, alternative methods demonstrate the potential for efficient QRNG deployment in cryptographic systems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110877"},"PeriodicalIF":4.4,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571412","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

Traffic evolution in Software Defined Networks 软件定义网络的流量演进

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-24 DOI: 10.1016/j.comnet.2024.110852

Usman Ashraf , Adnan Ahmed , Stefano Avallone , Pasquale Imputato

{"title":"Traffic evolution in Software Defined Networks","authors":"Usman Ashraf , Adnan Ahmed , Stefano Avallone , Pasquale Imputato","doi":"10.1016/j.comnet.2024.110852","DOIUrl":"10.1016/j.comnet.2024.110852","url":null,"abstract":"<div><div>Software Defined Networking (SDN) offers unprecedented traffic engineering possibilities due to optimal centralized decision making. However, network traffic evolves over time and changes the underlying optimization problem. Frequent application of the model to reflect traffic evolution causes flooding of control messages, traffic re-routing and synchronization problems. This paper addresses the problem of graceful traffic evolution in SDNs (Software Defined Networks) minimizing rule installations and modifications, optimizing the global objectives of minimization of Maximum Link Utilization (MLU) and minimization of the Maximum Switch Table Space Utilization (MSTU). The problem is formulated as multi-objective optimization using Mixed Integer Linear Programming (MILP). Proof of NP-Hardness is provided. Then, we re-formulate the problem as a single-objective problem and propose two greedy algorithms to solve the single-objective problem, namely MIRA-Im and MIRA-Im with Conflict Detection, and experiments are performed to show the effectiveness of the algorithms in comparison to previous state of the art proposals. Simulation results show significant improvements of MIRA-Im with Conflict Detection, especially in terms of number of installed rules (with a gain till 80% with the highest number of flows) and flow table space utilization (with a gain till 55% with the highest number of flows), compared to MIRA-Im and other algorithms available in the literature, while the other metrics are essentially stable.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110852"},"PeriodicalIF":4.4,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533939","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

Dynamic resource allocation and offloading optimization for network slicing in B5G multi-tier multi-tenant systems B5G 多层多租户系统中网络切片的动态资源分配和卸载优化

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-24 DOI: 10.1016/j.comnet.2024.110876

Ren-Hung Hwang , Jia-You Lin , Yen Chuang , Ben-Jye Chang

{"title":"Dynamic resource allocation and offloading optimization for network slicing in B5G multi-tier multi-tenant systems","authors":"Ren-Hung Hwang , Jia-You Lin , Yen Chuang , Ben-Jye Chang","doi":"10.1016/j.comnet.2024.110876","DOIUrl":"10.1016/j.comnet.2024.110876","url":null,"abstract":"<div><div>For differentiating and customizing different types of flows guaranteeing individual 5QI QoS requirements, 5 G and Beyond 5 G (B5G) first specify several key technologies, e.g., 1) virtualizing radio resources, network functions and network servers, 2) network slicing, 3) Service Function Chaining (SFC) and flow steering, etc. Furthermore, for reducing E2E delay and path/link traffic congestion for diverse flowing while accessing cloud computing, Multi-access Edge Computing (MEC) is specified in 5 G/B5G ETSI. Although several extensively related studies discussed network slicing, SFC and MEC, they seldom consider both resource allocation and traffic offloading in a tenant efficiently, simultaneously. Thus, for efficiently addressing above critical issues, three motivations are proposed, including 1) to dynamically allocate resource for B5G with multi-tier multi-tenant networking, 2) to propose adaptively vertical and horizontal offloading to the computing node for diverse types of flows, and 3) to minimize the blocking rate while guaranteeing the delay constraint. Two novel efficient algorithms are proposed: Fast Latency Decrease Resource Allocation (FLDRA) and Minimum Cost Resource Allocation (MCRA). These two proposed algorithms achieve dynamic E2E resource allocation and optimal vertical and horizontal offloading to the computing node while guaranteeing the E2E latency and 5QI QoS requirements for different types of flows. Numerical results demonstrate that FLDRA minimizes resource allocation while MCRA balances the loading of resource availability. The proposed algorithms of FLDRA and MCRA significantly outperform the compared approaches in blocking rates. Moreover, the proposed MCRA algorithm yields the highest resource utilization, the least network delay, etc.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"256 ","pages":"Article 110876"},"PeriodicalIF":4.4,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142707308","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

Concordit: A credit-based incentive mechanism for permissioned redactable blockchain Concordit：基于信用的许可可删节区块链激励机制

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-23 DOI: 10.1016/j.comnet.2024.110848

Liushun Zhao , Deke Guo , Lailong Luo , Yulong Shen , Bangbang Ren , Shi Zhu , Fangliao Yang

{"title":"Concordit: A credit-based incentive mechanism for permissioned redactable blockchain","authors":"Liushun Zhao , Deke Guo , Lailong Luo , Yulong Shen , Bangbang Ren , Shi Zhu , Fangliao Yang","doi":"10.1016/j.comnet.2024.110848","DOIUrl":"10.1016/j.comnet.2024.110848","url":null,"abstract":"<div><div>Malicious attacks and the introduction of illegal data put blockchains at risk, and blockchain governance is gaining increasing attention. The redactable blockchain technology has become a mainstream solution for blockchain governance. However, a low completion rate for redaction tasks limits current redactable blockchain technologies, primarily due to the absence of an effective incentive mechanism for participants. This gap underscores the urgent need for designing and implementing robust incentive mechanisms in redactable blockchains. Incentive mechanisms can motivate and guide entities to participate and perform desired behaviors through awards and punishments. This paper proposes Concordit, the first deployable credit-based incentive mechanism for redactable blockchains. Its purpose is to encourage submitters to submit legal redaction requests, modifiers to perform legal redaction operations, and verifiers to maintain the behavior consistent with the consensus algorithm. In the context of permissioned blockchains, Concordit utilizes a credit value system for awards and punishments. Additionally, we use a game theory-based mechanism to analyze and model participants’ behavior utilities in the redactable blockchain. Meanwhile, we evaluate the credibility of nodes by combining their static initial credit values and dynamic behavior-related credit values. This system prioritizes high-credibility nodes as participants, thereby enhancing the completion rate for redaction tasks. Finally, the implementation and performance evaluation of our Concordit incentive mechanism demonstrate its effectiveness and practicality.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110848"},"PeriodicalIF":4.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571411","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

Joint intelligent optimizing economic dispatch and electric vehicles charging in 5G vehicular networks 5G 车辆网络中的联合智能优化经济调度和电动汽车充电

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-23 DOI: 10.1016/j.comnet.2024.110872

Gang Pan , Xin Guan , Haiyang Jiang , Yongnan Liu , Huayang Wu , Hongyang Chen , Tomoaki Ohtsuki , Zhu Han

{"title":"Joint intelligent optimizing economic dispatch and electric vehicles charging in 5G vehicular networks","authors":"Gang Pan , Xin Guan , Haiyang Jiang , Yongnan Liu , Huayang Wu , Hongyang Chen , Tomoaki Ohtsuki , Zhu Han","doi":"10.1016/j.comnet.2024.110872","DOIUrl":"10.1016/j.comnet.2024.110872","url":null,"abstract":"<div><div>In recent years, with the rapid development of 5G networks, the road traffic network composed of vehicles with different energy sources has become more and more complex, and the problems of environmental pollution and road congestion have also become increasingly serious. Electric vehicles are favored by people due to their environmental protection and energy-saving characteristics. However, improper charging dispatching will cause excess energy in charging stations, affecting the power grid and road traffic, such as energy shortages and lower traffic throughput. Therefore, how to design a reasonable charging strategy that can maximize the user’s charging satisfaction and consume the energy of the charging station as much as possible becomes a challenge. Meanwhile, this strategy should consider power economic dispatch to reduce power generation costs and polluting gas emissions. With the support of 5G’s high-bandwidth and low-latency characteristics, this paper designs an intelligent charging model which indirectly reflects the charging satisfaction through the time cost, energy consumption cost, charging cost, and the user’s range anxiety, while consuming the remaining energy of the charging station as much as possible. Due to the uncertainty of wind and photovoltaic power generation, this paper proposes a two-stage economic dispatch model to improve the accuracy of power dispatch and reduce power generation costs and carbon emissions. Due to the highly variable traffic environment and energy demand, we employ proximal policy optimization-based deep reinforcement learning algorithms to realize electric vehicle charging dispatching and charging station power dispatching. Numerical results show the efficiency of our proposed strategy for electric vehicle charging in terms of the convergence speed.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110872"},"PeriodicalIF":4.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571413","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

Towards fine-grained load balancing with dynamical flowlet timeout in datacenter networks 在数据中心网络中利用动态小流量超时实现细粒度负载均衡

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2024-10-23 DOI: 10.1016/j.comnet.2024.110867

Jinbin Hu , Ruiqian Li , Ying Liu , Jin Wang

{"title":"Towards fine-grained load balancing with dynamical flowlet timeout in datacenter networks","authors":"Jinbin Hu , Ruiqian Li , Ying Liu , Jin Wang","doi":"10.1016/j.comnet.2024.110867","DOIUrl":"10.1016/j.comnet.2024.110867","url":null,"abstract":"<div><div>In modern datacenter networks (DCNs), load balancing mechanisms are widely deployed to enhance link utilization and alleviate congestion. Recently, a large number of load balancing algorithms have been proposed to spread traffic among the multiple parallel paths. The existing solutions make rerouting decisions for all flows once they experience congestion on a path. They are unable to distinguish between the flows that really need to be rerouted and the flows that potentially have negative effects due to rerouting, resulting in frequently ineffective rerouting. Fine-grained rerouting will also cause severe packet reordering, especially in asymmetric topology scenarios. To address the above issues, we present a fine-grained traffic-differentiated load balancing (TDLB) mechanism, which aims to distinguish flows that are necessarily to be rerouted and reroute traffic in fine-grained without packet reodering. Specifically, TDLB distinguishes the traffic that must be rerouted through the host pair information in the packet header, and selects an optimal path for rerouting. To prevent severe packet reodering caused by excessive path delay differences, TDLB dynamically adjusts the flowlet timeout to segment the traffic and select the optimal path for rerouting. The NS-2 simulation results show that TDLB effectively reduces tail latency and average flow completion time (FCT) for short flows by up to 49% and 46%, respectively, compared to the state-of-the-art load balancing schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110867"},"PeriodicalIF":4.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142662357","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