The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
A technique is described for the use of a round-trip queueing delay and a threshold for an adaptive window size control in virtual route flow control.
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
55% of the total text.
Page 1 of 2
Adaptive Adjustments Of Flow Control Windows
A technique is described for the use of a round-trip queueing delay and a
threshold for an adaptive window size control in virtual route flow control.
Flow rates in a computer communication network have to be
controlled to avoid overload. A mechanism to control the rate of
flow is to admit new messages only if the number of messages in
transit is below a certain threshold, e.g., K. This threshold is
also called a "window". It is assumed that the first message in a
group of K has a request-go- ahead indicator in its header. The
receiver will return a go-ahead message in response, if the go-ahead
arrives in the current window before sending of the K-th message,
communication continues uninterrupted with the K+1 of message.
However, if the go-ahead did not arrive before or during the sending
of the K-th message, the sender interrupts until the go-ahead
arrives. Selecting a good window size is difficult. A distributed
algorithm is described which will adapt the window size to its
optimal value. AB The following quantities are defined:
K(start): Window size of a virtual route which was idling for a
K(min) : Minimum value of the window size.
K(max) : Maximum value of the window size.
Tau : Round-trip queueing delay of the go-ahead-in
dicator. This delay is obtained by subtraction of the
total propagation time from the total round-trip time.
T : A time threshold used to distinguish between light and
heavy loads on the virtual route.
Delta : A time interval for an idle detect-routine.
ALGORITHM (1) When the network is brought up, all windows are set to their