Query：
学者姓名：张栋
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
Entanglement swapping is a crucial step in quantum communication, generating long-distance entanglements between quantum users for quantum network applications, such as distributed quantum computing. This study focuses on the efficiency of entanglement swapping strategies in quantum networks, particularly in multi-user concurrent quantum communication. Since multi-user concurrent quantum communication consists of multiple point-to-point quantum communications, we first analyze the challenges faced by existing entanglement swapping strategies in this scenario and then propose Parallel Segment Entanglement Swapping (PSES) to address them. PSES utilizes a tree-like model to divide the path into segments and execute entanglement swapping in parallel across them, thereby enhancing the generation rate of long-distance entanglement. Furthermore, we analyze the impact of resource contention on entanglement swapping in multi-user concurrent quantum communication and propose Multi-user PSES (M-PSES) to alleviate this negative impact. M-PSES leverages the entanglement swapping trigger signal and resource locking mechanisms to mitigate resource contention. The simulation results show that PSES performs superiorly to existing entanglement swapping strategies in point-to-point quantum communication, and M-PSES can achieve better performance than PSES in multi-user concurrent quantum communication.
Keyword ：
entanglement swapping entanglement swapping quantum communication quantum communication quantum networks quantum networks
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | He, Binjie , Loke, Seng W. , Lu, Luke et al. Efficient Entanglement Swapping in Quantum Networks for Multi-User Scenarios [J]. | ENTROPY , 2025 , 27 (6) . |
| MLA | He, Binjie et al. "Efficient Entanglement Swapping in Quantum Networks for Multi-User Scenarios" . | ENTROPY 27 . 6 (2025) . |
| APA | He, Binjie , Loke, Seng W. , Lu, Luke , Zhang, Dong . Efficient Entanglement Swapping in Quantum Networks for Multi-User Scenarios . | ENTROPY , 2025 , 27 (6) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In programmable networks, some networking systems coordinate data plane switches to perform in-network functions (e.g., in-band network telemetry). However, the vulnerabilities associated with inter-device coordination remain largely unexplored and overlooked, which is highly concerning given the increasing popularity of this paradigm. In this paper, we identify three attack scenarios built upon such vulnerabilities, where attackers mislead the behaviors of networking systems. We implement 20 networking systems on Tofino-based switches and a simulator and test them against the identified attacks. Our experimental results show that our attacks severely disrupt the normal operation of these networking systems, e.g., the cache hit rate of NetCache drops by 38%. However, our analysis reveals that none of existing methods fully mitigate our attacks because they fail to verify the packets for inter-device coordination. To this end, we select characteristics from existing methods while addressing their limitations to design effective mitigation methods. Experimental results indicate that our methods perform well in mitigating our attacks and introduce acceptable overheads.
Keyword ：
attacks attacks Control systems Control systems inter-device coordination inter-device coordination Metadata Metadata network security network security Object recognition Object recognition Prevention and mitigation Prevention and mitigation Process control Process control Production Production Programmable networks Programmable networks Protocols Protocols Servers Servers Switches Switches Training Training
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Hongyan , Chen, Xiang , Wang, Di et al. Toward Secure Inter-Device Coordination in Programmable Networks [J]. | IEEE TRANSACTIONS ON NETWORKING , 2025 . |
| MLA | Liu, Hongyan et al. "Toward Secure Inter-Device Coordination in Programmable Networks" . | IEEE TRANSACTIONS ON NETWORKING (2025) . |
| APA | Liu, Hongyan , Chen, Xiang , Wang, Di , Huang, Qun , Zhang, Dong , Wu, Chunming et al. Toward Secure Inter-Device Coordination in Programmable Networks . | IEEE TRANSACTIONS ON NETWORKING , 2025 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
For decades, network virtualization plays a crucial role in modern networks, e.g., 6G mobile networks: tenants construct arbitrary virtual networks on the same physical network. However, production networks are becoming programmable and need more ways of network configurations. So prior techniques like SDN hypervisors are deprecated since they cannot configure programmable networks. In response, a new category of network virtualization techniques has emerged recently to virtualize programmable networks, i.e., programmable network hypervisors (PNHs). This article first reviews this trend to comprehensively survey PNHs. To understand their benefits, we build a testbed with hardware switches and sophisticated topologies. Our testbed experiments stress-test hypervisors and demonstrate that they outperform prior works with higher acceptance ratios of virtual networks under large-scale scenarios and heavy loads. Finally, we highlight the open issues of these techniques to shed light on the future directions in this promising topic.
Keyword ：
6G mobile communication 6G mobile communication Control systems Control systems Logic Logic Network function virtualization Network function virtualization Runtime Runtime Topology Topology Transforms Transforms Virtualization Virtualization Virtual machine monitors Virtual machine monitors
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Du, Hongyang , Liu, Wenjing et al. Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions [J]. | IEEE NETWORK , 2025 , 39 (3) : 148-155 . |
| MLA | Chen, Xiang et al. "Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions" . | IEEE NETWORK 39 . 3 (2025) : 148-155 . |
| APA | Chen, Xiang , Du, Hongyang , Liu, Wenjing , Liu, Hongyan , Zhang, Jianshan , Yang, Xu et al. Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions . | IEEE NETWORK , 2025 , 39 (3) , 148-155 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
3D concrete printing (3DCP) faces challenges in the automated integration of reinforcement. The use of strain-hardening cementitious composites (SHCCs) with high ductility offers a promising solution to this issue. However, the high cement content in printable SHCC increases the carbon footprint, contributing to heavy environmental burden. This study investigates using diatomite (DE), a natural sedimentary rock, to develop sustainable SHCC for 3DCP. Diatomite partially replaces ordinary Portland cement, and the effects of various DE replacement ratios (10 %, 20 %, 30 %) on fresh properties, mechanical properties, hydration, and microstructure are experimentally examined. Sustainability analysis is conducted using life cycle assessment (LCA). Results show that a 30 % DE replacement ratio increases the dynamic yield stress, static yield stress, and plastic viscosity by 31.7 %, 79.7 %, and 239.5 %, respectively. A 10 % DE replacement achieves the highest mechanical properties, with tensile, compressive, and flexural strengths increased by 54.6 %, 14.0 %, and 27.4 %, respectively, compared to the reference group. A 10 % DE replacement ratio enhances the hydration process with increased calcium silicate hydrate gels formation and refines the microstructure. DE replacement ratio above 20 % negatively impacts hydration due to insufficient portlandite, while the porous structure of unhydrated DE increases the total porosity by 18.4 %. LCA results show a 25.8 % reduction in global warming potential can be achieved. The findings reveal that the developed DE-SHCC has the potential to facilitate sustainability and enhance the mechanical properties in construction 3D printing. © 2025
Keyword ：
Bending strength Bending strength Carbon footprint Carbon footprint Compressive strength Compressive strength Concretes Concretes Portland cement Portland cement Silicates Silicates Strain hardening Strain hardening Tensile strength Tensile strength
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Teng, Fei , Xu, Fengming , Yang, Minxin et al. Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing [J]. | Journal of Building Engineering , 2025 , 103 . |
| MLA | Teng, Fei et al. "Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing" . | Journal of Building Engineering 103 (2025) . |
| APA | Teng, Fei , Xu, Fengming , Yang, Minxin , Yu, Jie , Zhang, Dong , Weng, Yiwei . Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing . | Journal of Building Engineering , 2025 , 103 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Data correctness in distributed systems is ensured by data consistency, where consistency is achieved by consensus algorithms. To safeguard data consistency, current testing tools use stress testing methods to examine consensus algorithms. However, existing tools are unable to simulate the situation under high traffic and suffer from excessive verification time. In this paper, we propose Monica, a scalable and efficient verification framework. Its key idea is to leverage the programmable switch to verify consensus algorithms. Specifically, Monica provides a set of primitives that researchers can invoke. Then, the control server recognizes the primitives and automatically configures the data plane. After that, the programmable switch collaborates with the control server to complete the verification. Experimental results show that Monica can generate traffic at the rate of Tbps level while keeping the computational and memory consumption of the programmable switch under 11.87%. Compared to existing testing tools, Monica increases the verification speed by up to 3.13 times. Further, Monica improved accuracy by 35.71% in high-traffic scenarios over other tools. © 2025 IEEE.
Keyword ：
Distributed computer systems Distributed computer systems Verification Verification
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Junjie , Yu, Jiashuo , Zhu, Longlong et al. Monica: Towards Scalable Distributed System Verification by Programmable Switch-Based Testing [C] . 2025 . |
| MLA | Lin, Junjie et al. "Monica: Towards Scalable Distributed System Verification by Programmable Switch-Based Testing" . (2025) . |
| APA | Lin, Junjie , Yu, Jiashuo , Zhu, Longlong , Zhang, Dong , Liao, Lida , Lin, Chuan et al. Monica: Towards Scalable Distributed System Verification by Programmable Switch-Based Testing . (2025) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Deploying data plane programs across the network is typically formulated as a mixed-integer programming task, leading to a long execution time. In response, existing studies carefully tailor heuristics for specific task properties such as objectives. However, they suffer from poor solution quality under dynamic task deployment since they overfit specific task properties. Recently, generative diffusion models have been widely adopted in network optimizations due to their strong adaptability and generalization. Accordingly, in this poster, we propose a diffusion model-based framework for data plane program deployment tasks. Our key idea is to leverage the reverse denoising process of diffusion models to react to dynamic task changes at runtime while maintaining high solution quality. Preliminary results on our testbed show that we reduce latency by 66.67% and resource overhead by 58.62% during dynamic deployment. © 2025 IEEE.
Keyword ：
Data quality Data quality Diffusion Diffusion Integer programming Integer programming Mixed-integer linear programming Mixed-integer linear programming
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhu, Longlong , Yu, Jiashuo , Chen, Xiang et al. Handling Data Plane Program Deployment Dynamics with High-Quality Generative Diffusion Models [C] . 2025 . |
| MLA | Zhu, Longlong et al. "Handling Data Plane Program Deployment Dynamics with High-Quality Generative Diffusion Models" . (2025) . |
| APA | Zhu, Longlong , Yu, Jiashuo , Chen, Xiang , Shu, Qing , Chen, Zedi , Jiang, Zhifan et al. Handling Data Plane Program Deployment Dynamics with High-Quality Generative Diffusion Models . (2025) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Network Function Virtualization (NFV) decouples network functions from dedicated hardware devices into Virtual Network Functions (VNFs). These VNFs are chained in order as a Service Function Chain (SFC) to provision flexible and efficient services. When service requests dynamically increase, the intensive workloads often lead to node overloads and further impact the Quality of Service (QoS). Existing works address this problem by migrating VNFs from overload nodes to other low-load nodes, known as VNF migration. However, when a VNF is shared by multiple SFCs, migrating the VNF will change the mapping relationships between these SFCs and the physical network (nodes and links). That may make some SFCs traverse more links and increase their propagation latency. That violates the demand of users for low-latency services. In this paper, to minimize the impact of VNF migration on SFC latency, we propose partial VNF migration. It migrates only partial VNFs within these SFCs to minimize the overall SFC latency while reducing migration costs. As such, we leverage partial VNF migration for efficient latency minimization with the formulation of an integer linear programming (ILP) model. Given the NP-hard nature of the problem, we propose a dynamic latency-aware partial VNF migration algorithm to reduce node overloads and minimize SFC latency. Evaluation indicates that the proposed approach has 12.7%-21.8% lower average SFC latency and 12.5%-48.5% less migration cost than state -of -the -art VNF migration algorithms. And it demonstrates about 90% shorter execution time with similar minimization performance, compared to other SFC reconfiguration algorithms.
Keyword ：
Multi-access edge computing Multi-access edge computing Network function virtualization Network function virtualization Request dynamics Request dynamics Service function chain Service function chain VNF migration VNF migration
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Dongquan , Zhou, Zhengyan , Zhang, Dong et al. Efficient service reconfiguration with partial virtual network function migration [J]. | COMPUTER NETWORKS , 2024 , 241 . |
| MLA | Liu, Dongquan et al. "Efficient service reconfiguration with partial virtual network function migration" . | COMPUTER NETWORKS 241 (2024) . |
| APA | Liu, Dongquan , Zhou, Zhengyan , Zhang, Dong , Guo, Kaiwei , Wu, Yanni , Wu, Chunming . Efficient service reconfiguration with partial virtual network function migration . | COMPUTER NETWORKS , 2024 , 241 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
灰色故障是指对生产网络产生细微影响的交换机故障. 然而，当这些轻微故障相互叠加或与新增故障叠加时，可能会导致整个生产网络的瘫痪. 因此，检测灰色故障对生产网络的稳定性至关重要. 传统解决方案关注的是在控制平面收集数据平面交换机中的流记录，并对其进行处理以检测灰色故障. 然而，此类解决方案存在着不足：（1）缓存和处理大量的流记录会引入庞大的资源开销；（2）较高的检测时延无法保证灰色故障检测的时效性. 近年来，可编程交换机的出现为灰色故障检测技术带来了新机遇：网络管理员可以将灰色故障检测算法部署运行至可编程交换机的线速ASIC流水线上，从而支持低开销、低时延、高精度的网内灰色故障检测技术. 本文针对基于可编程交换机的网内灰色故障检测技术进行综述，在对灰色故障的概念、普遍性及对生产网络的危害进行描述的基础上，分析与讨论了现有基于可编程交换机的网内灰色故障检测技术的研究现状与进展，详细介绍每项技术的工作原理及流程，搭建真实的实验平台评估各项技术的检测指标，在文末指出了现有技术所面临的问题与挑战.
Keyword ：
可编程交换机 可编程交换机 数据中心网络 数据中心网络 数据报丢失 数据报丢失 灰色故障检测 灰色故障检测 网内计算 网内计算 网络测量 网络测量
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 刘宏岩 , 张栋 , 吴春明 . 基于可编程交换机的网内灰色故障检测技术研究进展 [J]. | 电子学报 , 2024 . |
| MLA | 刘宏岩 et al. "基于可编程交换机的网内灰色故障检测技术研究进展" . | 电子学报 (2024) . |
| APA | 刘宏岩 , 张栋 , 吴春明 . 基于可编程交换机的网内灰色故障检测技术研究进展 . | 电子学报 , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
区块链存在网络动态性强和其管理困难等问题，使得区块链普遍存在DDoS 攻击和账户接管等异常现象. 现有区块链异常检测方法多从所有区块链账户中提取历史交易信息和交易频率等特征加以分析以甄别异常. 然而，随着区块链数据规模的不断扩大，现有方法在提取特征时面临内存消耗高、检测精度低的挑战. 为此，提出了一种高检测精度、低内存开销的区块链异常检测机制，该机制采用近似测量算法将区块链异常检测转化为异常交易账户检测，包括区块内异常账户和跨区块异常账户. 对于区块内异常账户，即仅存在于单个区块内的异常账户，使用Sketch算法进行账户识别，精度高. 而对于存在于多个区块且难以通过单个区块信息检测到的跨区块异常账户，则通过聚合和分析多区块信息进行账户的准确检测. 使用包含88 847个区块的真实区块链数据评估上述机制. 实验结果表明，与现有代表性方法对比，所提出的机制将区块链异常检测的召回率最高提升了6.3倍，F1分数最高提升了4.4倍. 因此，提出的高精度区块链异常检测机制对于规范区块链交易行为、维护系统安全性具有意义.
Keyword ：
Sketch Sketch 区块链 区块链 安全 安全 异常检测 异常检测 近似算法 近似算法
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 朱龙隆 , 陈翔 , 陈浩东 et al. 基于近似测量算法Sketch的高精度区块链异常检测机制 [J]. | 计算机研究与发展 , 2024 , 61 (10) : 2526-2539 . |
| MLA | 朱龙隆 et al. "基于近似测量算法Sketch的高精度区块链异常检测机制" . | 计算机研究与发展 61 . 10 (2024) : 2526-2539 . |
| APA | 朱龙隆 , 陈翔 , 陈浩东 , 牛继堂 , 刘雯靓 , 林声睿 et al. 基于近似测量算法Sketch的高精度区块链异常检测机制 . | 计算机研究与发展 , 2024 , 61 (10) , 2526-2539 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The programmable switch offers a limited capacity of packet header vector (PHV) words that store packet header fields and metadata fields defined by network functions. However, existing switch compilers employ inefficient strategies of encoding fields on PHV words. Their encoding wastes scarce PHV words and may result in failures when deploying network functions. In this paper, we propose, a new framework that reuses PHV words for as many fields as possible to achieve resource-efficient PHV encoding. offers a field analyzer and an optimization framework. The analyzer identifies which fields can reuse PHV words while preserving the original packet processing logic. The framework integrates analysis results into its encoding to offer the resource-optimal decisions. Also, to achieve timeliness at runtime, it provides a Greedy-based heuristic, which quickly solves PHV encoding and returns near-optimal results. We evaluate with production-scale network functions. Our results show that reduces the consumption of PHV words by up to 85%.
Keyword ：
Encoding Encoding Metadata Metadata Optimization Optimization Packet header vector Packet header vector Production Production programmable switch programmable switch Program processors Program processors Runtime Runtime Vectors Vectors
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Zhang, Wenbin , Sun, Xi et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (5) : 4191-4206 . |
| MLA | Chen, Xiang et al. "Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches" . | IEEE-ACM TRANSACTIONS ON NETWORKING 32 . 5 (2024) : 4191-4206 . |
| APA | Chen, Xiang , Zhang, Wenbin , Sun, Xi , Liu, Hongyan , Zhang, Jianshan , Huang, Qun et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (5) , 4191-4206 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
