Patent US5579307A successfully refreshed from Google Patents.
US5579307A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet routing system and method with quasi-real-time control
Assignee: CDC Propriete Intellectuelle
•
Filing: 1995-03-23
•
Granted: 1996-11-26
•
Expires: 2015-03-23
Abstract
Abstract In a system that includes a constellation of satellite communication nodes, information packets are routed through the constellation using routing tables stored in each communication node. When a packet is received at a node, the packet's destination and routing table ID are read. One of several routing tables are selected using a mapping table. Each of the several routing tables has a different routing instruction set. The packet is routed away from the node using the selected routing table. When system traffic is heavy, or some of the communication links are overloaded or have failed, routing table control bits are sent to the nodes updating the mapping table. Packets are subsequently routed using different sets of routing tables, such as ones having greater hop counts.
Inventors
- 👤 Peter J. Richetta
- 👤 Kenneth M. Peterson
- 👤 Victor H. Cutler, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 09:16
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04B; H04B7/00; H04B7/14; H04B7/15; H04B7/185; H04B7/1853; H04B7/18558; H04B7/1856; H04L45/12; H04L45/122; H04L45/20; H04W; H04W40/00; H04W40/34; H04W40/38
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
191 words
A method of routing data packets among nodes of a communication system, said nodes coupled to each other by links wherein each of said nodes have a plurality of routing tables stored therein and a mapping table stored therein, said mapping table referring to one of said plurality of routing tables for each of a plurality of routing table identifiers, said method comprising the steps of: receiving mapping table control bits at one of said nodes; updating said mapping table using said mapping table control bits, the updating step causing said mapping table to reference other routing tables for each of said routing table identifiers; receiving a data packet at said one of said nodes, said data packet including one of said routing table identifiers; reading a destination routing code and said routing table identifier from said data packet; identifying one routing table of said plurality of routing tables by indexing said mapping table using said routing table identifier; indexing said one routing table based on said destination routing code to determine an exit link; and routing said data packet away from said one of said nodes over said exit link.
Claim 2
Independent Claim
191 words
A method of routing data packets among nodes of a communication system, said nodes coupled to each other by links wherein each of said nodes have a plurality of routing tables stored therein and a mapping table stored therein, said mapping table referring to one of said plurality of routing tables for each of a plurality of routing table identifiers, said method comprising the steps of: receiving mapping table control bits at one of said nodes; updating said mapping table using said mapping table control bits, the updating step causing said mapping table to reference other routing tables for each of said routing table identifiers; receiving a data packet at said one of said nodes, said data packet including one of said routing table identifiers; reading a destination routing code and said routing table identifier from said data packet; identifying one routing table of said plurality of routing tables by indexing said mapping table using said routing table identifier; indexing said one routing table based on said destination routing code to determine an exit link; and routing said data packet away from said one of said nodes over said exit link.
Claim 3
Dependent Claim
42 words
A method as claimed in claim 1 further comprising the step of assigning to each of said data packets, one routing table identifier by a source node wherein said routing table identifiers assigned in the assigning step exhibit a substantially randomly distribution.
Claim 4
Dependent Claim
46 words
A method as claimed in claim 1 wherein each of said data packets has a header, and wherein said routing table identifier includes least significant bits (LSB's) of said header, and wherein the step of reading includes the step of reading said LSB's of said header.
Claim 5
Dependent Claim
31 words
A method as claimed in claim 3 wherein said header includes a logical channel number (LCN) and wherein the step of reading includes the step of reading LSB's of said LCN.
Claim 6
Dependent Claim
80 words
A method as claimed in claim 1 further comprising the steps of: generating said mapping table control bits for a heavy traffic load situation; and transmitting said mapping table control bits to each of said nodes when said heavy traffic load situation occurs, and wherein the updating step includes the step of updating said mapping table using said mapping table control bits causing said mapping table to reference each of said routing tables for each of said routing table identifiers.
Claim 7
Dependent Claim
201 words
A communication system that routes data packets comprising: a plurality of nodes, each node of said plurality having a memory for storing a plurality of routing tables and a mapping table therein, said mapping table referring to one of said plurality of routing tables for each of a plurality of routing table identifiers; communication links coupling said nodes; a first transceiver associated with each of said nodes for receiving mapping table control bits; a processor associated with each of said nodes with means for updating said mapping table using said mapping table control bits, the processor causing said mapping table to reference other routing tables for each of said routing table identifiers; and a second transceiver associated with each of said nodes for reading a destination routing code and said routing table identifier from said data packets, wherein said processor has means for identifying one routing table of said plurality of routing tables by indexing said mapping table using said routing table identifier and said destination routing code to determine an exit link, said exit link being one of said communication links, and wherein said second transceiver routes said data packets away from one of said nodes over said exit link.
Claim 8
Dependent Claim
201 words
A communication system that routes data packets comprising: a plurality of nodes, each node of said plurality having a memory for storing a plurality of routing tables and a mapping table therein, said mapping table referring to one of said plurality of routing tables for each of a plurality of routing table identifiers; communication links coupling said nodes; a first transceiver associated with each of said nodes for receiving mapping table control bits; a processor associated with each of said nodes with means for updating said mapping table using said mapping table control bits, the processor causing said mapping table to reference other routing tables for each of said routing table identifiers; and a second transceiver associated with each of said nodes for reading a destination routing code and said routing table identifier from said data packets, wherein said processor has means for identifying one routing table of said plurality of routing tables by indexing said mapping table using said routing table identifier and said destination routing code to determine an exit link, said exit link being one of said communication links, and wherein said second transceiver routes said data packets away from one of said nodes over said exit link.
Claim 9
Dependent Claim
38 words
A communication system as claimed in claim 6 wherein said processor includes means for assigning each of said data packets said routing table identifier by a source node wherein said routing table identifiers exhibit a substantially randomly distribution.
Claim 10
Dependent Claim
44 words
A communication system as claimed in claim 6 wherein each of said data packets has a header, and wherein said routing table identifier includes least significant bits (LSB's) of said header, and wherein the transceiver includes means for reading said LSB's of said header.
Claim 11
Dependent Claim
31 words
A communication system as claimed in claim 8 wherein said header includes a logical channel number (LCN) and wherein the means for reading includes means for reading LSB's of said LCN.
Claim 12
Dependent Claim
87 words
A communication system as claimed in claim 6 further comprising a control facility that includes: means for generating said mapping table control bits for a heavy traffic load situation; and means for transmitting said mapping table control bits to each of said nodes when said heavy traffic load situation occurs, and wherein the means for updating includes means for updating said mapping table using said mapping table control bits causing said mapping table to reference each of said routing tables for each of said routing table identifiers.
Claim 13
Independent Claim
171 words
A method of routing data packets among nodes of a communication system, each of said nodes having a mapping table and a plurality of routing tables stored therein, said method comprising the steps of: receiving mapping table control bits at one of said nodes, said mapping table control bits causing said mapping table to reference particular routing tables of said plurality of routing tables for a plurality of routing table identifiers; updating said mapping tables using said mapping table control bits, the updating step causing said mapping tables to reference other routing tables for each of said routing table identifiers; reading a destination routing code and one of said routing table identifiers from a data packet; identifying one routing table of said plurality of routing tables by indexing said mapping table using said one of said routing table identifiers; identifying an exit link by indexing said one routing table based on said destination routing code; and routing said data packet away from said one of said nodes over said exit link.
Claim 14
Independent Claim
171 words
A method of routing data packets among nodes of a communication system, each of said nodes having a mapping table and a plurality of routing tables stored therein, said method comprising the steps of: receiving mapping table control bits at one of said nodes, said mapping table control bits causing said mapping table to reference particular routing tables of said plurality of routing tables for a plurality of routing table identifiers; updating said mapping tables using said mapping table control bits, the updating step causing said mapping tables to reference other routing tables for each of said routing table identifiers; reading a destination routing code and one of said routing table identifiers from a data packet; identifying one routing table of said plurality of routing tables by indexing said mapping table using said one of said routing table identifiers; identifying an exit link by indexing said one routing table based on said destination routing code; and routing said data packet away from said one of said nodes over said exit link.
References Cited (Backward Citations)
US4756019A
Cited
US4905233A
Cited
US4974224A
Cited
US5218676A
Cited
US5253161A
Cited
US5128926A
Cited
US5377262A
Cited
US5440547A
Cited
US5353283A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-11-26 | 2000-05-27 | 2000-11-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-11-26 | 2004-05-27 | 2004-11-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-11-26 | 2008-05-27 | 2008-11-26 | $7700.00 | Window Closed / Lapsed |