检索结果-内蒙古大学图书馆

VmPTP: Precise Time Protocol for Inter-VM Communication in embedded Virtualized Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 897-910页

作者： Zhao, Sirong Xie, Guoqi Ma, Wenhong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

System virtualization techniques are gradually applied to embedded systems with the performance improvement of embedded devices;however, there is a large time offset (i.e., deviation) of hundreds of ms between virtual machines (VMs) due to the drift of the virtualization abstraction layer and the jitter phenomenon. It is urgent to significantly reduce this offset by time synchronization techniques. Unfortunately, the current mainstream time synchronization software (e.g., Chrony and LinuxPTP) cannot be used in the embedded virtualized system connected by the fieldbus, such as controller area network (CAN);meanwhile, drift correction-based time synchronization techniques dedicated to CAN bus cannot be utilized for virtualized systems. In this study, we design a general vmPTP, which is a precise time protocol (PTP) for inter-VM communication in embedded virtualized systems based on Linux kernel-based VM (KVM). This is the first time synchronization work focused on embedded virtualized systems. We implement two vmPTP versions based on VirtIO and inter-VM shared memory (IVSHMEM) according to the four message (i.e., packet) exchanges of PTP. We propose an asymmetry compensation strategy to solve the problem of asymmetric rate of I/O operations in the message exchange process, which optimizes the offset computation. We further produce a convergence stopping approach which can continuously converge the offset until the offset is within the given bound and stop. We conduct experimental evaluations on both X86-64 and ARM64 architectures. For two versions of vmPTP, the experimental results show that: 1) the offsets are always within 1μ s on two architectures;2) the offsets are less than that of LinuxPTP and Chrony;and 3) the vmPTP's CPU and memory utilization on the X86-64 architecture are merely 0.3% and 0.1%, respectively, whereas those on the ARM64 architecture are 3.8% and 0.1%, respectively. We experiment with vmPTP in real-time application and the result demonstrates th

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

DTS: Dynamic Traffic Scrubbing Against Link Flooding Attacks with Programmable Data Plane

DTS: Dynamic Traffic Scrubbing Against Link Flooding Attacks...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Liu, Fang Meng, Zhaoran Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Link flood attacks (LFA) represent a significant cybersecurity threat due to their ability to cause extensive network disruptions. Traditional traffic scrubbing methods, relying on static rules, often struggle to counter dynamic LFAs effectively. This paper introduces the dynamic traffic scrubbing (DTS) method, leveraging programmable data planes. DTS integrates moving target defense principles into traffic scrubbing, dynamically deploying and adjusting scrubbing rules to thwart attackers. Game theory is employed to analyze the distributed denial of service attack and defense strategies. Experimental results demonstrate that DTS effectively mitigates dynamic LFAs with minimal overhead, showcasing its robustness in defending against sophisticated cyber threats. © 2025 SPIE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

QSM: A Quick Shuffling Method for Defending Against Low-Rate Denial of Service Attacks in Microservice Systems

QSM: A Quick Shuffling Method for Defending Against Low-Rate...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Fan, Qiqi Zhao, Chunchang Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Microservice architecture, renowned for its flexible scalability and loose coupling, has seen widespread adoption. However, this architecture has also become a prime target for network attackers, with low-rate denial of service (LDoS) attacks posing significant threats to microservice systems. Due to their covert nature, traditional passive defense methods often fall short in countering LDoS attacks. To address this challenge, this paper introduces a microservice-oriented quick shuffling method (QSM), based on the moving target defense (MTD) principle. The QSM framework leverages the dynamic and flexible properties of microservices to implement a rapid shuffling mechanism, ensuring the protection of innocent clients. Experimental results demonstrate the effectiveness of QSM in robustly defending microservice systems against LDoS attacks. © 2025 SPIE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

ASTGNN: Adaptive Spatio-Temporal Graph Neural network for Motor Imagery Recognition

