?? rfc2861.txt
字號:
If no more data is available to send
W_used = max(W_used, amount of unacknowledged data)
If tcpnow - T_prev >= RTO
(The sender has been application-limited.)
ssthresh = max(ssthresh, 3*cwnd/4)
win = min(cwnd, receiver's declared max window)
cwnd = (win + W_used)/2
T_prev = tcpnow
W_used = 0
4 模擬
在網絡模擬器[NS]中已將CWV作為一個選項加以實現,在對CWV的有效性檢驗時,可以
在"tcl/test"下運行"./test-all-tcp"命令。模擬器顯示了在TCP連接過了一段應用程序限
制后用CWV來降低擁塞窗口的大小,并在傳輸是應用限制時,來限制擁塞窗口的增加。正如
在模擬器顯示的,保持連接歷史的闋值的使用是擁塞窗口有效性檢驗的關鍵部分。在[HPF99]
對這些模擬有詳細的討論。
5 實驗
在FREEBSD3.2的TCP實現中,我們實現了CWV機制,在[HPF99]對這些實驗有詳細
的討論。
第一個實驗檢測了在應用程序限制期間用擁塞窗口有效性檢驗的機制來限制窗口的增
長的效果。實驗采用使用Dummynet的modem連接,速率為30Kb/s,有5個包緩沖可用,
現在大部分的modem的緩沖區都比5個緩沖區多,但較舊的modem太多的緩沖區可能有限
制,在傳輸的開始部分,用戶輸入通過連接發送,之后,用戶造成有大量數據的發送。
對于沒有修改的TCP,在開始時,每個返回的確認幀將導致窗口的增加。結果導致從應用
程序的大量數據傳到傳輸層,導致數據丟失而重發,
對于用擁塞窗口有效性檢驗改進了的TCP,當窗口沒有填滿時,擁塞窗口并不增加,而
在應用程序限制的時間與用戶實際使用接近時,擁塞窗口會減小。大量突發數據被擁塞窗口
限制,使得流的丟失達到最少,最終的結果是由于為了避免超時重發,傳輸速率比沒有使用
CWV的要快近30%。
第二個實驗是采用撥號的PPP連接,有更多的緩沖區,對于沒有修改的TCP,最早大
量數據的發送并沒有造成丟失,當導致RTT增加到近5秒,連接變得為接收方的窗口限制。
對于用擁塞窗口有效性檢驗改進了的TCP,流的處理進行的很好,沒有產生大量的突發
數據,在這種情況下,窗口的線形增加在緩沖區慢慢填滿時也只造成RTT的緩慢增長。
對于第二個實驗,改進和沒改進的TCP以幾乎同等的時間發送完數據,這是由于modem
的緩沖區比接收方的窗口大,連接在兩種情況下都被充分利用,很明顯,modem的緩沖區
在RTT上的影響并沒有期望,但對當前產生突發數據的TCP實現而言,是很有必要的。
6 結論
本文列舉了在一段IDLE期間或者發送方是應用程序限制并在增加擁塞窗口之前采用的
用擁塞窗口有效性檢驗的幾種TCP算法。這些算法的目的是為了讓TCP的擁塞窗口網絡路徑
上TCP連接狀況,而同時保留網絡路徑上的一些原來的狀況。我們相信,這些改進通過防止
由于TCP發送方沒有更新關于目前網絡狀況而造成的包丟失,無論對網絡還是TCP流本身都
是有益的,將來的工作在于使用模擬器和實驗來調查這些算法帶來的益處。另外的工作是在
發送方在對于TCP往還時間沒有準確的估計時,描述對于TCP實現的一種更復雜的CWV算法。
7 參考
[FF96] Fall, K., and Floyd, S., Simulation-based Comparisons of
Tahoe, Reno, and SACK TCP, Computer Communication Review,
V. 26 N. 3, July 1996, pp. 5-21. URL
"http://www.aciri.org/floyd/papers.html".
[HPF99] Mark Handley, Jitendra Padhye, Sally Floyd, TCP Congestion
Window Validation, UMass CMPSCI Technical Report 99-77,
September 1999. URL "ftp://www-
net.cs.umass.edu/pub/Handley99-tcpq-tr-99-77.ps.gz".
[HTH98] Amy Hughes, Joe Touch, John Heidemann, "Issues in TCP
Slow-Start Restart After Idle", Work in Progress.
[J88] Jacobson, V., Congestion Avoidance and Control, Originally
from Proceedings of SIGCOMM '88 (Palo Alto, CA, Aug.
1988), and revised in 1992. URL "http://www-
nrg.ee.lbl.gov/nrg-papers.html".
[JKBFL96] Raj Jain, Shiv Kalyanaraman, Rohit Goyal, Sonia Fahmy, and
Fang Lu, Comments on "Use-it or Lose-it", ATM Forum
Document Number: ATM Forum/96-0178, URL
"http://www.netlab.ohio-
state.edu/~jain/atmf/af_rl5b2.htm".
[JKGFL95] R. Jain, S. Kalyanaraman, R. Goyal, S. Fahmy, and F. Lu, A
Fix for Source End System Rule 5, AF-TM 95-1660, December
1995, URL "http://www.netlab.ohio-
state.edu/~jain/atmf/af_rl52.htm".
[MSML99] Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Kevin Lahey,
The Rate-Halving Algorithm for TCP Congestion Control,
June 1999. URL
"http://www.psc.edu/networking/ftp/papers/draft-
ratehalving.txt".
[NS] NS, the UCB/LBNL/VINT Network Simulator. URL
"http://www-mash.cs.berkeley.edu/ns/".
[RFC2581] Allman, M., Paxson, V. and W. Stevens, TCP Congestion
Control, RFC 2581, April 1999.
[VH97] Vikram Visweswaraiah and John Heidemann. Improving Restart
of Idle TCP Connections, Technical Report 97-661,
University of Southern California, November, 1997.
[Dummynet] Luigi Rizzo, "Dummynet and Forward Error Correction",
Freenix 98, June 1998, New Orleans. URL
"http://info.iet.unipi.it/~luigi/ip_dummynet/".
8 安全性考慮
通常有關TCP擁塞控制的安全性考慮在RFC 2581中討論。本文描述了那些擁塞控制過程的
一個方面的一種算法。因此,在RFC 2581中討論的安全性考慮也適合本算法,對于本算法
還沒有其他的安全性問題。
9. 作者地址
Mark Handley
AT&T Center for Internet Research at ICSI (ACIRI)
Phone: +1 510 666 2946
EMail: mjh@aciri.org
URL: http://www.aciri.org/mjh/
Jitendra Padhye
AT&T Center for Internet Research at ICSI (ACIRI)
Phone: +1 510 666 2887
EMail: padhye@aciri.org
URL: http://www-net.cs.umass.edu/~jitu/
Sally Floyd
AT&T Center for Internet Research at ICSI (ACIRI)
Phone: +1 510 666 2989
EMail: floyd@aciri.org
URL: http://www.aciri.org/floyd/
10. 版權說明
Copyright (C) The Internet Society (2000). All Rights Reserved.
This document and translations of it may be copied and furnished to
others, and derivative works that comment on or otherwise explain it
or assist in its implementation may be prepared, copied, published
and distributed, in whole or in part, without restriction of any
kind, provided that the above copyright notice and this paragraph are
included on all such copies and derivative works. However, this
document itself may not be modified in any way, such as by removing
the copyright notice or references to the Internet Society or other
Internet organizations, except as needed for the purpose of
developing Internet standards in which case the procedures for
copyrights defined in the Internet Standards process must be
followed, or as required to translate it into languages other than
English.
The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assigns.
This document and the information contained herein is provided on an
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
INCLUDING
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
致謝
Funding for the RFC Editor function is currently provided by the
Internet Society.
RFC2861——TCP Congestion Window Validation TCP 擁塞窗口檢驗
1
RFC文檔中文翻譯計劃
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -