← Back to Patent Explorer
US4829227A Expired / Lapsed US ⏱️ 0.0 years remaining

High speed data link

Assignee: Washington University in St. Louis
•
Filing: 1987-12-30
•
Granted: 1989-05-09
•
Expires: 2007-12-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A high bit rate data link is disclosed. The high bit rate data link comprises a group of individual low bit rate data links. A memory stores the addresses of all the low bit rate data links in the group. The memory is indexed by packets including an identification number for the group. The addresses of the low bit rate links are successively written into packets containing the group identification number so that these packets are evenly distributed to the low bit rate links comprising the group.

Inventors

  • 👤 Jonathan S. Turner

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 12:37
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/50; H04L49/505; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/1854; H04L49/10; H04L49/104; H04L49/105; H04L49/106; H04L49/15; H04L49/1553; H04L49/1561; H04L49/20; H04L49/201; H04L49/203; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5638; H04L2012/5646; H04L2012/5652; H04L49/1507; H04L49/25; H04L49/253; H04L49/254; H04L49/30; H04L49/35; H04L49/356; H04L49/357; H04L49/55; H04L49/557

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 100 words
An apparatus including a high bit rate data link comprising: a group of individual low bit rate data links, means for providing a plurality of data packets having an identification number for said group of low bit rate data links, and memory means for storing the addresses of all of said low bit rate data links in said group, said memory means being indexed by said data packets, said memory means serving to write the address of one of said links into each of said packets to evenly distribute said packets among said low bit rate links in said group.
Claim 2
Independent Claim 100 words
An apparatus including a high bit rate data link comprising: a group of individual low bit rate data links, means for providing a plurality of data packets having an identification number for said group of low bit rate data links, and memory means for storing the addresses of all of said low bit rate data links in said group, said memory means being indexed by said data packets, said memory means serving to write the address of one of said links into each of said packets to evenly distribute said packets among said low bit rate links in said group.
Claim 3
Dependent Claim 21 words
The high bit rate data link of claim 1 wherein said individual low bit rate data links are optical fiber links.
Claim 4
Independent Claim 89 words
A method for routing data packets in a packet switch network comprising the steps of: providing a plurality of data packets having an identification number for a group of low bit rate data links, utilizing said identification number in each said packets to index a memory storing an address for each of said low bit rate data links in said group, and writing one of said stored addresses into each of said packets containing said identification number to evenly distribute said packets among said low bit rate data links.
Claim 5
Independent Claim 89 words
A method for routing data packets in a packet switch network comprising the steps of: providing a plurality of data packets having an identification number for a group of low bit rate data links, utilizing said identification number in each said packets to index a memory storing an address for each of said low bit rate data links in said group, and writing one of said stored addresses into each of said packets containing said identification number to evenly distribute said packets among said low bit rate data links.
Claim 6
Independent Claim 80 words
A method for routing data packets in a packet switch network comprising the steps of providing a plurality of data packets having an identification number for a group of low bit rate data links and utilizing said identification number in each of said packets to write an address of one of said low bit rate links into each of said packets containing said identification number to evenly distribute said packets containing said identification number among said low bit rate links.
Claim 7
Independent Claim 80 words
A method for routing data packets in a packet switch network comprising the steps of providing a plurality of data packets having an identification number for a group of low bit rate data links and utilizing said identification number in each of said packets to write an address of one of said low bit rate links into each of said packets containing said identification number to evenly distribute said packets containing said identification number among said low bit rate links.

References Cited (Backward Citations)

US4520429A Cited
US4621359A Cited
US4641302A Cited
US4703475A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-05-08 1992-11-07 1993-05-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-05-08 1996-11-07 1997-05-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-05-08 2000-11-07 2001-05-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag