Query：
学者姓名：张栋
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
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 ：
Data center networks will elevate link bandwidth to over 200Gbps to meet the performance demands of distributed ML and NVMe. That means more traffic will be transmitted within one RTT, making the workload more burst. The challenge posed to congestion control (CC) is that there is barely enough time to make correct decisions. Sub-RTT, a method for switches to proactively generate congestion signals, reduces feedback delays, enhancing CC to handle burst traffic. However, Sub-RTT increases the sensitivity of the sender to queuing in switch buffers, thus leading to issues such as overreactions and link oscillations. We identified that utilizing fine-grained congestion signals and refining congestion stages to adjust congestion control decisions accordingly is key to solving the overreaction problem. In this paper, we propose FCC, a CC algorithm capable of swiftly addressing congestion with Sub-RTT while preventing overreactions in burst workload, thus achieving ultra-low latency and maintaining high link throughput. FCC utilizes programmable data planes to gather fine-grained congestion information through in-band network telemetry (INT), deploys bitmap-based snapshots on switches for real-time congestion stage identification, and dynamically allocates decisions. Extensive simulation experiments indicate that, compared to HPCC, FCC reduces the peak buffer occupancy on bottleneck switches by a factor of 3.2. In large-scale cluster simulations, FCC, when compared to HPCC and DCQCN, respectively, reduces the 99-th-percentile flow completion time of short flows by 39.2% and 128.2%. © 2024 IEEE.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, H. , Zhou, J. , Chen, X. et al. FCC: Fast Source Congestion Control for Ultra-Low Latency in Data Center Networks [未知]. |
| MLA | Chen, H. et al. "FCC: Fast Source Congestion Control for Ultra-Low Latency in Data Center Networks" [未知]. |
| APA | Chen, H. , Zhou, J. , Chen, X. , Cai, J. , Zhu, L. , Liu, H. et al. FCC: Fast Source Congestion Control for Ultra-Low Latency in Data Center Networks [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In network measurement, data plane switches measure traffic and report events (e.g., heavy hitters) to the control plane via control channels. The control plane makes decisions to process events. However, current network measurement suffers from two problems. First, when traffic bursts occur, massive events are reported in a short time so that the control channels may be overloaded due to limited bandwidth capacity. Second, only a few events are reported in normal cases, making control channels underloaded and wasting network resources. In this paper, we propose Escala to provide the elastic scaling of control channels at runtime. The key idea is to dynamically migrate event streams among control channels to regulate the loads of these channels. Escala offers two components, including an Escala monitor that detects scaling situations based on realtime network statistics, and an optimization framework that makes scaling decisions to eliminate overload and underload situations. We have implemented a prototype of Escala on Tofino-based switches. Extensive experiments show that Escala achieves timely elastic scaling while preserving high application-level accuracy.
Keyword ：
Accuracy Accuracy Atmospheric measurements Atmospheric measurements Bandwidth Bandwidth control channel scaling control channel scaling Control systems Control systems Monitoring Monitoring network event collection network event collection Network measurement Network measurement Optimization Optimization Particle measurements Particle measurements programmable networks programmable networks Runtime Runtime Servers Servers Time measurement Time measurement
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Hongyan , Chen, Xiang , Huang, Qun et al. Elastically Scaling Control Channels in Network Measurement With Escala [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| MLA | Liu, Hongyan et al. "Elastically Scaling Control Channels in Network Measurement With Escala" . | IEEE-ACM TRANSACTIONS ON NETWORKING (2024) . |
| APA | Liu, Hongyan , Chen, Xiang , Huang, Qun , Kong, Dezhang , Zhang, Dong , Wu, Chunming et al. Elastically Scaling Control Channels in Network Measurement With Escala . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In-band Network Telemetry (INT) is a widely used monitoring framework in modern large-scale networks. It provides packet-level visibility into network conditions by inserting telemetry data into packets, enabling unprecedented fine-grained network management. However, this mechanism also introduces new vulnerabilities that malicious attackers can exploit. In this paper, we present eight In-band Network Telemetry Manipulation Attacks that take advantage of INT's weakness, demonstrating that attackers can cause severe damage with little effort by manipulating INT packets. To address this issue, we designed SecureINT, a security-enhanced INT prototype that provides encryption and integrity verification for INT packets. Specifically, SecureINT deploys Even-Mansour and SipHash for confidentiality and integrity, respectively. It also uses a zero-delay rotation mechanism, which enables administrators to dynamically change the version of the deployed Even-Mansour/SipHash running on programmable switches without the need to re-install new programs. In this way, SecureINT can provide lasting security for INT packets using the limited resources of programmable switches. According to the experiments, SecureINT can be deployed on programmable switches using a single pipeline. Besides, the overhead of the rotation mechanism running on the control plane is still minimal. © 2004-2012 IEEE.
Keyword ：
attack attack In-band network telemetry In-band network telemetry programmable network programmable network security security
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Kong, D. , Chen, X. , Lin, H. et al. Toward Security-Enhanced In-band Network Telemetry in Programmable Networks [J]. | IEEE Transactions on Network and Service Management , 2024 . |
| MLA | Kong, D. et al. "Toward Security-Enhanced In-band Network Telemetry in Programmable Networks" . | IEEE Transactions on Network and Service Management (2024) . |
| APA | Kong, D. , Chen, X. , Lin, H. , Zhou, Z. , Shen, Y. , Liu, H. et al. Toward Security-Enhanced In-band Network Telemetry in Programmable Networks . | IEEE Transactions on Network and Service Management , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Modern network measurement employs several measurement points in the substrate network. These points perform measurement tasks to measure traffic and report real-time events to monitoring servers in the control plane. These servers convert events to flow statistics and report them to network management applications, which require both low latency (i.e., collecting events within a limited time deadline) and high reliability (i.e., bounding the probability of event loss). However, existing solutions fail to satisfy the two requirements because they ignore the transmission latency and reliability when collecting events from measurement points to monitoring servers. In this paper, we propose Terra, a framework that aims to offer low-latency and reliable event collection. Terra provides a near-optimal heuristic that guides each measurement point to select monitoring servers to receive its events and corresponding network paths for transferring events with timeliness and reliability guarantee. We have implemented Terra on a 64 x 100 Gbps Tofino-based switch. We conduct testbed experiments to demonstrate the effectiveness of Terra in practice. The results indicate that Terra offers low-latency and reliable event collection while preserving high application-level accuracy.
Keyword ：
Low latency Low latency Network measurement Network measurement Reliability Reliability
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Hongyan , Sun, Xi , Chen, Xiang et al. Terra: Low-latency and reliable event collection in network measurement [J]. | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS , 2024 , 228 . |
| MLA | Liu, Hongyan et al. "Terra: Low-latency and reliable event collection in network measurement" . | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 228 (2024) . |
| APA | Liu, Hongyan , Sun, Xi , Chen, Xiang , Huang, Qun , Zhang, Dong , Zhou, Haifeng et al. Terra: Low-latency and reliable event collection in network measurement . | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS , 2024 , 228 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Radio access network (RAN) enables large-scale collection of sensitive data. Privacy-preserving techniques aim to learn knowledge from sensitive data to improve services without compromising privacy. However, as the data scale increases, enforcing privacy-preserving techniques on sensitive data may consume a considerable amount of system resources and impose performance penalties. To reduce system resource consumption, we present NetDP, an in-network architecture for privacy-preserving techniques by leveraging programmable switches to improve resource efficiency (i.e., CPU cycles, network bandwidth, and privacy budgets). The key idea of NetDP is to accommodate and exploit cryptographic operators to reduce resource consumption rather than repetitively and exhaustively suppressing the impact of these techniques. To the best of our knowledge, this is the first time that privacy-preserving techniques in a large-scale data processing system have been enforced on programmable switches. Our experiments based on Tofino switches indicate that NetDP significantly reduces computation latency (e.g., 40.2%-55.8% latency in computations) without impacting fidelity. IEEE
Keyword ：
Computer architecture Computer architecture Data processing Data processing differential privacy differential privacy Differential privacy Differential privacy In-network computing In-network computing Noise Noise Pipelines Pipelines Privacy Privacy Sensitivity Sensitivity
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhou, Z. , Chen, H. , Chen, L. et al. NetDP: In-Network Differential Privacy for Large-Scale Data Processing [J]. | IEEE Transactions on Green Communications and Networking , 2024 , 8 (3) : 1-1 . |
| MLA | Zhou, Z. et al. "NetDP: In-Network Differential Privacy for Large-Scale Data Processing" . | IEEE Transactions on Green Communications and Networking 8 . 3 (2024) : 1-1 . |
| APA | Zhou, Z. , Chen, H. , Chen, L. , Zhang, D. , Wu, C. , Liu, X. et al. NetDP: In-Network Differential Privacy for Large-Scale Data Processing . | IEEE Transactions on Green Communications and Networking , 2024 , 8 (3) , 1-1 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Network administrators usually realize network functions in data plane programs. They employ the network-wide program deployment that decomposes input programs into match-action tables (MATs) while deploying each MAT on a specific switch. Since MATs may be deployed on different switches, existing solutions propose the inter-switch coordination that uses the per-packet header space to deliver crucial packet processing information among switches. However, such coordination incurs non-trivial per-packet byte overhead, leading to end-to-end performance degradation. We propose, a framework that aims to minimize the per-packet byte overhead. The key idea is to formulate network-wide program deployment as a mixed-integer programming (MIP) problem with the objective of minimizing the per-packet byte overhead. Also, offers a greedy-based heuristic that solves the problem in a near-optimal and timely manner. We have implemented on Tofino switches. Compared to existing frameworks, decreases the per-packet byte overhead by 156 bytes while preserving end-to-end performance in terms of flow completion time and goodput.
Keyword ：
Control systems Control systems Degradation Degradation Indexes Indexes inter-switch coordination inter-switch coordination Metadata Metadata Optimization Optimization Program deployment Program deployment Research and development Research and development Synchronization Synchronization
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Liu, Hongyan , Xiao, Qingjiang et al. Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (4) : 2842-2857 . |
| MLA | Chen, Xiang et al. "Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment" . | IEEE-ACM TRANSACTIONS ON NETWORKING 32 . 4 (2024) : 2842-2857 . |
| APA | Chen, Xiang , Liu, Hongyan , Xiao, Qingjiang , Huang, Qun , Zhang, Dong , Zhou, Haifeng et al. Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (4) , 2842-2857 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Regular expression matching is pivotal in numerous network applications. With the ever-increasing scale of data center traffic, deploying regular expression matching modules on traditional servers struggles to meet throughput demands. Emerging programmable switches have brought new prospects for high-speed pattern matching. However, deploying regular expression matching onto programmable switches presents the challenge of space explosion incurred by compiling regular expressions into a Deterministic Finite Automata (DFA). In this paper, we introduce P4Rex, a regular expression matching system designed for programmable switches. P4Rex synergistically leverages two following techniques: an efficient regular expression grouping algorithm that partitions regular expressions into different groups to reduce memory consumption, and DFA compression technology to achieve transition sharing. Experimental results demonstrate that P4Rex exhibits an average improvement of 17% and maximum improvement of 30% on memory consumption compared to prior regular expression grouping schemes and saves more than 10x memory consumption compared to deploying DFA directly on programmable switch. © 2024 Elsevier B.V.
Keyword ：
Pattern matching Pattern matching Programmable data plane Programmable data plane Software-defined networking Software-defined networking
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, J. , Lin, W. , Lin, H. et al. P4Rex: Accelerating regular expression matching with programmable switches [J]. | Computer Networks , 2024 , 252 . |
| MLA | Lin, J. et al. "P4Rex: Accelerating regular expression matching with programmable switches" . | Computer Networks 252 (2024) . |
| APA | Lin, J. , Lin, W. , Lin, H. , Zhu, L. , Zhang, D. , Wu, C. . P4Rex: Accelerating regular expression matching with programmable switches . | Computer Networks , 2024 , 252 . |
| 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%. IEEE
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, X. , Zhang, W. , Sun, X. et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches [J]. | ACM Transactions on Networking , 2024 , 32 (5) : 1-16 . |
| MLA | Chen, X. et al. "Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches" . | ACM Transactions on Networking 32 . 5 (2024) : 1-16 . |
| APA | Chen, X. , Zhang, W. , Sun, X. , Liu, H. , Zhang, J. , Huang, Q. et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches . | ACM Transactions on Networking , 2024 , 32 (5) , 1-16 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Network telemetry is an essential part of network management and infrastructure. Among them, cardinality telemetry provides statistics on network connectivity and distribution. Network-wide cardinality telemetry refers to the deployment of multiple telemetry nodes in network for cardinality estimate. This requires the deployed data structure to be mergeable, enabling the consolidation of data from different nodes. Unfortunately, existing mergeable data structures can't simultaneously address two important criterions of cardinality telemetry: measurement accuracy and estimation interval. We propose CardSketch, aiming to adjust attention to cardinality telemetry based on changes of the network state. CardSketch incorporates a shift attention mechanism that leverages the randomness of hash functions to achieve unbiased transformations between data structures. This mechanism enables real-time selection of cardinality estimation methods based on the network's state while preserving the original telemetry information as much as possible during the attention shift. We have implemented prototypes of CardSketch in software and hardware. Through extensive experimentation, the results demonstrate that CardSketch achieves excellent cardinality telemetry with minimal memory overhead. Even with a mere 50KB of memory space, it achieves a measurement precision of 87.75% and a measurement recall of 91.49%. Additionally, CardSketch supports multi-point aggregation and arbitrary partial key queries. © 2024 IEEE.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, H. , Zhou, Z. , Chen, X. et al. CardSketch: Shift Attention for Network-wide Cardinality Telemetry [未知]. |
| MLA | Chen, H. et al. "CardSketch: Shift Attention for Network-wide Cardinality Telemetry" [未知]. |
| APA | Chen, H. , Zhou, Z. , Chen, X. , Shi, P. , Wu, Y. , Zhu, L. et al. CardSketch: Shift Attention for Network-wide Cardinality Telemetry [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
