Quasi-Static Window Flow Control for High Speed Data Networks
Original Publication Date: 1987-Jun-01
Included in the Prior Art Database: 2005-Feb-01
The present publication describes a proposed scheme wherein window sizes are designed to react only to the fluctuation of the number of virtual circuits (VCs), instead of the instantaneous traffic fluctuation. Hence, only moderate complexity is required in this scheme. Basically, without prior traffic information, every VC is treated equally and has the same window size, which is determined by the process described below. In a packet-switched data network, the key resources that are shared to provide efficient and cost-effective communications are the links and the communication controllers. If the sharing is not carefully controlled, undesirable situations, such as heavy congestions at intermediate nodes, store and forward buffer deadlocks, and unfairness of resource allocation, can occur.