US6178172B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of topology database synchronization in an asynchronous transfer mode network
Assignee: HP Inc
•
Filing: 1998-03-24
•
Granted: 2001-01-23
•
Expires: 2018-03-24
Abstract
Abstract A method for performing topology database synchronization between two nodes wherein one of the nodes is in an overload state. The node in the overload state looks for a neighboring node directly connected to it that is not in the overload state. After such a node is found, the link to the neighboring node is intentionally dropped and subsequently re-established. This causes the neighboring node to transfer its entire knowledge of the network to the node in the overload state. The node in the overload state than functions to forward the topology database information to its other neighboring node. In this fashion, the portions of the network one either side of the link learn about the other side notwithstanding the fact that one of the nodes is in an overload state. Once the database synchronization process is complete, calls can then be initiated from either side of the network to the other side.
Inventors
- 👤 Haim Rochberger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 05:11
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/10
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
189 words
In an asynchronous transfer mode (ATM) network running the private network-to-network (PNNI) protocol, a method of synchronizing database information between a first node in an overload state connected by a first link to a neighboring second node not in an overload state, said method comprising the steps of: prioritizing a topology database memory within said first node in response to said first node discovering it is in an overload state; initiating the hello protocol and associated finite state machine between said first node and said second node over said first link; choosing a neighboring third node connected to said first node that is not in an overload state, said third node connected to said first node via a second link; dropping said second link connecting said first node with said third node; re-establishing said second link so as to cause said first node and said third node to execute the hello protocol and associated finite state machine; and exchanging database topology information between said second node and said third node by way of said first node which performs a forwarding function for said second node and said third node.
Claim 2
Dependent Claim
189 words
In an asynchronous transfer mode (ATM) network running the private network-to-network (PNNI) protocol, a method of synchronizing database information between a first node in an overload state connected by a first link to a neighboring second node not in an overload state, said method comprising the steps of: prioritizing a topology database memory within said first node in response to said first node discovering it is in an overload state; initiating the hello protocol and associated finite state machine between said first node and said second node over said first link; choosing a neighboring third node connected to said first node that is not in an overload state, said third node connected to said first node via a second link; dropping said second link connecting said first node with said third node; re-establishing said second link so as to cause said first node and said third node to execute the hello protocol and associated finite state machine; and exchanging database topology information between said second node and said third node by way of said first node which performs a forwarding function for said second node and said third node.
Claim 3
Dependent Claim
42 words
The method according to claim 1 , wherein said step of choosing a neighboring third node comprises the step of choosing a neighboring third node in a random fashion from all nodes immediately neighboring said first node not in an overload state.
Claim 4
Dependent Claim
36 words
The method according to claim 1 , wherein said step of prioritizing a topology database memory comprises the step of giving priority over PTSE information from a local node over PTSE information from a non-local node.
Claim 5
Dependent Claim
34 words
The method according to claim 1 , wherein said step of dropping said second link comprises the step of transmitting a hello message to said third link with a remote node identification of zero.
Claim 6
Dependent Claim
229 words
In an asynchronous transfer mode (ATM) network running the private network-to-network (PNNI) protocol, a method of synchronizing database information between a first node in an overload state connected by a first link to a neighboring second node not in an overload state, said method comprising the steps of: prioritizing a topology database memory within said first node in response to said first node discovering it is in an overload state; initiating the hello protocol and associated finite state machine between said first node and said second node over said first link; choosing a neighboring third node connected to said first node that is not in an overload state, said third node connected to said first node via a second link; dropping said second link connecting said first node with said third node; re-establishing said second link so as to cause said first node and said third node to execute the hello protocol and associated finite state machine; and performing exchange state protocol between said third node and said second node with said first node forwarding messages between said third node and said second node; performing load state protocol between said third node and said second node with said first node forwarding messages between said third node and said second node; entering the full state in said third node and said second node once database synchronization has completed between them.
Claim 7
Dependent Claim
229 words
In an asynchronous transfer mode (ATM) network running the private network-to-network (PNNI) protocol, a method of synchronizing database information between a first node in an overload state connected by a first link to a neighboring second node not in an overload state, said method comprising the steps of: prioritizing a topology database memory within said first node in response to said first node discovering it is in an overload state; initiating the hello protocol and associated finite state machine between said first node and said second node over said first link; choosing a neighboring third node connected to said first node that is not in an overload state, said third node connected to said first node via a second link; dropping said second link connecting said first node with said third node; re-establishing said second link so as to cause said first node and said third node to execute the hello protocol and associated finite state machine; and performing exchange state protocol between said third node and said second node with said first node forwarding messages between said third node and said second node; performing load state protocol between said third node and said second node with said first node forwarding messages between said third node and said second node; entering the full state in said third node and said second node once database synchronization has completed between them.
Claim 8
Dependent Claim
44 words
The method according to claim 5 , wherein said step of choosing a neighboring third node comprises the step of choosing a neighboring third node in a random fashion from all nodes immediately neighboring said first node that is not in an overload state.
Claim 9
Dependent Claim
34 words
The method according to claim 5 , further comprising the step of prioritizing the topology database memory within said first node in response to said first node discovering it is in an overload state.
Claim 10
Dependent Claim
36 words
The method according to claim 5 , wherein said step of prioritizing a topology database memory comprises the step of giving priority to PTSE information from a local node over PTSE information from a non-local node.
Claim 11
Dependent Claim
34 words
The method according to claim 5 , wherein said step of dropping said second link comprises the step of transmitting a hello message to said third link with a remote node identification of zero.
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) | 2004-01-23 | 2004-07-24 | 2005-01-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-01-23 | 2008-07-24 | 2009-01-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-01-23 | 2012-07-24 | 2013-01-23 | $7700.00 | Window Closed / Lapsed |