Patent US4910733A successfully refreshed from Google Patents.
US4910733A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Rendezvous network protocol with reduced bandwidth and processor time
Assignee: Nortel Networks Ltd
•
Filing: 1988-03-15
•
Granted: 1990-03-20
•
Expires: 2008-03-15
Abstract
Abstract A network protocol elminates all acknowledge data packets. A health check data packet is broadcast periodically by each node in the network. Each node uses the health check data packets to maintain a library of node health conditions, thereby permitting avoidance of transactions with a node that is not working. If a node detects bad data directed to it, it transmits a negative acknowledge data packet, thus permitting the originating node to correct and/or retransmit the data packet found to be bad. A node in danger of becoming overloaded broadcasts a distress messege, whereby other nodes reduce data packets sent to it.
Inventors
- 👤 Arun Sommani
- 👤 Amitabha Gupta
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 17:36
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
199 words
A method for controlling a network, said network including at least first and second nodes, comprising: connecting said at least first and second nodes to a common communications transmission medium; communicating between said at least first and second nodes using sporadic data packets; periodically broadcasting a first node-health data packet from said first node to all other nodes in said network; said first node-health data packet indicating that said first node is functional; periodically broadcasting a second node-health data packet from said second node to all other nodes in said network; said second node-health data packet indicating that said second node is functional; all nodes in said network, including said first and second nodes, updating an internal node-health library based on receiving, or failing to receive, said first and second node-health data packets; communicating a first data packet from said first node addressed to said second node; said first data packet being of a type requiring a reply; communicating a reply data packet from said second node addressed to said first node; and omitting the step of communicating a first data packet if said internal node-health library in said first node indicates that said second node is not functional.
Claim 2
Independent Claim
199 words
A method for controlling a network, said network including at least first and second nodes, comprising: connecting said at least first and second nodes to a common communications transmission medium; communicating between said at least first and second nodes using sporadic data packets; periodically broadcasting a first node-health data packet from said first node to all other nodes in said network; said first node-health data packet indicating that said first node is functional; periodically broadcasting a second node-health data packet from said second node to all other nodes in said network; said second node-health data packet indicating that said second node is functional; all nodes in said network, including said first and second nodes, updating an internal node-health library based on receiving, or failing to receive, said first and second node-health data packets; communicating a first data packet from said first node addressed to said second node; said first data packet being of a type requiring a reply; communicating a reply data packet from said second node addressed to said first node; and omitting the step of communicating a first data packet if said internal node-health library in said first node indicates that said second node is not functional.
Claim 3
Dependent Claim
67 words
A method according to claim 1, further comprising: verifying, in said second node, that said first data packet is a correct data packet;; and communicating a negative acknowledge data packet from said second node addressed to said first node if said first data packet is not received as said correct data packet, whereby said first node receives an indication that said first data packet was incorrectly received
Claim 4
Dependent Claim
44 words
A method according to claim 1, further comprising: broadcasting a not-healthy data packet from said second node in the event of impending overload or failure of said second node, whereby all other nodes are enabled to reduce data packets addressed to said second node.
Claim 5
Independent Claim
293 words
A method for controlling a network, said network including at least first and second nodes, comprising: connecting said at least first and second nodes to a common communications transmission medium; communicating between said at least first and second nodes using sporadic data packets; periodically broadcasting a first node-health data packet from said first node to all other nodes in said network; said first node-health data packet indicating that said first node is functional; periodically broadcasting a second node-health data packet from said second node to all other nodes in said network; said second node-health data packet indicating that said second node is functional; all nodes in said network, including said first and second nodes, updating an internal node-health library based on receiving, or failing to receive, said first and second node-health data packets; communicating a first data packet from said first node addressed to said second node; said first data packet being of a tape requiring a reply; communicating a reply data packet from said second node addressed to said first node; omitting the step of communicating a first data packet if said integral node-health library in said first node indicates that said second node is not functional; verifying, in said second node, that said first data packet is a correct data packet; communicating a negative acknowledge data packet from said second node addressed to said first node if said first data packet is not received as said correct data packet, whereby said first node receives an indication that said first data packet was incorrectly received; and broadcasting a not-healthy data packet from said second node in the event of impending overload or failure of said second node, whereby all other nodes are enabled to reduce data packets addressed to said second node.
Claim 6
Independent Claim
293 words
A method for controlling a network, said network including at least first and second nodes, comprising: connecting said at least first and second nodes to a common communications transmission medium; communicating between said at least first and second nodes using sporadic data packets; periodically broadcasting a first node-health data packet from said first node to all other nodes in said network; said first node-health data packet indicating that said first node is functional; periodically broadcasting a second node-health data packet from said second node to all other nodes in said network; said second node-health data packet indicating that said second node is functional; all nodes in said network, including said first and second nodes, updating an internal node-health library based on receiving, or failing to receive, said first and second node-health data packets; communicating a first data packet from said first node addressed to said second node; said first data packet being of a tape requiring a reply; communicating a reply data packet from said second node addressed to said first node; omitting the step of communicating a first data packet if said integral node-health library in said first node indicates that said second node is not functional; verifying, in said second node, that said first data packet is a correct data packet; communicating a negative acknowledge data packet from said second node addressed to said first node if said first data packet is not received as said correct data packet, whereby said first node receives an indication that said first data packet was incorrectly received; and broadcasting a not-healthy data packet from said second node in the event of impending overload or failure of said second node, whereby all other nodes are enabled to reduce data packets addressed to said second node.
References Cited (Backward Citations)
US4276593A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-03-19 | 1993-09-18 | 1994-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-03-19 | 1997-09-18 | 1998-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-03-19 | 2001-09-18 | 2002-03-20 | $7700.00 | Window Closed / Lapsed |