Performance analysis of a feedback congestion control policy under non-negligible propagation delay
- 1 August 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 21 (4) , 149-157
- https://doi.org/10.1145/115992.116007
Abstract
In this paper, we consider the performance of a node in a high speed network which is subject to a threshold type of feedback control policy. We obtain the loss probability and throughput at the node as a function of round-trip propagation delay and buffer size. These parameters are critical in high speed networks. We show that the simple feedback control policy is effective only when the ratio of propagation delay to job transmission time is not too large. Otherwise, a simple static “openIcmp” control policy, which does not rely on constant exchanges of state information, can perform better.Keywords
This publication has 3 references indexed in Scilit:
- A theoretical analysis of feedback flow controlACM SIGCOMM Computer Communication Review, 1990
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989
- The Single Server Queue with Periodic Arrival Process and Deterministic Service TimesIEEE Transactions on Communications, 1979