IEICE TRANSACTIONS on Communications
Optimum, Stable, and Fair Flow Control for Packet Networks
Summary :
The author proposes a flow control scheme which derives the optimal packet transmission rate from the ACKs of the sending packets. The optimization is based on mathematical programming such as the extremal method and least-squares method. The author proves that the proposed method is fair when the RTT and thepacket length of each sender are the same. It is also shown that the sufficient condition for the proposed method to be optimal and stable generally holds true in packet networks. The performances are examined by computer simulations, and it is found that high throughput is obtained regardless of the network structure.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.3 pp.489-499
- 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
Hideki SATOH, "Optimum, Stable, and Fair Flow Control for Packet Networks" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 3, pp. 489-499, March 1999, doi: .
Abstract: The author proposes a flow control scheme which derives the optimal packet transmission rate from the ACKs of the sending packets. The optimization is based on mathematical programming such as the extremal method and least-squares method. The author proves that the proposed method is fair when the RTT and thepacket length of each sender are the same. It is also shown that the sufficient condition for the proposed method to be optimal and stable generally holds true in packet networks. The performances are examined by computer simulations, and it is found that high throughput is obtained regardless of the network structure.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_3_489/_p
Copy
@ARTICLE{e82-b_3_489,
author={Hideki SATOH, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimum, Stable, and Fair Flow Control for Packet Networks},
year={1999},
volume={E82-B},
number={3},
pages={489-499},
abstract={The author proposes a flow control scheme which derives the optimal packet transmission rate from the ACKs of the sending packets. The optimization is based on mathematical programming such as the extremal method and least-squares method. The author proves that the proposed method is fair when the RTT and thepacket length of each sender are the same. It is also shown that the sufficient condition for the proposed method to be optimal and stable generally holds true in packet networks. The performances are examined by computer simulations, and it is found that high throughput is obtained regardless of the network structure.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Optimum, Stable, and Fair Flow Control for Packet Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 489
EP - 499
AU - Hideki SATOH
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 1999
AB - The author proposes a flow control scheme which derives the optimal packet transmission rate from the ACKs of the sending packets. The optimization is based on mathematical programming such as the extremal method and least-squares method. The author proves that the proposed method is fair when the RTT and thepacket length of each sender are the same. It is also shown that the sufficient condition for the proposed method to be optimal and stable generally holds true in packet networks. The performances are examined by computer simulations, and it is found that high throughput is obtained regardless of the network structure.
ER -
English
