Xinxin Tang

Mr. Xinxin Tang

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 September 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XTXinxin Tang
Xinxin Tang
XZXuewen Zeng
Xuewen Zeng
LSLei Song
Lei Song
The advances in software-defined networking (SDN) have recently promoted the development of Programmable Data Planes (PDP). PDP is famous in various network environments that need to support new protocols due to its flexibility and protocol independence. Protocol-oblivious forwarding (POF) is an implementation of PDP that uses to describe the match fields and mixes the protocol parsing into the pipeline, so there is no need for a pre-defined packet header parser. Current cache schemes for the data plane, such as Microflow Cache/Megaflow Cache, are primarily implemented based on the pre-defined packet header parser. In this paper, we first analyzed the two difficulties of generating cache tables on POF PDP. Then we analyzed the advantages and disadvantages of the single flow table cache system and multiple flow tables cache system from the perspective of time overhead. Finally, we propose a pipeline-oriented cache system to accelerate POF PDP. Aiming at the pipeline with multiple branches and multiple matching paths, we design algorithms to obtain all cache tables. Then our design leveraged the incremental calculation feature of the hash function to reduce the time overhead of cache lookup. In addition, the sorting mechanism and sleep mechanism for multiple cache tables were proposed according to the locality of traffic. Our design is implemented in a real POF PDP environment. The experimental results show that our pipeline-oriented cache scheme can effectively accelerate the programmable data plane, reducing packet forwarding latency and improving the throughput.

31 August 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XTXinxin Tang
Xinxin Tang
XZXuewen Zeng
Xuewen Zeng
LSLei Song
Lei Song
Modern software data planes use spin-polling and batch processing mechanisms to significantly improve maximum throughput and forwarding latency. The user-level IO queue-based spin polling mechanism has a higher response speed than the traditional interrupt mechanism. The batch mechanism enables the software data plane to achieve higher throughput by amortizing the IO overhead over multiple packets. However, the software data plane under the spin-polling mechanism keeps running at full speed regardless of the input traffic rate, resulting in significant performance waste. At the same time, we find that the batch processing mechanism does not cope well with different input traffic, mainly reflected in the forwarding latency. The purpose of this paper is to optimize the forwarding latency by leveraging the wasted performance. We propose a forwarding latency optimization scheme for the software data plane based on the spin polling mechanism in this paper. First, we calculate the CPU utilization of the software data plane according to the number of cycles the CPU spends on the valuable task. Then, our scheme controls the Tx queues and dynamically adjusts the output batch size based on the CPU utilization to optimize the forwarding latency of the software data plane. Compared with the original software data plane, the evaluation result shows that the forwarding latency can be reduced by 3.56% to 45% (in a single queue evaluation) and 4.35% to 55.54% (in a multiple queue evaluation).