US4399531A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Distributed digital data communications network
Assignee: Boeing North American Inc
•
Filing: 1980-09-29
•
Granted: 1983-08-16
•
Expires: 2000-09-29
Abstract
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.
Inventors
- 👤 Johannes Grande
- 👤 Raymond Bittel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 23:47
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/36; H04L45/32
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
139 words
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.
Claim 2
Dependent Claim
139 words
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.
Claim 3
Dependent Claim
39 words
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.
Claim 4
Dependent Claim
44 words
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.
Claim 5
Dependent Claim
22 words
The distributed digital data communication network according to claim 1, further comprising: error checking means for checking all messages for transmission errors.
Claim 6
Dependent Claim
71 words
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.
Claim 7
Dependent Claim
35 words
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.
Claim 8
Dependent Claim
38 words
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.
Claim 9
Independent Claim
141 words
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.
Claim 10
Independent Claim
141 words
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.
Claim 11
Dependent Claim
20 words
The method according to claim 8 further comprising the step of: discarding duplicates of the first message at each node;
Claim 12
Dependent Claim
47 words
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.
Claim 13
Dependent Claim
18 words
The method according to claim 8 further comprising the step of: checking all messages for each transmission error.
Claim 14
Dependent Claim
57 words
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.
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) | 1986-08-15 | 1987-02-14 | 1987-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-08-15 | 1991-02-14 | 1991-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-08-15 | 1995-02-14 | 1995-08-16 | $7700.00 | Window Closed / Lapsed |