Browse Prior Art Database

Minimized/ Extending Delay Buffering Algorithm

IP.com Disclosure Number: IPCOM000107237D
Original Publication Date: 1992-Jan-01
Included in the Prior Art Database: 2005-Mar-21
Document File: 2 page(s) / 47K

Publishing Venue

IBM

Related People

Hall, RL: AUTHOR [+2]

Abstract

Previously, existing buffering algorithms sent the buffer either when it was full or after a single specified elapsed time. In applications where the arrival rate of events to buffer and/or the quantity of events to buffer vary greatly (e.g., single events, small bursts, large bursts) and response time is important, the previously existing buffering algorithms are not acceptable. Disclosed here is an algorithm that buffers events without significantly delaying a single event or small burst of events. There are three timer values used for this algorithm: . delay_minimum = the initial or minimum delay before the buffer is sent . delay_extension = the amount that the delay will be extended when an event arrived during the previous delay interval .

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 85% of the total text.

Minimized/ Extending Delay Buffering Algorithm

      Previously, existing buffering algorithms sent the buffer
either when it was full or after a single specified elapsed time.  In
applications where the arrival rate of events to buffer and/or the
quantity of events to buffer vary greatly (e.g., single events, small
bursts, large bursts) and response time is important, the previously
existing buffering algorithms are not acceptable.  Disclosed here is
an algorithm that buffers events without significantly delaying a
single event or small burst of events.
      There are three timer values used for this algorithm:
       .   delay_minimum = the initial or minimum delay before the
buffer is sent
       .   delay_extension = the amount that the delay will be
extended when an event arrived during the previous delay interval
       .   delay_maximum = the maximum delay before the buffer is
sent

      When an event arrives and is added to the buffer, a timer is
set for a delay interval of delay_minimum.  During the delay
interval, events are added to the buffer as they arrive.  After the
delay interval has expired, if an event was added to the buffer
during the delay interval, then the delay is extended by the
delay_extension amount.  This step is repeated until either the
buffer is full, a delay interval occurs where no events arrived to be
buffered, or the total delay has reached the delay maximum.  At this
point the buffer is sent.

 ...