TY - JOUR
T1 - A congestion-control policy on the Internetwork gateway
AU - Varakulsiripunth, Ruttikorn
AU - Shiratori, Norio
AU - Noguchi, Shoichi
PY - 1986
Y1 - 1986
N2 - A new approach to congestion-control policy for the interconnected networks system, called "FCP", is proposed. The main purpose of the FCP policy is to avoid the congestion of a network as well as to guarantee the performance of each network up to the desired value. In FCP policy, the traffic that arrives at aateway is restricted by that gateway in compliance with the acceptable rate, called "PAR", corresponding to its destination network. And the PAR corresponding to a network is determined based on the performance requirement of that network. The determination of PAR in FCP policy is presented and analyzed quantitatively in terms of network throughput, whereby the queuing models for a gateway and a network are developed. The result of the analytical evaluation of FCP policy is reduced to the problem of solving simultaneous non-linear equations with several variables and of a higher degree. Therefore, the systematic algorithm for computing PARs in FCP policy is also given. The numerical applications demonstrate the good efficiency of FCP policy to achieve the desired performance for each network.
AB - A new approach to congestion-control policy for the interconnected networks system, called "FCP", is proposed. The main purpose of the FCP policy is to avoid the congestion of a network as well as to guarantee the performance of each network up to the desired value. In FCP policy, the traffic that arrives at aateway is restricted by that gateway in compliance with the acceptable rate, called "PAR", corresponding to its destination network. And the PAR corresponding to a network is determined based on the performance requirement of that network. The determination of PAR in FCP policy is presented and analyzed quantitatively in terms of network throughput, whereby the queuing models for a gateway and a network are developed. The result of the analytical evaluation of FCP policy is reduced to the problem of solving simultaneous non-linear equations with several variables and of a higher degree. Therefore, the systematic algorithm for computing PARs in FCP policy is also given. The numerical applications demonstrate the good efficiency of FCP policy to achieve the desired performance for each network.
KW - Algorithm
KW - Analytic Modelling
KW - Computer Communication Networks
KW - Congestion Control
KW - Gateways
KW - Interconnected Networks
KW - Performance Evaluation
KW - Throughput
UR - http://www.scopus.com/inward/record.url?scp=0022569303&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022569303&partnerID=8YFLogxK
U2 - 10.1016/0169-7552(86)90028-0
DO - 10.1016/0169-7552(86)90028-0
M3 - Article
AN - SCOPUS:0022569303
SN - 1389-1286
VL - 11
SP - 43
EP - 58
JO - Computer Networks
JF - Computer Networks
IS - 1
ER -