您当前的位置:
首页 >
文章列表页 >
TCP Flow Identifying Algorithm Based on Finite State Automaton
更新时间:2025-07-16
    • TCP Flow Identifying Algorithm Based on Finite State Automaton

    • Acta Electronica Sinica   Vol. 45, Issue 6, Pages: 1396-1402(2017)
    • DOI:10.3969/j.issn.0372-2112.2017.06.017    

      CLC: TP393
    • Published:2017

    移动端阅览

  • ZHANG Xiao-guo, DING Wei. TCP Flow Identifying Algorithm Based on Finite State Automaton[J]. Acta Electronica Sinica, 2017, 45(6): 1396-1402. DOI: 10.3969/j.issn.0372-2112.2017.06.017.

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

2

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Study on Router Buffer Size with NewReno Congestion Control Method
Detection of LDDoS Attack Based on Kalman Filtering
CB-HSTCP:Fair TCP in High-speed Network
The Scheme of Highest-Rate-Flow Early Discard for Buffer Management
Congestion Characteristics of ABR Service inthe Presence of VBR Background Traffic

Related Author

GUAN Hong-tao
WANG Dong
ZHAO You-jian
WU Jian-ping
WU Zhi-jun
YUE Meng
SU Fan-jun
PAN Xue-zeng

Related Institution

清华大学计算机科学与技术系
College of Electronics and Information Engineering,Civil Aviation University of China
College of Computer Science,Zhejiang University
College of Computer Science, Hangzhou Dianzi University
College of Computer ScienceZhejiang UniversityHangzhouZhejiang 310027China
0