Reconfiguring a network by utilizing a predetermined length quiescent state
First Claim
1. A method of reconfiguring a network having a plurality of nodes to reflect a change in topology of said network, said method comprising:
- upon receiving a reconfiguration request at one node of said plurality of nodes, entering a quiescent state at said one node, wherein said one node remains in said quiescent state for a predetermined period of time sufficient to allow at least one other node of said plurality of nodes to also enter a quiescent state; and
upon termination of said quiescent state at said one node, reconfiguring said one node to reflect said change in topology of said network without checking with said at least one other node.
2 Assignments
0 Petitions
Accused Products
Abstract
A network having a plurality of nodes is reconfigured to reflect a change in topology of the network. In particular, upon receiving a reconfiguration request, each node enters a quiescent state for a predetermined period of time sufficient to allow at least one other node to also enter a quiescent state. Then, upon termination of the quiescent state, the node is reconfigured to reflect the change in the topology of the network without having to check with any other nodes of the network. In other embodiments, the predetermined period of time is sufficient to allow currently executing protocols to complete execution as well as to allow the transmission of reconfiguration requests for propagating reconfiguration in the network.
116 Citations
52 Claims
-
1. A method of reconfiguring a network having a plurality of nodes to reflect a change in topology of said network, said method comprising:
-
upon receiving a reconfiguration request at one node of said plurality of nodes, entering a quiescent state at said one node, wherein said one node remains in said quiescent state for a predetermined period of time sufficient to allow at least one other node of said plurality of nodes to also enter a quiescent state; and upon termination of said quiescent state at said one node, reconfiguring said one node to reflect said change in topology of said network without checking with said at least one other node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system for reconfiguring a network having a plurality of nodes to reflect a change in topology of said network, said system comprising:
-
means for entering, upon receiving a reconfiguration request at one node of said plurality of nodes, a quiescent state at said one node, wherein said one node remains in said quiescent state for a predetermined period of time sufficient to allow at least one other node of said plurality of nodes to also enter a quiescent state; and means for reconfiguring, upon termination of said quiescent state at said one node, said one node to reflect said change in topology of said network without checking with said at least one other node. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34)
-
-
35. A system for reconfiguring a network having a plurality of nodes to reflect a change in topology of said network, said system comprising:
a computing node capable of entering, upon receiving a reconfiguration request at one node of said plurality of nodes, a quiescent state at said one node, wherein said one node remains in said quiescent state for a predetermined period of time sufficient to allow at least one other node of said plurality of nodes to also enter a quiescent state;
said computing node further being capable of reconfiguring, upon termination of said quiescent state at said one node, said one node to reflect said change in topology of said network without checking with said at least one other node.
-
36. An article of manufacture comprising:
-
a computer useable medium having computer readable program code means embodied therein for reconfiguring a network having a plurality of nodes to reflect a change in topology of said network, said article of manufacturing comprising; computer readable program code means for entering, upon receiving a reconfiguration request at one node of said plurality of nodes, a quiescent state at said one node, wherein said one node remains in said quiescent state for a predetermined period of time sufficient to allow at least one other node of said plurality of nodes to also enter a quiescent state; and computer readable program code means for reconfiguring, upon termination of said quiescent state at said one node, said one node to reflect said change in topology of said network without checking with said at least one other node. - View Dependent Claims (37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52)
-
Specification