Search

Your search keyword '"Zhang, Chuwen"' showing total 20 results
Start Over Author "Zhang, Chuwen" Publisher ieee
20 results on '"Zhang, Chuwen"'

2. TSN-Peeper: an Efficient Traffic Monitor in Time-Sensitive Networking

Author

Zhang, Chuwen, primary, Zhou, Boyang, additional, Tian, Zerui, additional, Cheng, Liang, additional, Liu, Yuxi, additional, Zhang, Huayu, additional, Chen, Song, additional, Wan, Ying, additional, Xu, Wenquan, additional, Pan, Tian, additional, Xu, Yang, additional, Wang, Yi, additional, Zhu, Hailong, additional, and Liu, Bin, additional

Published
2022
Full Text
View/download PDF

15. T-Cache: Efficient Policy-Based Forwarding Using Small TCAM.

Author

Wan, Ying, Song, Haoyu, Xu, Yang, Wang, Yilun, Pan, Tian, Zhang, Chuwen, Wang, Yi, and Liu, Bin

Subjects
PATTERN matching, SYSTEMS design, SIMULATION software, ELECTRICITY pricing, IP networks
Abstract

Ternary Content Addressable Memory (TCAM) is widely used by modern routers and switches to support policy-based forwarding due to its incomparable lookup speed and flexible matching patterns. However, the limited TCAM capacity does not scale with the ever-increasing rule table size due to the high hardware cost and high power consumption. At present, using TCAM just as a rule cache is an appealing solution, but one must resolve several tricky issues including the rule dependency and the associated TCAM updates. In this paper, we propose a new approach which can generate dependency-free rules to cache. By removing the rule dependency, the complex TCAM update problem also disappears. We provide the complete T-cache system design including slow path processing and cache replacement, and implement a T-cache prototype on Barefoot Tofino switches. We conduct comprehensive software simulations and hardware experiments based on real-world and synthesized rule tables and packet traces to show that T-cache is efficient and robust for network traffic in various scenarios. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

19. Ultra-Fast Bloom Filters using SIMD Techniques.

Author

Lu, Jianyuan, Wan, Ying, Li, Yang, Zhang, Chuwen, Dai, Huichen, Wang, Yi, Zhang, Gong, and Liu, Bin

Subjects
INFORMATION filtering systems, ENCODING, NETWORK routers, COMPUTER network resources, MEMBERSHIP
Abstract

The network link speed is growing at an ever-increasing rate, which requires all network functions on routers/switches to keep pace. Bloom filter is a widely-used membership check data structure in networking applications. Correspondingly, it also faces the urgent demand of improving the performance in membership check speed. To this end, this paper proposes a new Bloom filter variant called Ultra-Fast Bloom Filters (UFBF), by leveraging the Single Instruction Multiple Data (SIMD) techniques. We make three improvements for UFBF to accelerate the membership check speed. First, we develop a novel hash computation algorithm which can compute multiple hash functions in parallel with the use of SIMD instructions. Second, we elaborate a Bloom filter’s bit-test process from sequential to parallel, enabling more bit-tests per unit time. Third, we improve the cache efficiency of membership check by encoding an element’s information to a small block so that it can fit into a cache-line. We further generalize UFBF, called c-UFBF, to make UFBF supporting large number of hash functions. Both theoretical analysis and extensive evaluations show that the UFBF greatly outperforms the state-of-the-art Bloom filter variants on membership check speed. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results