Yu‐Kuen Lai
Yu‐Kuen Lai has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Theophilus Wellem
Department of Electronic Engineering, Chung Yuan Christian University, Zhongli 32023, Taiwan
2 shared publications Hui‐Ping You
Department of Electrical Engineering Chung Yuan Christian University Zhongli City Taiwan
1 shared publication
Latest Publications
- Open Access
- 1 August 2016
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 52 (17) , 1459-1461
Sketch‐guided filtering support for detecting superspreaders in high‐speed networks
A sketch‐guided filtering scheme for assisting superspreader detection in the measurement of high‐speed network traffic is proposed. The scheme comprises of an array of linear‐counting sketches that rapidly eliminates flows with potentially low fan‐out during a measurement interval. Based on the results of simulations obtained using real‐world network traces, the filter can eliminate up to 90% of the flows of non‐superspreader sources and improve the accuracy of superspreader identification. Furthermore, the proposed scheme has a smaller fan‐out estimation error and consumes less memory than previously developed approaches. The hardware implementation can process network traffic at a throughput of 27 Gbit/s.
- 1 August 2016
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 52 (17) , 1459-1461
Open AccessSketch‐guided filtering support for detecting superspreaders in high‐speed networks
A sketch‐guided filtering scheme for assisting superspreader detection in the measurement of high‐speed network traffic is proposed. The scheme comprises of an array of linear‐counting sketches that rapidly eliminates flows with potentially low fan‐out during a measurement interval. Based on the results of simulations obtained using real‐world network traces, the filter can eliminate up to 90% of the flows of non‐superspreader sources and improve the accuracy of superspreader identification. Furthermore, the proposed scheme has a smaller fan‐out estimation error and consumes less memory than previously developed approaches. The hardware implementation can process network traffic at a throughput of 27 Gbit/s.
- Open Access
- 1 November 2014
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 50 (24) , 1845-1847
Hardware‐assisted estimation of entropy norm for high‐speed network traffic
The computation of the entropy of a high‐speed data stream in a one‐pass fashion is crucial to many network security applications. Motivated by the work of Lall et al. , this study examines the design trade‐off of processing speed and accuracy for estimating the entropy norm. The proposed scheme leverages the Count Sketch with constant memory access on counter update and point query operations. With a bounded relative error and a constant memory access cycle, the design can process incoming traffic with a throughput of 30 Gbit/s.
- 1 November 2014
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 50 (24) , 1845-1847
Open AccessHardware‐assisted estimation of entropy norm for high‐speed network traffic
The computation of the entropy of a high‐speed data stream in a one‐pass fashion is crucial to many network security applications. Motivated by the work of Lall et al. , this study examines the design trade‐off of processing speed and accuracy for estimating the entropy norm. The proposed scheme leverages the Count Sketch with constant memory access on counter update and point query operations. With a bounded relative error and a constant memory access cycle, the design can process incoming traffic with a throughput of 30 Gbit/s.