Order preserving transmission of data streams

• US 5,430,710 A
• Filed: 08/14/1992
• Issued: 07/04/1995
• Est. Priority Date: 03/27/1992
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mueller, Lothar, Oechsle, Rainer, Truong, Hong L.
• Primary Examiner(s): Hsu, Alpus
• Application Number:
  US07/929,225
• Time in Patent Office: 1,054 Days
• Field of Search: 370/16, 370/54, 370/58.1, 370/60, 370/60.1, 370/61, 370/85.1, 370/85.6, 370/85.9, 370/94.1, 371/8.1, 371/8.2, 371/11.1, 371/32, 340/825.01, 340/825.03, 340/826, 340/827, 379/220, 379/221, 379/272, 379/273, 379/279
• US Class Current: 370/409
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/34 Signalling channels for network management communication
• CPC Class Codes: H04L 45/245 Link aggregation, e.g. trunking
• CPC Class Codes: H04L 47/34 ensuring sequence integrity, e.g. using sequence numbers
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: Y02D 30/50 in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

Described are methods which preserve the order of the data frames within a data stream if the data stream is switched from one link to another. The first method achieves the order preservation by numbered switch frames that have to be exchanged between the nodes before the link switching is actually performed. In the second method, the switching is only prepared by exchanging special frames which indicate "clean" links. Actual switching takes place by just using an already prepared, i.e., "clean" link.

Claims

1. Method for link switching when transmitting a data stream between two nodes (1 and 2, 11 and 12) of a network such that the order within the data stream is preserved, said two nodes being connected by at least two parallel links (link 1 . . . link n) , of which only one is currently active, the method comprising the steps of:

a. generating a switch request in the sending node (sender 1,

     11);

b. attaching a sequence number to said switch request;

c. transmitting said switch request with its sequence number from the sending node to the receiving node (receiver 2,

     12) over at least one currently inactive link,

d. determining, in the receiving node (2,

     12), whether a received switch request carries a higher sequence number than a switch request received before and is thus acceptable,

e. if so, sending to the sending node (1,

     11) over said currently inactive link a switch response with the sequence number of said received switch request;

f. determining, in the sending node (1,

     11), when receiving a switch response, whether its sequence number matches the sequence number sent with the last switch request and is thus acceptable; and

g. depending on the result of the determining step f, activating an inactive link to transmit the data stream from the sending node to the receiving node.

2. Method according to claim 1, wherein

the receiver (2) switches to said currently inactive link upon determining that a received (switch) request is acceptable, and

the sender (1) switches to said currently inactive link upon determining that a received response is acceptable,

thus effectively switching the data transmission to said currently inactive link.

3. Method according to claim 2, wherein the sending node (1) continues sending data over the currently active link until the sending node receives the switching response and switches to the currently inactive link.

4. Method according to claim 2, wherein the sending node (1), upon sending the request over the currently inactive link, suspends sending data and, upon receiving an acceptable response, resumes sending data over the so far inactive link.

5. Method for link switching when transmitting a data stream between two nodes (1 and 2, 11 and 12) of a network such that the order within the data stream is preserved, said two nodes being connected by at least two parallel links (link 1 . . . link n), of which only one is currently active, the method comprising the steps of:

a. generating a sweep request in the sending node (sender 1,

     11);

b. attaching a sequence number to said sweep request;

c. transmitting said sweep request with its sequence number from the sending node to the receiving node (receiver 2,

     12) over at least one currently inactive link,

d. determining, in the receiving node (2,

     12), whether a received sweep request carries a higher sequence number than a sweep request received before and is thus acceptable,

e. if so, sending to the sending node (1,

     11) over said currently inactive link a sweep response with the sequence number of said received sweep request;

f. determining, in the sending node (1,

     11), when receiving a sweep response, whether its sequence number matches the sequence number sent with the last sweep request and is thus acceptable; and

g. depending on the result of the determining step f, activating an inactive link to transmit the data stream from the sending node to the receiving node.

6. Method according to claim 5, wherein

receipt of an acceptable request over a currently inactive link by the receiver (12) indicates to the receiver that this particular link is "clean",

receipt of an acceptable response over a currently inactive link by the sending node (11) indicates to the sending node that this particular link is "clean",

the sending node (11) effectively switches data stream transmission to any one of the inactive links at any time after the sending node has identified this particular link as "clean" and,

upon receiving data from a "clean", inactive link, the receiver (12) effectively switches data stream reception to said inactive link,

upon establishing data stream transmission over said inactive link, indicating to the sender and to the receiver that all other links are no more "clean".

7. Method according to claim 6, wherein

requests and responses (FIG. 3) carrying the same sequence number are exchanged over a plurality of currently inactive links, and

each acceptable request/response pair is taken as indicator that the particular link over which it was exchanged is "clean".

8. Method according to claim 7, wherein

transmission of data is switched by the sender randomly to any one of said "clean", inactive links.