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 변형인 TCP-PR에서 송신자 버퍼의 공간 복잡성을 조사합니다. 우리는 SACK 옵션을 사용하면 TCP-PR에 (β+1)의 송신자 버퍼가 필요하다는 사실을 발견했습니다.
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.
부
Chansook LIM, "Space Complexity of TCP for Persistent Packet Reordering" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 6, pp. 1601-1604, June 2010, doi: 10.1587/transcom.E93.B.1601.
Abstract: This letter investigates the space complexity of the sender buffer in a TCP variant, TCP-PR, to deal with packet reordering. Our finding is that with the SACK option used, TCP-PR requires the sender buffer of (β+1)
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1601/_p
부
@ARTICLE{e93-b_6_1601,
author={Chansook LIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Space Complexity of TCP for Persistent Packet Reordering},
year={2010},
volume={E93-B},
number={6},
pages={1601-1604},
abstract={This letter investigates the space complexity of the sender buffer in a TCP variant, TCP-PR, to deal with packet reordering. Our finding is that with the SACK option used, TCP-PR requires the sender buffer of (β+1)
keywords={},
doi={10.1587/transcom.E93.B.1601},
ISSN={1745-1345},
month={June},}
부
TY - JOUR
TI - Space Complexity of TCP for Persistent Packet Reordering
T2 - IEICE TRANSACTIONS on Communications
SP - 1601
EP - 1604
AU - Chansook LIM
PY - 2010
DO - 10.1587/transcom.E93.B.1601
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2010
AB - This letter investigates the space complexity of the sender buffer in a TCP variant, TCP-PR, to deal with packet reordering. Our finding is that with the SACK option used, TCP-PR requires the sender buffer of (β+1)
ER -