Managing routing information for a computer network
First Claim
Patent Images
1. A computer-readable memory medium comprising program instructions executable to implement a method comprising:
- a first node determining that a first routing entry in a routing table is a least recently used routing entry, wherein the first routing entry specifies routing information for routing messages addressed to a first destination;
the first node replacing the first routing entry with a second routing entry in response to determining that the first routing entry is the least recently used routing entry;
the first node receiving a request to route a first message to the first destination after replacing the first routing entry with the second routing entry;
the first node determining whether the routing table includes a routing entry specifying routing information for routing messages addressed to the first destination, in response to the request to route the first message to the first destination;
the first node communicating with one or more other nodes to perform an algorithm to create routing information for routing the first message to the first destination in response to determining that the routing table does not include a routing entry specifying routing information for routing messages addressed to the first destination; and
the first node storing the created routing information in the routing table.
10 Assignments
0 Petitions
Accused Products
Abstract
A plurality of routing entries may be stored in a routing table. Each routing entry may include information usable for routing a message through a network. As new routing entries are received or created, each new routing entry may be added to the routing table. However, if there is not sufficient memory or storage to add the new routing entry to the routing table, then the least recently used existing routing entry in the routing table may be replaced with the new routing entry. In the event that the replaced routing entry is needed later, the replaced routing entry may be re-created.
-
Citations
30 Claims
-
1. A computer-readable memory medium comprising program instructions executable to implement a method comprising:
-
a first node determining that a first routing entry in a routing table is a least recently used routing entry, wherein the first routing entry specifies routing information for routing messages addressed to a first destination; the first node replacing the first routing entry with a second routing entry in response to determining that the first routing entry is the least recently used routing entry;
the first node receiving a request to route a first message to the first destination after replacing the first routing entry with the second routing entry;the first node determining whether the routing table includes a routing entry specifying routing information for routing messages addressed to the first destination, in response to the request to route the first message to the first destination; the first node communicating with one or more other nodes to perform an algorithm to create routing information for routing the first message to the first destination in response to determining that the routing table does not include a routing entry specifying routing information for routing messages addressed to the first destination; and the first node storing the created routing information in the routing table. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A first node comprising:
-
at least one processor; a memory storing program instructions; and wherein the at least one processor is operable to execute the program instructions to implement a method comprising determining that a first routing entry in a routing table is a least recently used routing entry, wherein the first routing entry specifies routing information for routing messages addressed to a first destination; replacing the first routing entry with a second routing entry in response to determining that the first routing entry is the least recently used routing entry; receiving a request to route a first message to the first destination after replacing the first routing entry with the second routing entry; determining whether the routing table includes a routing entry specifying routing information for routing messages addressed to the first destination, in response to the request to route the first message to the first destination; communicating with one or more other nodes to perform an algorithm to create routing information for routing the first message to the first destination in response to determining that the routing table does not include a routing entry specifying routing information for routing messages addressed to the first destination; and storing the created routing information in the routing table. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A method comprising:
-
a first node determining that a first routing entry in a routing table is a least recently used routing entry, wherein the first routing entry specifies routing information for routing messages addressed to a first destination; the first node replacing the first routing entry with a second routing entry in response to determining that the first routing entry is the least recently used routing entry;
the first node receiving a request to route a first message to the first destination after replacing the first routing entry with the second routing entry;the first node determining whether the routing table includes a routing entry specifying routing information for routing messages addressed to the first destination, in response to the request to route the first message to the first destination; the first node communicating with one or more other nodes to perform an algorithm to create routing information for routing the first message to the first destination in response to determining that the routing table does not include a routing entry specifying routing information for routing messages addressed to the first destination; and the first node storing the created routing information in the routing table. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification