Optimizing fragment sizes in frame relay networks

Multiplex communications – Diagnostic testing – Determination of communication parameters

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S412000, C370S468000

Reexamination Certificate

active

06990079

ABSTRACT:
Fragmentation of non-realtime data for transmission in frame relay networks is sized dynamically according to available bandwidth. The bandwidth is determined according to burst interval and burst size calculations based on parameters including the amount and type of realtime data to be sent and the percentage of burst interval utilized by the realtime data. If no realtime data is being sent, then the fragment sizes of the non-realtime data are adjusted to utilize the entire available bandwidth.

REFERENCES:
patent: 5303237 (1994-04-01), Bergman et al.
patent: 5448564 (1995-09-01), Thor
patent: 5490141 (1996-02-01), Lai et al.
patent: 5519640 (1996-05-01), Ganesan et al.
patent: 5781532 (1998-07-01), Watt
patent: 5812545 (1998-09-01), Liebowitz et al.
patent: 5883893 (1999-03-01), Rumer et al.
patent: 5936948 (1999-08-01), Sicher
patent: 6570849 (2003-05-01), Skemer et al.
Cut-Through Switch for Frame Relay Networks, IBM Technical Disclosure Bulletin, vol. 32, No. 9A, Feb. 1990, pp. 483-487.
On the Fly Bandwidth Reservation Control, IBM Disclosure Bulletin, vol. 40, No. 11, Nov. 1997, pp. 53-55.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Optimizing fragment sizes in frame relay networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing fragment sizes in frame relay networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing fragment sizes in frame relay networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3532571

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.