"Least time to reach bound" service policy for buffer systems

Details "Least time to reach bound" service policy for buffer systems "Least time to reach bound" service policy for buffer systems

1991-02-15

1993-10-26

Olms, Douglas W.

Multiplex communications

Wide area network

Packet switching

370 61, 370 941, H04J 326

Patent

active

052572587

ABSTRACT:
This invention describes a method and apparatus for serving the buffers of a buffer system to avoid overflow of buffers. More specifically, this invention describes which buffers of the system should be first selected for servicing so as to avoid overflow. In addition, with this invention, the buffer size of each buffer in the system is independent of the number of links of the system.

REFERENCES:
patent: 4317195 (1982-02-01), Barberis et al.
patent: 4499576 (1985-02-01), Fraser
patent: 4700340 (1987-10-01), Beranek et al.
patent: 4839891 (1989-06-01), Kobayashi et al.
Mischa Schwartz, Telecommunication Network, 1987 pp. 47-52.
Telecommunication Networks: Protocols, Modeling and Analysis, Mischa Schwartz, pp. 40-43.

Affiliated with

Also associated with

Rating

"Least time to reach bound" service policy for buffer systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with "Least time to reach bound" service policy for buffer systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and "Least time to reach bound" service policy for buffer systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-964885