Method and system for routing packets in a packet communication network using locally constructed routing tables
First Claim
1. A method for routing packets of dam without a network directory comprising the steps of:
- assigning to each node in a network an identifier indicative of coordinate location, said identifier including an absolute coordinate value;
addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node;
at a relay local node, selecting upon first receipt of a packet for a destination node one neighboring node by using said absolute coordinate value of said destination node and other information specific to said relay local node according to preselected criteria;
storing at said relay local node an identifier of said selected neighboring node along with a label for said ultimate destination node in a routing table;
forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and
retrieving said identifier of said selected neighboring node from said routing table when a subsequent packet for said ultimate destination node is received at said relay local node and forwarding said subsequent packet to said selected neighboring node indicated by said identifier.
10 Assignments
0 Petitions
Accused Products
Abstract
In a packet communication system, wherein nodes are assigned an absolute coordinate-based address and routing decisions are made at each node without the use of directory-based routing, routing decisions made for a particular packet with an ultimate destination are stored at each node so that the next packet sent by that node to that same ultimate destination can be forwarded in accordance with the previous routing decision made for that destination. Routing decisions are stored locally at each node in a routing table. In one embodiment, nodes also store routing information about the source node for a packet so that when a return packet is received for the original source, the relay node will not have to make a routing decision.
323 Citations
12 Claims
-
1. A method for routing packets of dam without a network directory comprising the steps of:
-
assigning to each node in a network an identifier indicative of coordinate location, said identifier including an absolute coordinate value; addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; at a relay local node, selecting upon first receipt of a packet for a destination node one neighboring node by using said absolute coordinate value of said destination node and other information specific to said relay local node according to preselected criteria; storing at said relay local node an identifier of said selected neighboring node along with a label for said ultimate destination node in a routing table; forwarding said packet to said selected neighboring node for eventual delivery to said ultimate destination node; and retrieving said identifier of said selected neighboring node from said routing table when a subsequent packet for said ultimate destination node is received at said relay local node and forwarding said subsequent packet to said selected neighboring node indicated by said identifier. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for routing packets of data in a packet data communication network without a network directory comprising:
-
a plurality of nodes in a network, each node including an identifier indicative of coordinate location, said identifier including a coordinate value referenced to a terrestrial grid; means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; means at each of said plurality of nodes for selecting upon first receipt of a packet for a destination node a neighboring node by using said identifier indicative of coordinate location of said destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selected by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination.
-
-
7. A system for routing packets of data without a network directory comprising:
-
a plurality of nodes in a network, each node including an identifier indicative of geographic location, said identifier including a coordinate value referenced to a terrestrial grid; means for addressing a packet to an ultimate destination node by designating in a packet header said ultimate destination node only by said coordinate value of said ultimate destination node and without designating a complete intermediate path to said ultimate destination node such that the network is free to route the packet via any intermediate path to said ultimate destination node; and at a local node, means for selecting at least one of said neighboring nodes upon first receipt of a packet for said destination node by using said packet header and other information specific to said local node according to preselected criteria; means for forwarding said packet to said selected neighboring nodes for eventual delivery to said ultimate destination node; and means at each of said plurality of nodes for storing a routing table entry for an ultimate destination of a packet, said routing table entry selected by an identifier for said ultimate destination node and including information identifying a neighboring node as a forwarding node for said ultimate destination. - View Dependent Claims (8, 9, 10, 11, 12)
-
Specification