The FB Mechanism for TCP over UBR in Subnet ATM Models
Summary :
In this paper, we present the FB (Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved by using this congestion control mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare the performance of the existing drop-tail, EB (Equal Buffering) and the proposed FB buffer management schemes, with and without RR (Round-Robin) scheduling, and show through simulation the effectiveness of the proposed FB mechanism when used with the RR scheduling scheme.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.3 pp.481-488
- Publication Date
- 1999/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching and Communication Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Woo-June KIM, Byeong Gi LEE, "The FB Mechanism for TCP over UBR in Subnet ATM Models" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 3, pp. 481-488, March 1999, doi: .
Abstract: In this paper, we present the FB (Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved by using this congestion control mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare the performance of the existing drop-tail, EB (Equal Buffering) and the proposed FB buffer management schemes, with and without RR (Round-Robin) scheduling, and show through simulation the effectiveness of the proposed FB mechanism when used with the RR scheduling scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_3_481/_p
Copy
@ARTICLE{e82-b_3_481,
author={Woo-June KIM, Byeong Gi LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={The FB Mechanism for TCP over UBR in Subnet ATM Models},
year={1999},
volume={E82-B},
number={3},
pages={481-488},
abstract={In this paper, we present the FB (Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved by using this congestion control mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare the performance of the existing drop-tail, EB (Equal Buffering) and the proposed FB buffer management schemes, with and without RR (Round-Robin) scheduling, and show through simulation the effectiveness of the proposed FB mechanism when used with the RR scheduling scheme.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - The FB Mechanism for TCP over UBR in Subnet ATM Models
T2 - IEICE TRANSACTIONS on Communications
SP - 481
EP - 488
AU - Woo-June KIM
AU - Byeong Gi LEE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 1999
AB - In this paper, we present the FB (Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved by using this congestion control mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare the performance of the existing drop-tail, EB (Equal Buffering) and the proposed FB buffer management schemes, with and without RR (Round-Robin) scheduling, and show through simulation the effectiveness of the proposed FB mechanism when used with the RR scheduling scheme.
ER -
English
