On the Self-Similarity of the 1999 DARPA/Lincoln Laboratory Evaluation Data. - Kun Huang 003; Dafang Zhang 001 (SECRYPT, 2006)

A Prediction-Based Fair Replication Algorithm in Structured P2P Systems. - Xianshu Zhu; Dafang Zhang 001; Wenjia Li; Kun Huang 003 (ATC, 2007)

A Dynamic Quota-Based Peer Selection Strategy in BitTorrent. - Kun Huang 003; Lei Wang; Dafang Zhang 001; Yongwei Liu (GCC, 2007)

A Byte-Filtered String Matching Algorithm for Fast Deep Packet Inspection. - Kun Huang 003; Dafang Zhang 001 (ICYCS, 2008)

Optimizing the BitTorrent performance using an adaptive peer selection strategy. - Kun Huang 003; Li-e Wang 001; Dafang Zhang 001; Yongwei Liu (Future Gener. Comput. Syst., 2008)

A Partition-Based Broadcast Algorithm over DHT for Large-Scale Computing Infrastructures. - Kun Huang 003; Dafang Zhang 001 (GPC, 2009)

An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent's Robustness. - Kun Huang 003; Dafang Zhang 001; Li-e Wang 001 (GPC, 2009)

A Regular Expression Matching Algorithm Using Transition Merging. - Jiekun Zhang; Dafang Zhang 001; Kun Huang 003 (PRDC, 2009)

A Token-based Broadcast Algorithm over DHT for Large-scale Computing Infrastructures. - Kun Huang 003; Dafang Zhang 001 (WINSYS, 2009)

Accelerating the bit-split string matching algorithm using Bloom filters. - Kun Huang 003; Dafang Zhang 001; Zheng Qin 001 (Comput. Commun., 2010)

DHT-based lightweight broadcast algorithms in large-scale computing infrastructures. - Kun Huang 003; Dafang Zhang 001 (Future Gener. Comput. Syst., 2010)

Offset addressing approach to memory-efficient IP address lookup. - Kun Huang 003; Gaogang Xie; Yanbiao Li; Alex X. Liu (INFOCOM, 2011)

An index-split Bloom filter for deep packet inspection. - Kun Huang 003; Dafang Zhang 001 (Sci. China Inf. Sci., 2011)

Scalable TCAM-based regular expression matching with compressed finite automata. - Kun Huang 003; Linxuan Ding; Gaogang Xie; Dafang Zhang 001; Alex X. Liu; Kavé Salamatian (ANCS, 2013)

A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters. - Kun Huang 003; Jie Zhang 043; Dafang Zhang 001; Gaogang Xie; Kavé Salamatian; Alex X. Liu; Wei Li (IPDPS, 2013)

Fast and deterministic hash table lookup using discriminative bloom filters. - Kun Huang 003; Gaogang Xie; Rui Li; Shuai Xiong (J. Netw. Comput. Appl., 2013)

A memory-efficient parallel routing lookup model with fast updates. - Yanbiao Li; Dafang Zhang 001; Kun Huang 003; Dacheng He; Weiping Long (Comput. Commun., 2014)

SFS: Server-based flow scheduling for minimizing datacenter flow completion times. - Jie Zhang 043; Dafang Zhang 001; Kun Huang 003 (INFOCOM Workshops, 2015)

Improving datacenter throughput and robustness with Lazy TCP over packet spraying. - Jie Zhang 043; Dafang Zhang 001; Kun Huang 003 (Comput. Commun., 2015)

Memory-efficient IP lookup using trie merging for scalable virtual routers. - Kun Huang 003; Gaogang Xie; Yanbiao Li; Dafang Zhang 001 (J. Netw. Comput. Appl., 2015)

Minimizing datacenter flow completion times with server-based flow scheduling. - Jie Zhang 043; Dafang Zhang 001; Kun Huang 003; Zheng Qin 001 (Comput. Networks, 2016)

Scalable high-speed NDN name lookup. - Kun Huang 003; Zhaohua Wang; Gaogang Xie (ANCS, 2018)

A Hybrid Approach to Scalable Name Prefix Lookup. - Kun Huang 003; Zhaohua Wang (IWQoS, 2018)

Scalable datacenter multicast using in-packet bitmaps. - Kun Huang 003; Xin Su (Distributed Parallel Databases, 2018)