Kun Huang

Affiliations:
  • Chinese Academy of Sciences, Institute of Computing Technology, China
  • Hunan University, School of Computer and Communication, Changsha, China (former)


According to our database1, Kun Huang authored at least 24 papers between 2006 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Scalable datacenter multicast using in-packet bitmaps.
Distributed Parallel Databases, 2018

A Hybrid Approach to Scalable Name Prefix Lookup.
Proceedings of the 26th IEEE/ACM International Symposium on Quality of Service, 2018

Scalable high-speed NDN name lookup.
Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018

2016
Minimizing datacenter flow completion times with server-based flow scheduling.
Comput. Networks, 2016

2015
Memory-efficient IP lookup using trie merging for scalable virtual routers.
J. Netw. Comput. Appl., 2015

Improving datacenter throughput and robustness with Lazy TCP over packet spraying.
Comput. Commun., 2015

SFS: Server-based flow scheduling for minimizing datacenter flow completion times.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

2014
A memory-efficient parallel routing lookup model with fast updates.
Comput. Commun., 2014

2013
Fast and deterministic hash table lookup using discriminative bloom filters.
J. Netw. Comput. Appl., 2013

A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Scalable TCAM-based regular expression matching with compressed finite automata.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2013

2011
An index-split Bloom filter for deep packet inspection.
Sci. China Inf. Sci., 2011

Offset addressing approach to memory-efficient IP address lookup.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
DHT-based lightweight broadcast algorithms in large-scale computing infrastructures.
Future Gener. Comput. Syst., 2010

Accelerating the bit-split string matching algorithm using Bloom filters.
Comput. Commun., 2010

2009
A Token-based Broadcast Algorithm over DHT for Large-scale Computing Infrastructures.
Proceedings of the WINSYS 2009, 2009

A Regular Expression Matching Algorithm Using Transition Merging.
Proceedings of the 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing, 2009

An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent's Robustness.
Proceedings of the Advances in Grid and Pervasive Computing, 4th International Conference, 2009

A Partition-Based Broadcast Algorithm over DHT for Large-Scale Computing Infrastructures.
Proceedings of the Advances in Grid and Pervasive Computing, 4th International Conference, 2009

2008
Optimizing the BitTorrent performance using an adaptive peer selection strategy.
Future Gener. Comput. Syst., 2008

A Byte-Filtered String Matching Algorithm for Fast Deep Packet Inspection.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

2007
A Dynamic Quota-Based Peer Selection Strategy in BitTorrent.
Proceedings of the Grid and Cooperative Computing, 2007

A Prediction-Based Fair Replication Algorithm in Structured P2P Systems.
Proceedings of the Autonomic and Trusted Computing, 4th International Conference, 2007

2006
On the Self-Similarity of the 1999 DARPA/Lincoln Laboratory Evaluation Data.
Proceedings of the SECRYPT 2006, 2006


  Loading...