Packet transfer control arrangement and related method

• US 5,404,352 A
• Filed: 10/14/1992
• Issued: 04/04/1995
• Est. Priority Date: 10/15/1991
• Status: Expired due to Fees

• Current Assignee: Alcatel NV (Nokia Corporation)
• Original Assignee: Alcatel NV (Nokia Corporation)
• Inventors: Verhille, Henri A. J., Pauwels, Bart J. G.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Nguyen, Chau T.
• Application Number:
  US07/961,580
• Time in Patent Office: 902 Days
• Field of Search: 370/94.1, 370/60, 370/60.1, 370/58.1, 370/58.2, 370/13, 370/17, 370/16, 370/14, 340/825.52, 340/825.8, 340/826, 340/825.03
• US Class Current: 370/390
• CPC Class Codes: H04L 2012/5627 Fault tolerance and recovery
• CPC Class Codes: H04L 49/1523 Parallel switch fabric planes
• CPC Class Codes: H04L 49/153 ATM switching fabrics having parallel switch planes
• CPC Class Codes: H04L 49/1553 Interconnection of ATM switching modules, e.g. ATM switching fabrics
• CPC Class Codes: H04L 49/208 Port mirroring
• CPC Class Codes: H04L 49/3009 Header conversion, routing tables or routing tags
• CPC Class Codes: H04L 49/552 by ensuring the integrity of packets received through redundant connections

Abstract

The packet transfer control arrangement ensures that an information packet transferred from an input to an output of a packet switching network is available in correct form at that output. It includes copying means (SE11/SEmn) located at the input of the network to make copies of the packet to be transferred, routing means (HA11/HAmn; SE11/SEmn) to transfer these copies independently from each other and possibly over at least partly distinct paths from an input to an output of the network and filtering modules (F11/Fmn) to filter out one of the copies at the output of the network.

Claims

1. Packet transfer control arrangement to ensure that an information packet transferred from an input to an output of a packet switching network is available in correct form at said output, said arrangement comprising:

copying means at said input for making at least one complete copy of said information packet in order to obtain at least two complete specimens thereof, each of said complete specimens comprising either a complete original said information packet or a complete copy of said information packet;

transfer means for transferring said at least two complete specimens independently from each other over said packet switching network towards said output, each independently transferred complete specimen being subject to possible loss or corruption as it is being transferred over said packet switching network; and

filtering means at said output for receiving the complete specimens transferred by the transfer means and for filtering out a received one of said complete specimens and applying said received one complete specimen to said output and for discarding any received other complete specimens of the same said information packet, said filtering means further comprising;

a plurality of memory locations,

selection means for determining if each complete specimen received at said output has been corrupted and for registering the receipt of a first non-corrupted one of said at least two complete specimens at a selected one of said memory locations and for discarding any other corrupted or non-corrupted said complete specimens of the same said information packet that have also been received at said output, and

clearing means for clearing said selected location after a predetermined time interval starting at the receipt of a first one of said at least two complete specimens, thereby making said selected location again available.

2. Packet transfer control arrangement according to claim 1, further comprising routing means associated with said copying means for including different routing information in each of said complete specimens which is used by said transfer means to route said complete specimens through said switching network over at least partly separate paths.

3. Packet transfer control arrangement according to claim 2, wherein

said packet switching network includes switching nodes, and

said routing means determines said routing information based on routing tables included in said switching notes.

4. Packet transfer control arrangement according to claim 1, wherein each of said at least two complete specimens includes a packet identifier and a connection identifier indicative of the communication to which said packet belongs, said packet identifier together with said connection identifier determining said selected location.

5. Packet transfer control arrangement according to claim 4, wherein

the value of said packet identifier wraps around at a predetermined maximum value, and

the instant of said wrap around determines said selected memory module.

6. Method for ensuring that an information packet transferred from an input to an output of a packet switching network is available in correct form at said output, said method comprising, for each packet to be protected, the steps of:

making at least one complete copy of said packet in order to obtain at least two complete specimens thereof, each of said complete specimens comprising either a complete original said information packet or a complete copy of said information packet;

transferring said complete specimens over said network to said output;

determining if each complete specimen received at said output has been corrupted;

registering the receipt of a first non-corrupted one of said at least two complete specimens at a selected memory location;

discarding any other corrupted or non-corrupted said complete specimens of the same said information packet that have also been received at said output; and

clearing said selected memory location after a predetermined time interval starting at the receipt of a first one of said at least two complete specimens, thereby making said selected memory location again available.

7. Method according to claim 6, wherein said complete specimens are transferred over said network in such a way that they follow paths which are at least partly separate.