US5394393A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for the routing of a packet of data in a digital transmission network
Assignee: Thales SA
•
Filing: 1992-08-18
•
Granted: 1995-02-28
•
Expires: 2012-08-18
Abstract
Abstract A method for the routing of a packet of data in a digital transmission network where each packet is formed by a header, enabling this packet to be identified and guided, and a part containing information elements to be conveyed. This method consists, at each node of the network, of a first step for extracting, from the header, the address of a word of a memory containing the information elements needed to identify the header and to guide the data elements conveyed by the packet coming into the node and a second step for creating, according to the header of the incoming packet and the information elements contained in the word of the memory, a new address designating a memory zone containing at least one new header and the information on the outgoing direction of the packet or packets coming out of the node. The method can be applied to digital transmission networks where it is necessary to identify and route packets of data.
Inventors
- 👤 Jacques Brisson
- 👤 Jean Caillemer
- 👤 Thierry Grenot
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 18:14
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/30; H04L49/3081; H04L49/309; H04L49/3009; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L49/25
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
271 words
A method for the routing of a packet of data in a digital transmission network comprising a plurality of nodes which each have a memory, said packet, in transit through virtual channels that are themselves contained in virtual paths, being formed by a header containing at least the identification numbers of the virtual paths and of the virtual channels that it takes, and by a part containing information elements to be conveyed wherein, at one of said nodes of the network and for said packet coming into said one node, said method comprises, in a first step, in designating a word of a first part of said memory containing at least one portion of an address of a second part of said memory, wherein an address of said designated word contains at least an identification number of a path in which said packet of data entering said one node is in transit; in a second step, in designating at least one zone of said second part of said memory containing at least one new header and information indicating a direction taken by said packet going out of said one node, wherein an address of said designated zone of said second part is a sum of an identification number of a channel taken by said packet coming into said one node and of said at least one portion of said address of said second part of said memory; and switching said packet from said one node to a second node of said network depending on said information indicating a direction contained in said designated zone of said second part of said memory.
Claim 2
Independent Claim
271 words
A method for the routing of a packet of data in a digital transmission network comprising a plurality of nodes which each have a memory, said packet, in transit through virtual channels that are themselves contained in virtual paths, being formed by a header containing at least the identification numbers of the virtual paths and of the virtual channels that it takes, and by a part containing information elements to be conveyed wherein, at one of said nodes of the network and for said packet coming into said one node, said method comprises, in a first step, in designating a word of a first part of said memory containing at least one portion of an address of a second part of said memory, wherein an address of said designated word contains at least an identification number of a path in which said packet of data entering said one node is in transit; in a second step, in designating at least one zone of said second part of said memory containing at least one new header and information indicating a direction taken by said packet going out of said one node, wherein an address of said designated zone of said second part is a sum of an identification number of a channel taken by said packet coming into said one node and of said at least one portion of said address of said second part of said memory; and switching said packet from said one node to a second node of said network depending on said information indicating a direction contained in said designated zone of said second part of said memory.
Claim 3
Dependent Claim
46 words
A method according to claim 1, wherein the word of the first memory part contains at least one information element defining a number of useful bits to encode the identification number of a channel taken by said packet coming into said one node of the network.
Claim 4
Dependent Claim
18 words
A method according to claim 1, wherein the word of the first memory part contains a validation bit.
Claim 5
Dependent Claim
35 words
A method according to claim 1, wherein the word of the first memory part contains a bit indicating whether it is a path switching or a channel switching that takes place at said one node.
Claim 6
Dependent Claim
22 words
A method according to claim 1, wherein the word of the first memory part contains bits carrying out a count of anomalies.
Claim 7
Dependent Claim
87 words
A method according to claim 1, wherein said at least one portion of said address of said second part of said memory comprises a sequence of least significant bits having a value of 0, wherein the number of said bits of said sequence is greater than or equal to the number of useful bits encoding the identification number of the channel of said packet coming into said one node, the useful bits of the identification number being encoded from a value greater than or equal to 0.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-02-27 | 1998-08-29 | 1999-02-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-02-27 | 2002-08-29 | 2003-02-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-02-27 | 2006-08-29 | 2007-02-28 | $7700.00 | Window Closed / Lapsed |