Static addressing of devices in a dynamically routed network
First Claim
1. A method of routing in a network, comprising:
- dividing a period of time, corresponding to registration of a first node with a second node, into a sequence of time intervals, wherein a time interval at the beginning said period of time has a duration that is shorter than a time interval that is later in said period of time;
assigning to each of said time intervals a metric designating a cost associated with a communications path between the first node and the second node, wherein the designated cost increases in value for successive intervals of time in said sequence; and
broadcasting, by the second node, at least one message during each of said time intervals, said message containing the metric associated with time interval during which the message is broadcast.
3 Assignments
0 Petitions
Accused Products
Abstract
A method of routing in a network includes dividing a time corresponding to a predetermined maximum registration age of a first node registered with a second node into a number of first time intervals and second time intervals. The first time intervals each have a predetermined duration and the second time intervals each have a duration greater than the predetermined duration of the first time intervals. Each of the first and second time intervals are assigned a metric designating a cost associated with a path between the first node and the second node. The metric increases in value for each of the first and second time intervals as registration age increases. The second node sends a message including the metric associated with the time interval during which it is transmitted.
-
Citations
35 Claims
-
1. A method of routing in a network, comprising:
-
dividing a period of time, corresponding to registration of a first node with a second node, into a sequence of time intervals, wherein a time interval at the beginning said period of time has a duration that is shorter than a time interval that is later in said period of time; assigning to each of said time intervals a metric designating a cost associated with a communications path between the first node and the second node, wherein the designated cost increases in value for successive intervals of time in said sequence; and broadcasting, by the second node, at least one message during each of said time intervals, said message containing the metric associated with time interval during which the message is broadcast. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A node for a communications network with devices having static internet protocol (IP) addresses with which second nodes register to provide a communications path, said node including a transmitting unit that broadcasts routing information messages via said communications network while a second node is registered with said node, wherein the routing information messages contain a metric value designating a cost associated with a communication path between said node and the second node, and configured to:
-
divide a period of time, during which the second node is registered with said node into a sequence of time intervals, wherein a time interval at the beginning of said period of time has a duration that is shorter than a time interval that is later in said period of time; assign to each of said time intervals a metric value such that the designated cost increases in value for successive intervals of time in said sequence; and broadcast at least one routing information message during each of said time intervals, said message containing the metric value associated with time interval during which the message is broadcast. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29)
-
-
30. In a network in which a first node can register with two or more other nodes that provide access to and from said first node, a method comprising the following steps:
-
at each other node with which the first node is registered, broadcasting advertisements that said other node can provide a path to the first node, said advertisements comprising messages that are transmitted during a sequence of time intervals over a period of time while the first node is registered, wherein a time interval earlier in said sequence has a duration that is shorter than a time interval that is later in said sequence, each said message containing a metric designating a cost associated with the path to the other node, and wherein the designated cost increases in value for successive intervals of time in said sequence; upon receiving an advertisement at one of said other nodes that another node can provide a path to said first node, determining whether the metric contained in the received advertisement designates a lower cost than the metric being broadcast by said one node for its path to the first node; and terminating the broadcast of the advertisements from said one node if the metric contained in the received advertisement designates a lower cost than the metric being broadcast by said one node. - View Dependent Claims (31, 32)
-
-
33. In a network in which a first node can register with two or more other nodes that provide access to and from said first node, a method comprising the following steps:
-
at each other node with which the first node is registered, broadcasting advertisements that said other node can provide a path to the first node, said advertisements comprising messages that are transmitted during a sequence of time intervals over a period of time while the first node is registered, wherein a time interval earlier in said sequence has a duration that is shorter than a time interval that is later in said sequence, each said message containing a metric designating a cost associated with the path to the other node, and wherein the designated cost increases in value for successive intervals of time in said sequence; receiving said advertisements from two or more other nodes at a transmitting node, and selecting one of said other nodes based upon the respective metrics contained in the received advertisements; and transmitting a message to the first node from the transmitting node, via the selected one of said other nodes. - View Dependent Claims (34, 35)
-
Specification