Patent EP0191582A1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US5600629A Expired / Lapsed US ⏱️ 0.0 years remaining

Inter-satellite method for routing packets

Assignee: CDC Propriete Intellectuelle
•
Filing: 1995-09-08
•
Granted: 1997-02-04
•
Expires: 2015-09-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method routes data packets between nodes in a satellite-based communication system based on header information contained in each of the packets. The header information which contains routing and overhead information indicates whether the packet header has been received without any errors and whether the payload is to be read and processed by the node currently servicing the packet or passed on to another adjacent node. This method works in systems that have packet delays or transmission impairments, such as satellite-based telecommunication systems.

Inventors

  • 👤 Gerry Van Daele
  • 👤 Kenneth W. Hines
  • 👤 Bradley T. Sanders
  • 👤 Donald J. Sabourin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 20:55
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04B; H04B7/00; H04B7/14; H04B7/15; H04B7/185; H04B7/1853; H04B7/18558; H04B7/1856; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5603; H04L2012/5604; H04L2012/5608

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 165 words
A method executed by each of a plurality of nodes for routing a packet from an origination node to a destination node through the nodes, the nodes being connected together, the packet including a header, the header including a destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) discarding the packet if the destination ID indicates a null packet or an end-of-burst packet; (c) forwarding the packet from a current node to a next adjacent node according to the destination ID and the routing cue table if the packet is not destined for the current node and the header of the packet is valid as determined in step (a) and the packet is not discarded in step (b); and (d) repeating steps (a), (b) and (c) until the packet arrives at the destination node or the packet is discarded in step (b).
Claim 2
Independent Claim 165 words
A method executed by each of a plurality of nodes for routing a packet from an origination node to a destination node through the nodes, the nodes being connected together, the packet including a header, the header including a destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) discarding the packet if the destination ID indicates a null packet or an end-of-burst packet; (c) forwarding the packet from a current node to a next adjacent node according to the destination ID and the routing cue table if the packet is not destined for the current node and the header of the packet is valid as determined in step (a) and the packet is not discarded in step (b); and (d) repeating steps (a), (b) and (c) until the packet arrives at the destination node or the packet is discarded in step (b).
Claim 3
Dependent Claim 22 words
A method as recited in claim 1, wherein step (a) comprises the step of discarding the packet if the header is invalid.
Claim 4
Dependent Claim 51 words
A method as recited in claim 2, wherein the header includes a relay count, and wherein step (b) comprises the steps of: (b1) decrementing the relay count; (b2) comparing the relay count to a predetermined value; and (b3) discarding the packet if the relay count is equal to the predetermined value.
Claim 5
Dependent Claim 51 words
A method as recited in claim 2, wherein the header includes a relay count, and wherein step (b) comprises the steps of: (b1) incrementing the relay count; (b2) comparing the relay count to a predetermined value; and (b3) discarding the packet if the relay count is equal to the predetermined value.
Claim 6
Dependent Claim 48 words
A method as recited in claim 2, wherein step (b) comprises the steps of: (b1) discarding the packet if the destination ID indicates a null packet or an end-of-burst packet; and (b2) determining whether the destination ID matches a current node ID of the node reading the header.
Claim 7
Dependent Claim 78 words
A method as recited in claim 2, wherein step (b) comprises the steps of: (b1) reading the destination ID included in the packet; (b2) determining whether the current node matches the destination ID; (b3) identifying from the routing cue table which adjacent node to send the packet to based on the destination ID and if the current node does not match the destination ID; and (b4) forwarding the packet to the next adjacent node identified in step (b3).
Claim 8
Dependent Claim 55 words
A method as recited in claim 2, wherein the header includes a logical channel number, and wherein step (b) comprises the steps of: (b1) reading the logical channel number to identify which traffic channel is connected to the destination ID; and (b2) forwarding the packet to the traffic channel identified by the logical channel number.
Claim 9
Dependent Claim 58 words
A method as recited in claim 1, wherein the packet includes header error check information, and wherein step (a) comprises the steps of: (a1) determining whether the header of the packet has an uncorrectable error based on the header error check information; and (a2) discarding the packet if there is an uncorrectable header error found in step (a1).
Claim 10
Independent Claim 210 words
A method executed by each of a plurality of nodes for routing packets from an origination node to a destination node through the nodes, the nodes being connected together, each of the packets including a header, each of the nodes storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) reading a destination ID included in the packet; (c) discarding the packet if the header is invalid as found in step (a) or the destination ID indicates a null packet or an end-of-burst packet; (d) determining whether a current node matches the destination ID if the packet was not discarded in step (C), the current node being the node reading the header; (e) identifying from the routing cue table which adjacent node to send the packet to based on the destination ID and if the current node does not match the destination ID and the packet was not discarded in step (c); (f) forwarding the packet to the adjacent node identified in step (e) if the packet was not discarded in step (c); and (g) repeating steps (a)-(f) until the packet arrives at the destination node or the packet is discarded in step (c).
Claim 11
Independent Claim 210 words
A method executed by each of a plurality of nodes for routing packets from an origination node to a destination node through the nodes, the nodes being connected together, each of the packets including a header, each of the nodes storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) reading a destination ID included in the packet; (c) discarding the packet if the header is invalid as found in step (a) or the destination ID indicates a null packet or an end-of-burst packet; (d) determining whether a current node matches the destination ID if the packet was not discarded in step (C), the current node being the node reading the header; (e) identifying from the routing cue table which adjacent node to send the packet to based on the destination ID and if the current node does not match the destination ID and the packet was not discarded in step (c); (f) forwarding the packet to the adjacent node identified in step (e) if the packet was not discarded in step (c); and (g) repeating steps (a)-(f) until the packet arrives at the destination node or the packet is discarded in step (c).
Claim 12
Independent Claim 230 words
A method executed by each of a plurality of nodes for routing packets from an origination node to a destination node through the nodes, the nodes being connected together, each of the packets including a header and a payload, each of the headers including a relay count, payload type, header error check and destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) discarding the packet if the header error check is not equal to a calculated error check of the header; (b) discarding the packet if the destination ID indicates a null packet or an end-of-burst packet; (c) determining whether a current node matches the destination ID if the packet is neither the null packet nor the end-of-burst packet; (d) reading the payload type to determine where the packet is to be routed if the current node matches the destination ID; (e) identifying from the routing cue table which node to send the packet to based on the destination ID if the current node does not match the destination ID; (f) adjusting the relay count; (g) discarding the packet if the relay count is equal to a predetermined value; (h) forwarding the packet if the packet is not discarded in (g) to the node identified in step (e); and (i) repeating steps (a)-(h) until the packet arrives at the destination node.
Claim 13
Independent Claim 230 words
A method executed by each of a plurality of nodes for routing packets from an origination node to a destination node through the nodes, the nodes being connected together, each of the packets including a header and a payload, each of the headers including a relay count, payload type, header error check and destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) discarding the packet if the header error check is not equal to a calculated error check of the header; (b) discarding the packet if the destination ID indicates a null packet or an end-of-burst packet; (c) determining whether a current node matches the destination ID if the packet is neither the null packet nor the end-of-burst packet; (d) reading the payload type to determine where the packet is to be routed if the current node matches the destination ID; (e) identifying from the routing cue table which node to send the packet to based on the destination ID if the current node does not match the destination ID; (f) adjusting the relay count; (g) discarding the packet if the relay count is equal to a predetermined value; (h) forwarding the packet if the packet is not discarded in (g) to the node identified in step (e); and (i) repeating steps (a)-(h) until the packet arrives at the destination node.
Claim 14
Independent Claim 152 words
A method executed by each of a plurality of satellites for routing a packet from an origination satellite to a destination satellite through the satellites, the packet including a header, the header including a destination ID, each of the satellites storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) discarding the packet if the header is invalid, or the destination ID indicates a null packet or an end-of-burst packet; (c) forwarding the packet from a current satellite to a next adjacent satellite according to the destination ID and the routing cue table if the packet is not destined for the current satellite and the packet is not discarded in step (b); and (d) repeating steps (a), (b) and (c) until the packet arrives at the destination satellite or the packet is discarded in step (b).
Claim 15
Independent Claim 152 words
A method executed by each of a plurality of satellites for routing a packet from an origination satellite to a destination satellite through the satellites, the packet including a header, the header including a destination ID, each of the satellites storing a routing cue table, the method comprising the steps of: (a) checking for errors in the header to determine whether the header is valid; (b) discarding the packet if the header is invalid, or the destination ID indicates a null packet or an end-of-burst packet; (c) forwarding the packet from a current satellite to a next adjacent satellite according to the destination ID and the routing cue table if the packet is not destined for the current satellite and the packet is not discarded in step (b); and (d) repeating steps (a), (b) and (c) until the packet arrives at the destination satellite or the packet is discarded in step (b).
Claim 16
Independent Claim 199 words
A method executed by each of a plurality of nodes for routing groups of packets from an origination node to a destination node through the nodes, each of a number of packets in a group of packets including a header, the header including a destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) receiving a group of packets in a burst transmission; (b) checking for errors in the header of each packet in the group to determine whether the header is valid; (c) discarding any of the packets if the header is invalid, or the destination ID indicates a null packet or an end-of-burst packet; (d) burst transmitting the group of packets from a current node to a next adjacent node according to the destination ID and the routing cue table, if the packet is not destined for the current node, the packet is not discarded in step (c) and the packet is going to a same next adjacent node; and (e) repeating steps (a) through (d) until the group of packets arrive at the destination node or a packet in the group of packets is discarded in step (c).
Claim 17
Independent Claim 199 words
A method executed by each of a plurality of nodes for routing groups of packets from an origination node to a destination node through the nodes, each of a number of packets in a group of packets including a header, the header including a destination ID, each of the nodes storing a routing cue table, the method comprising the steps of: (a) receiving a group of packets in a burst transmission; (b) checking for errors in the header of each packet in the group to determine whether the header is valid; (c) discarding any of the packets if the header is invalid, or the destination ID indicates a null packet or an end-of-burst packet; (d) burst transmitting the group of packets from a current node to a next adjacent node according to the destination ID and the routing cue table, if the packet is not destined for the current node, the packet is not discarded in step (c) and the packet is going to a same next adjacent node; and (e) repeating steps (a) through (d) until the group of packets arrive at the destination node or a packet in the group of packets is discarded in step (c).

References Cited (Backward Citations)

US4740954A Cited
US4769811A Cited
US4875208A Cited
US4939725A Cited
US5105424A Cited
US5119369A Cited
US4939726A Cited
US5229992A Cited
US5216670A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-02-04 2000-08-05 2001-02-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-02-04 2004-08-05 2005-02-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-02-04 2008-08-05 2009-02-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag