Analysis of TCP Vegas and TCP Reno

被引：0
|
作者：
AitHellal, O
Altman, E
机构：
来源：
ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3 | 1997年
关键词：
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
引用
收藏
页码：495 / 499
页数：5
相关论文
共 50 条
  • [31] The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism
    Domanski, Adam
    Domanska, Joanna
    Pagano, Michele
    Czachorski, Tadeusz
    [J]. COMPUTER AND INFORMATION SCIENCES, ISCIS 2016, 2016, 659 : 193 - 200
  • [32] An Improved Algorithm H-Vegas for Enhancing Compatibility with TCP Reno
    Zhang Hua
    Liao Ming-hua
    [J]. SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING: THEORY AND PRACTICE, VOL 1, 2012, 114 : 945 - 951
  • [33] A GAME-THEORETIC ANALYSIS OF TCP VEGAS AND FAST TCP
    Liu, Zhenhua
    Zhang, Xiaoping
    Wang, Dong
    Zhao, Youjian
    Guan, Hongtao
    [J]. CIICT 2008: PROCEEDINGS OF CHINA-IRELAND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATIONS TECHNOLOGIES 2008, 2008, : 548 - 552
  • [34] TCP Vegas-b:TCP Vegas改进算法
    王斌
    陈元琰
    冯伟
    胡愚
    [J]. 计算机工程与设计, 2011, 32 (02) : 438 - 441
  • [35] TCP Vegas和TCP Reno的兼容性问题及其解决办法
    周铁军
    寇小文
    李阳
    [J]. 湘潭大学学报(自然科学版), 2008, 30 (04) : 130 - 134
  • [36] 对TCP Vegas与TCP Reno公平性问题的研究与仿真
    周红明
    仲涛
    [J]. 玉溪师范学院学报, 2006, (09) : 48 - 52
  • [37] 基于TCP Vegas与TCP Reno的一种改进拥塞控制算法
    秦楠
    郑应平
    [J]. 计算机工程与科学, 2007, (11) : 14 - 16
  • [38] Analysis on a stochastic model of TCP Reno
    Qing, G
    Yin, QH
    [J]. ICCS 2002: 8TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2002, : 368 - 372
  • [39] Fairness comparison of FAST TCP and TCP Reno
    Tan, Liansheng
    Dong, Lina
    Yuan, Cao
    Zukerman, Moshe
    [J]. COMPUTER COMMUNICATIONS, 2007, 30 (06) : 1375 - 1382
  • [40] TCP Vegas-A: Solving the fairness and rerouting issues of TCP Vegas
    Srijith, KN
    Jacob, L
    Ananda, AL
    [J]. 2003 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE PROCEEDINGS, 2003, : 309 - 316
12345