Method and apparatus for providing services on a dynamically addressed network
First Claim
Patent Images
1. A network comprising a plurality of Nodes interconnected by Links, wherein:
- (a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;
(b) at least one of said set of one or more coordinate labels is additionally comprised of service information;
(c) each coordinate label is unique to the Node to which it is assigned; and
(d) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node.
1 Assignment
0 Petitions
Accused Products
Abstract
DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
-
Citations
40 Claims
-
1. A network comprising a plurality of Nodes interconnected by Links, wherein:
-
(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;
(b) at least one of said set of one or more coordinate labels is additionally comprised of service information;
(c) each coordinate label is unique to the Node to which it is assigned; and
(d) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
15. A network comprising a plurality of Nodes interconnected by Links, wherein:
-
(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;
(b) each coordinate label is unique to the Node to which it is assigned;
(c) at least one path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node; and
(d) a preferred path between said first Node and said second Node is selected from a set of one or more possible paths based upon a predetermined routing objective.
-
-
31. A method for determining a path from a source Node to a destination Node in a network comprising a plurality of Nodes interconnected by Links, said Nodes including a first Node, and a plurality of second Nodes, said second Nodes including said source Node and destination Node, said method comprising the steps of:
-
(a) assigning to each of said second Nodes, including said source Node and said destination Node, one or more coordinate labels, each coordinate label assigned to a second Node representing a path through said network from said second Node to said first Node;
(b) including in at least one of said one or more coordinate labels service information; and
(b) determining a path from said source Node to said destination Node by combining one coordinate label of said source Node and one coordinate label of said destination Node. - View Dependent Claims (32, 33, 34, 35, 37, 38, 39, 40)
-
-
36. A Node for use in a network, said network comprising a plurality of Nodes connected by Links, wherein:
said Node for use in said network has one or more coordinate labels assigned thereto, each coordinate label representing a path from said Node to a particular other Node of said network, and where at least one of said one or more coordinate labels is further comprised of service information, each of said coordinate labels being unique to said Node.
Specification