A New Counting Window Pacing Scheme
Original Publication Date: 1987-Aug-01
Included in the Prior Art Database: 2005-Feb-01
A new window pacing scheme, the Counting scheme, is presented. The new scheme maintains the property of (2W-1) buffer exposure, where W is the window size. The scheme works in a FIFO (first-in, first out) environment, like SNA, as well as an error-free but non-FIFO environment. In packet-switched networks, network resources, such as link bandwidth and buffers are shared by users. The sharing of resources provides cost- effective communications but also inherits potential hazards, such as congestion and deadlock. Hence, a network needs to have the flow control function to prevent undesirable situations and to efficiently utilize network resources. Flow controls in most networks use some form of window pacing.