The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
TCP tradisional mempunyai strategi kawalan kesesakan yang baik yang menyesuaikan kadar penghantarannya mengikut kesesakan rangkaian. Selain itu, algoritma pemulihan pantas boleh membantu TCP mencapai daya pemprosesan yang lebih baik dengan bertindak balas kepada kesesakan rangkaian sementara dengan baik. Walau bagaimanapun, jika kehilangan beberapa paket berlaku, masa untuk memasuki fasa mengelakkan kesesakan akan ditangguhkan kerana masa pemulihan yang panjang. Selain itu, semasa fasa pemulihan, TCP membekukan saiz tetingkap kesesakan sehingga semua paket yang hilang dipulihkan, dan ini boleh menjadikan masa pemulihan lebih lama mengakibatkan kemerosotan prestasi. Untuk mengurangkan overhed pemulihan sedemikian, kami mencadangkan Pemulihan seketika algoritma yang memulihkan kehilangan paket tanpa fasa pemulihan tambahan. Seperti TCP dan varian lain, algoritma kami juga mengurangkan separuh saiz tetingkap kesesakan apabila kejatuhan paket dikesan, tetapi ia melaksanakan fasa mengelakkan kesesakan serta-merta seolah-olah pemulihan kerugian selesai. Untuk paket yang hilang, penghantar TCP menghantarnya bersama-sama dengan paket biasa selagi tetingkap kesesakan membenarkan dan bukannya melakukan penghantaran semula pantas. Dengan cara ini, kita boleh menghapuskan overhed pemulihan dengan cekap dan mencapai keadaan mantap seketika selepas kesesakan rangkaian. Akhir sekali, kami menyediakan kajian berasaskan simulasi tentang tingkah laku pemulihan TCP dan mengesahkan bahawa kami Pemulihan seketika algoritma sentiasa menunjukkan prestasi yang lebih baik berbanding dengan NewReno, SACK dan FACK.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Jae-Hyun HWANG, See-Hwan YOO, Chuck YOO, "Momentary Recovery Algorithm: A New Look at the Traditional Problem of TCP" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 12, pp. 3765-3773, December 2009, doi: 10.1587/transcom.E92.B.3765.
Abstract: Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK, and FACK.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3765/_p
Salinan
@ARTICLE{e92-b_12_3765,
author={Jae-Hyun HWANG, See-Hwan YOO, Chuck YOO, },
journal={IEICE TRANSACTIONS on Communications},
title={Momentary Recovery Algorithm: A New Look at the Traditional Problem of TCP},
year={2009},
volume={E92-B},
number={12},
pages={3765-3773},
abstract={Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK, and FACK.},
keywords={},
doi={10.1587/transcom.E92.B.3765},
ISSN={1745-1345},
month={December},}
Salinan
TY - JOUR
TI - Momentary Recovery Algorithm: A New Look at the Traditional Problem of TCP
T2 - IEICE TRANSACTIONS on Communications
SP - 3765
EP - 3773
AU - Jae-Hyun HWANG
AU - See-Hwan YOO
AU - Chuck YOO
PY - 2009
DO - 10.1587/transcom.E92.B.3765
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2009
AB - Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK, and FACK.
ER -