Method for the routing of a packet of data in a digital transmission network

• US 5,394,393 A
• Filed: 08/18/1992
• Issued: 02/28/1995
• Est. Priority Date: 09/06/1991
• Status: Expired due to Fees

• Current Assignee: Thomson-CSF
• Original Assignee: Thomson-CSF
• Inventors: Brisson, Jacques, Caillemer, Jean, Grenot, Thierry
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Nguyen, Chau T.
• Application Number:
  US07/931,708
• Time in Patent Office: 924 Days
• Field of Search: 370/94.1, 370/94.2, 370/60, 370/60.1, 370/94.3, 370/110.1, 370/58.1, 370/58.2, 370/58.3, 340/825.52
• US Class Current: 370/392
• CPC Class Codes: H04L 49/25 Routing or path finding in a switch fabric
• CPC Class Codes: H04L 49/3009 Header conversion, routing tables or routing tags
• CPC Class Codes: H04L 49/3081 ATM peripheral units, e.g. policing, insertion or extraction
• CPC Class Codes: H04L 49/309 Header conversion, routing tables or routing tags
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

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.

Claims

1. 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.

2. 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.

3. A method according to claim 1, wherein the word of the first memory part contains a validation bit.

4. 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.

5. A method according to claim 1, wherein the word of the first memory part contains bits carrying out a count of anomalies.

6. 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.