A convergence algorithm for enhancing the performance of distributed applications running on sizeable networks.
Allan K. Y. Wong, Joseph H. C. Wong · PolyU Institutional Research Archive (Hong Kong Polytechnic University) · 2001
The proposed convergence algorithm is aimed at enhancing the performance of distributed applications running on sizeable networks exemplified by the Internet. The aim is achieved by quickly and accurately predicting the mean message response time of a communication channel with only end-to-end consideration. With the predicted mean the correct window size of the desired coverage of time-out tolerance for message transmission and response can be computed. The correct window size contributes to reduce excessive message retransmissions caused by time-outs. The proposed algorithm is particularly useful in helping time-critical distributed applications deliver their correct functions because prolonged delays in message response in these applications can lead to fatal errors. The discussion in this paper is focused mainly on the development of the convergence algorithm. Results from experiments have concluded that the proposed algorithm is indeed an effective solution for the stated aim. The simplicity of the algorithm is an advantage because it makes its implementation in real systems easy.