Research: Self-optimizing window flow control in high-speed data networks

Authors:
Ke-Qiang Liao;Lorne Mason
Affiliations:
Computer Science Department, University of Quebec at Hull, PO Box 1250, Succursale B, Hull, Quebec, Canada J8X 3X7;INRS-Telecommunications, 16, Place du Commerce, Ile-des-Soeurs, Verdun, Quebec, Canada H3E 1H6
Venue:
Computer Communications
Year:
1993

Citing 4
Cited 0

A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Dynamic adaptive windows for high speed data networks: theory and simulations

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Model-free distributed learning

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

The critical parameter in a window flow control scheme is the window size, which represents the maximum number of packets that can be in transit at a time. In this paper, we consider the problem of selecting the optimum window size in high-speed data networks. A self-optimizing method is proposed to adapt the window size to network conditions. The scheme employs a cross-correlation technique for process identification where the perturbation signal is random. Simulation results are presented for the isarithmic flow control to show the convergence rate and stability characteristics of the self-optimizing scheme.