ASTGNN: Adaptive Spatio-Temporal Graph Neural Network for Mo...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Xue, Haixiao Huang, Yuwen Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Motor imagery electroencephalogram recognition is a key area in brain-computer interfaces, with applications in human-computer interaction, rehabilitation, and virtual reality. Traditional methods often overlook the brain's topological characteristics and the correlations between EEG channels, resulting in suboptimal decoding. To address this, we propose an adaptive spatio-temporal graph neural network (ASTGNN), which constructs a brain graph topology and adaptively learns the topological adjacency matrix, exploring both common and individual electrode connections. The spatial features are extracted using a graph convolutional network, while a gated position-aware self-attention mechanism captures movement information and global dependencies, enhancing temporal feature extraction. Experiments show that ASTGNN significantly improves recognition, achieving an average accuracy of 87.36%. © 2025 SPIE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Location Data Publishing Mechanism in Semi-Trusted Vehicle networks based on Differential Privacy

Location Data Publishing Mechanism in Semi-Trusted Vehicle N...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Zhang, Tianhao Mao, Qian Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Liaoning University Shenyang China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Vehicular ad-hoc networks (VANETs) are essential in mobile ad-hoc network applications, utilizing vehicle location data. However, safeguarding the privacy and security of this data is challenging, especially with untrusted roadside units. To address this, we propose a novel differential privacy-based location data publishing mechanism. It consists of three key components: dynamic group leader selection, data aggregation, and privacy-preserving data publishing. The group leader selection algorithm is based on directional thresholds, hop cycles, and lifespans, assuming semi-trusted vehicles. Additionally, the differential privacy-based algorithm uses map grid segmentation, privacy budget recovery, and a filtering mechanism to ensure location privacy. Comparative experiments show that our scheme outperforms existing models in total hops, group leader lifetime, and mean absolute error. © 2025 SPIE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling 23

Holistic WCRT Analysis for Global Fixed-Priority Preemptive ...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Guoqi Xie Chenglai Xiong Wei Wu Renfa Li Wanli Chang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University China.

ISBN: (纸本)9798350323481

Many embedded applications demand both resource efficiency and timing guarantee. However, resource sharing naturally complicates the analysis that extracts the worst-case scenario out of contention. Global Fixed-Priority (GFP) preemptive multiprocessor scheduling is one of the mainstream strategies to resolve contention on computational resources. It allows jobs of the same task to be executed on different processors, hence potentially enabling better parallelism and more efficient resource utilization. Unfortunately, its worst-case response time (WCRT) analysis is challenging. Existing approaches divide a high-priority task into three workloads, namely, carry-in workload, body workload, and carry-out workload, trying to optimize them individually. In this work, we propose a holistic WCRT analysis for GFP preemptive multiprocessor scheduling, where a task is no longer divided. Specifically, (i) we establish the tight interference scenario for the task being analyzed to find the most interfering high-priority jobs in any time interval; (ii) we obtain the starting released instant of each high-priority task's first job to determine the maximum interference from high-priority tasks' first jobs to the task being analyzed; (iii) we build the worst-case tight interference scenario for the task being analyzed by combining the tight interference scenario and the starting released instants; (iv) we prove that the WCRT of the task being analyzed can be decided by the worst-case tight interference scenario. Evaluation on schedulability shows that our proposed analysis achieves 4.2%-8.6% higher acceptance ratio in randomly generated data sets than the state-of-the-art workload division approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LIDS: A Lightweight Intrusion Detection System for Controller Area network

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Yu, Zhangwei Liu, Yan Li, Renfa Chang, Wanli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Changsha410082 China Research Institute of Hunan University in Chongqing Research and Innovation Center for Convergence of Automobile and Cyberspace Chongqing401120 China

Controller Area network (CAN) is widely adopted in automobiles and susceptible to cyber attacks with the development of intelligent connected vehicles. While neural networks have demonstrated high accuracy in detection of such attacks, they consume a large amount of resources, hence unsuitable to be directly used for the automotive domain. In this work, we propose LIDS, a lightweight intrusion detection system for CAN. It first filters out DoS (Denial of Service) and Fuzzy attacks through list screening, following which, a Multi-Layer Perceptron (MLP) model is deployed to predict Impersonation attacks. Leveraging this combination, the detection accuracy is kept and the resources required are significantly reduced. LIDS is able to run on small hardware with 520KB memory and CPU of 240MHz. Its power consumption is one order of magnitude lower than the existing works, thus an excellent candidate for protection of CAN in automobiles. © 1982-2012 IEEE.

