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
L'auteur propose un schéma de contrôle de flux qui dérive le taux de transmission optimal des paquets à partir des ACK des paquets émetteurs. L'optimisation est basée sur une programmation mathématique telle que la méthode des extrémales et la méthode des moindres carrés. L'auteur prouve que la méthode proposée est équitable lorsque le RTT et la longueur du paquet de chaque expéditeur sont les mêmes. Il est également démontré que la condition suffisante pour que la méthode proposée soit optimale et stable est généralement vraie dans les réseaux par paquets. Les performances sont examinées par des simulations informatiques, et il s'avère qu'un haut débit est obtenu quelle que soit la structure du réseau.
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.
Copier
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
Copier
@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},}
Copier
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 -