Yi Tang

Affiliations:
  • Tsinghua Univerisity, Department of Computer Science and Technology, Beijing, China


According to our database1, Yi Tang authored at least 16 papers between 2006 and 2012.

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

2012
Managing DFA History with Queue for Deflation DFA.
J. Netw. Syst. Manag., 2012

2011
WebShield: Enabling Various Web Defense Techniques without Client Side Modifications.
Proceedings of the Network and Distributed System Security Symposium, 2011

StriD²FA: Scalable Regular Expression Matching for Deep Packet Inspection.
Proceedings of IEEE International Conference on Communications, 2011

2010
Parallel DFA Architecture for Ultra High Throughput DFA-Based Pattern Matching.
IEICE Trans. Inf. Syst., 2010

NetShield: massive semantics-based vulnerability signature matching for high-speed networks.
Proceedings of the ACM SIGCOMM 2010 Conference on Applications, 2010

Deflation DFA: Remembering History is Adequate.
Proceedings of IEEE International Conference on Communications, 2010

Pattern-Based DFA for Memory-Efficient and Scalable Multiple Regular Expression Matching.
Proceedings of IEEE International Conference on Communications, 2010

Cache-Based Scalable Deep Packet Inspection with Predictive Automaton.
Proceedings of the Global Communications Conference, 2010

Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching.
Proceedings of the Global Communications Conference, 2010

Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks.
Proceedings of the Global Communications Conference, 2010

2009
More Accurate and Fast SYN Flood Detection.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009

Compact DFA Structure for Multiple Regular Expressions Matching.
Proceedings of IEEE International Conference on Communications, 2009

Module-Based Finite Automata: A Scalable and Memory-Efficient Architecture for Multi-pattern Matching in Deep Packet Inspection.
Proceedings of the Communication and Networking, 2009

SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory.
Proceedings of the 2009 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2009

2007
Per-Flow Queueing by Dynamic Queue Sharing.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Traffic Distribution over Equal-Cost-Multi-Paths using LRU-based Caching with Counting Scheme.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006


  Loading...