关键词： Automobiles

来源：评论

学校读者我要写书评

暂无评论

Zram Instance Pool Framework for Adaptive Memory Compression in Resource-Sensitive embedded Operating Systems

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Deng, Yin Xie, Guoqi Xiong, Chenglai Zhao, Sirong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

Memory compression can reduce the size of the inactive data in the random access memory (RAM), thereby freeing up unused space and allowing more programs to run;however, current mainstream memory compression frameworks (e.g., Zram and Zswap) and algorithms (e.g., Zstd and Lz4) do not effectively solve the problem of increased CPU utilization, causing they cannot be directly applied to the resource-sensitive embedded operating system that is sensitive to both CPU utilization and memory usage. In this study, we develop a Zram instance pool framework called ZramPool for adaptive memory compression. The framework consists of the swap space with multiple Zram instances and the adaptive Zram compression module. Through introducing linear regression analysis, the number of Zram instances can be adaptively adjusted based on the size of the compressed data, allowing Zram instances to work in parallel to match the workload. In ZramPool, we achieve two different requirements of reducing CPU utilization while keeping compression speed and increasing compression speed while keeping CPU utilization. ZramPool is deployed in the embedded Linux OS with a 8GB memory size running on the ARMv8 architecture. For the first requirement, ZramPool can reduce CPU utilization by an average of 11.42% while the compression speed only decreases by an average of 2.4%. For the second requirement, ZramPool can increase compression speed by an average of 11.71% while the CPU utilization only increases by an average of 1.9%. © 1982-2012 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance in Time-Sensitive networking with Mixed-Critical Traffic 23

Fault Tolerance in Time-Sensitive Networking with Mixed-Crit...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Wenhong Ma Xiangzhen Xiao Guoqi Xie Nan Guan Yu Jiang Wanli Chang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University City University of Hong Kong Tsinghua University China

ISBN: (纸本)9798350323481

As an Ethernet-based communication protocol with timing determinism, TSN (time-sensitive networking) has become a well-recognized promising in-vehicle network solution for increasingly automated automobiles. To satisfy the reliability requirement of safety-critical applications, existing works towards fault-tolerant TSN trade too much bandwidth for redundancy, limiting their scope of applicability. Targeting mixed-critical traffic, which is widely found in practice, we define a shared fault-tolerant segment that is compatible with the TSN standard. It serves the critical flows when faults occur, to improve their reliability and serves the non-critical flows when otherwise, to improve their quality of service (QoS). On top of this, we propose a space-time redundancy scheduling algorithm, aiming to make the most efficient use of bandwidth, i.e., to fulfill both the reliability as well as hard real-time requirements, and maximize the QoS with the least bandwidth. In essence, we formulate a bi-objective design space exploration problem with hundreds of thousands of decision variables and solve it with customized heuristics. Experimental results show that compared to the state-of-the-art methods, our reported work increases the number of critical flows that can be accommodated on a resource-constrained network by 3 to 4 times, and achieve the highest QoS with an average reduction of 60.3% in bandwidth. As the first work along sharing of bandwidth between mixed-critical traffic in fault-tolerant TSN, this idea can be further pursued towards higher efficiency and may be applied in general autonomous systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Schedulability analysis for messages of FlexRay/CAN networks interconnected by a gateway

引用

Journal of Computational Information Systems 2015年第15期11卷 5531-5543页

作者： Li, Rui Du, Changjie Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha China

Schedulability analysis and scheduling strategies are very important for the in-vehicle network system consisting of CAN bus and FlexRay bus interconnected via a gateway. The aim of this study is to investigate the time behavior of such network and generate scheduling solutions to guarantee real-time constrains. First, a schedulability analysis approach based on end-to-end response time analysis is presented. In order to calculate the worse response time of the messages effectively, a new simple MAX-MIN algorithm are proposed to guarantee real-time constrains and make the arrival of messages more predictable. Experimental results show that MAX-MIN algorithm can effectively calculate end-to-end response time in the large-scale set of messages. Copyright © 2015 Binary Information Press.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：