Efficient hop by hop buffer class flow control schemes
Abstract
Design issues of hop-by-hop buffer class flow-control schemes are discussed. They are: (1) good window size for high-speed and large-propagation-delay environments and (2) the concept of congestion and access fairness. Schemes are proposed for buffer classification and window-size adjustment. A novel buffer classification, the path-based scheme, has the same fairness property but fewer classes than the route-based scheme. The window adjustment shceme, the quasistatic scheme, has similar or slightly worse performance to, but requires much less complexity than, dynamic schemes.
- Publication:
-
GLOBECOM 1987 - Global Telecommunications Conference
- Pub Date:
- 1987
- Bibcode:
- 1987gtc..conf..204C
- Keywords:
-
- Buffer Storage;
- Data Flow Analysis;
- Frequency Hopping;
- Multiple Access;
- Network Control;
- Communication Networks;
- Packet Switching;
- Pipelining (Computers);
- Protocol (Computers);
- Response Time (Computers);
- Waveguide Windows;
- Communications and Radar