Distributed digital data communications network

• US 4,399,531 A
• Filed: 09/29/1980
• Issued: 08/16/1983
• Est. Priority Date: 09/29/1980
• Status: Expired due to Term

• Current Assignee: Rockwell International Corporation
• Original Assignee: Rockwell International Corporation
• Inventors: Grande, Johannes, Bittel, Raymond
• Primary Examiner(s): Olms, Douglas W.
• Application Number:
  US06/191,969
• Time in Patent Office: 1,051 Days
• Field of Search: 370/60, 370/61, 370/94, 370/54, 370/16, 340/825.02, 340/825.03, 340/825.04
• US Class Current: 370/216
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/32 Flooding denial of service attacks H04L63/1458
• CPC Class Codes: H04L 45/36 Backward learning

Abstract

A distributed digital data communication network having widely dispursed nodes provides for effective transmission of messages between each node through the use of flood routing. A response message based upon stored data link status obtained when a message is received through the flood routing protocol selects the shortest time delay path for responding to that message. This process eliminates network instability.

Claims

1. A distributed digital data communication network, comprising:

a plurality of nodes geographically separated;

a plurality of full duplex data lines connected to the plurality of nodes such that each node is connected to its neighboring nodes by a data link between each of the neighboring nodes;

flood search means for propagating a first message through the digital data communication network from an originating node that is a member of the plurality nodes to an address homed at a destination node that is also a member of the plurality of nodes; and

shortest time delay path means for propagating a response message over the shortest time delay path, in response to the first message, from the destination node to the originating node via a data link that each node of the plurality of nodes first received the first message on.

2. The distributed digital data communication network according to claim 1 further comprising:

deletion means at each member of the plurality of nodes for discarding duplicates of the first message when received at the number of the plurality of nodes.

3. The distributed digital data communication network according to claim 2 wherein the deletion means comprises:

a storage means for storing of each message as it is received; and

a comparator means for comparing each message with those that are stored within the storage means.

4. The distributed digital data communication network according to claim 1, further comprising:

error checking means for checking all messages for transmission errors.

5. The distributed digital data communication network according to claim 4, wherein the error checking means, comprises:

error code generator means for including an error code in all messages transmitted between the nodes;

error code check means for checking the error code included in all messages at a receiving node; and

indicator means for indicating to the last node to propagate a message the results obtained by the error code check means.

6. The distributed digital data communication network according to claim 5, wherein the indicator means, comprises:

acknowledge means for indicating to the last node to propagate the message the results obtained by the error checking means.

7. A distributed digital data communication network according to claim 1, further comprising:

detector means for detecting and isolating any faults in any data links; and

means for maintaining data message flow when there is a data link fault.

8. A method for conducting communications between geographically separated points in a distributed digital data communication network having a plurality of nodes geographically separated and a plurality of full duplex data links connected to the plurality of nodes such that each node is connected to its neighboring node by a data link between each of the neighboring nodes, comprising:

propagating a first message through the digital data communication network from an originating node that is a member of the plurality nodes to an address homed at a destination node that is also a member of the plurality of nodes; and

propagating a response message over the shortest time delay path, in response to the first message, from the destination node to the originating node via a data link that each node of the plurality of nodes first received the first message on.

9. The method according to claim 8 further comprising the step of:

discarding duplicates of the first message at each node;

10. The method according to claim 8 wherein the step of discarding duplicates of the first message, comprises:

storing each message that is received by a receiving node;

comparing any received message with the stored messages; and

inhibiting all action by the receiving nodes to a duplicate message.

11. The method according to claim 8 further comprising the step of:

checking all messages for each transmission error.

12. The method according to claim 11, wherein the step in checking all messages for transmission errors, comprises:

including in all messages transmitted between nodes an error code;

checking the error code included in all messages at a receiving node; and

indicating to the last node to propagate a message, the results of the step of error checking.