IP Library Granted Patent US 8,488,492
Granted Patent B2
US 8,488,492 · App. 12/951,282 · Granted Jul 16, 2013

Anycast-based internet protocol redirection to alleviate partial routing tables

Inventors: Jay Charles Borkenhagen (Lincroft, NJ); Richard Kwapniewski (Middletown, NJ); Thomas Bradley Scholl (Seattle, WA)
Assignee: AT&T Intellectual Property I, L.P.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,488,492
App. No.
12/951,282
Granted
Jul 16, 2013
Kind
B2
Abstract

Systems and methods are described that instruct routers having constrained hardware/memory to redirect all outbound traffic to a helper router. The helper router contains a full routing table that can forward any packet to its destination. In a large service provider network, helper routers may be distributed at multiple locations across the network. Since packets must detour through the helper router, the distributed helper routers minimize latency.

Claims (46)

1. A method for configuring a network that includes a plurality of routers comprising:

configuring one or more helper routers, each helper router having a full routing table for the network;

announcing to the network each helper router's default route using anycast prefix addressing over a routing protocol;

deleting a non helper router's routing table upon reaching a predetermined constrained threshold;

receiving a packet with a destination at a router without a routing table;

matching a default route learned from the one or more helper routers at the router without a routing table;

forwarding the received packet and any subsequent packets from the router without a routing table to a closest helper router where a forwarding look up is performed based on the destination; and

forwarding the packet from the helper router.

2. The method according to claim 1 wherein a helper router contains a full routing table for networks such as the Internet or a Virtual Private Network (VPN).

3. The method according to claim 1 wherein the predetermined constrained threshold is a memory capacity that is less than that required for the network's full routing table.

4. The method according to claim 1 further comprising for each router without a routing table, prioritizing each helper router's location in the network.

5. The method according to claim 1 further comprising for each router without a full routing table, pointing a static default route to the anycast prefix.

6. The method according to claim 1 wherein each helper router forwards a received packet to an optimal next hop.

7. The method according to claim 1 further comprising distributing the one or more helper routers throughout the network.

8. The method according to claim 1 further comprising configuring one or more Route Reflectors (RR) to select the helper router for routers without a routing table.

9. The method according to claim 8 further comprising selecting the nearest helper router for routers without a routing table based on the lowest helper router routing metric.

10. A method for configuring a network that includes a plurality of routers comprising:

configuring one or more helper routers, each helper router having a full routing table for the network;

announcing to the network each helper router's default route using anycast prefix addressing over a routing protocol;

examining each non helper routers' routing table memory capacity;

predicting when a non helper router's routing table memory capacity reaches a predetermined constrained threshold;

deleting a non helper router's routing table based upon the predetermined constrained threshold prediction;

receiving a packet with a destination at a router without a routing table;

matching a default route learned from the one or more helper routers at the router without a routing table;

forwarding the received packet and any subsequent packets from the router without a full routing table to a closest helper router where a forwarding look up is performed based on the destination; and

forwarding the packet from the helper router.

11. The method according to claim 10 wherein a helper router contains a full routing table for networks such as the Internet or a Virtual Private Network (VPN).

12. The method according to claim 10 wherein the predetermined constrained threshold is a memory capacity that is less than that required for the network's full routing table.

13. The method according to claim 10 further comprising for each router without a routing table, prioritizing each helper router's location in the network.

14. The method according to claim 10 further comprising for each router without a full routing table, pointing a static default route to the anycast prefix.

15. The method according to claim 10 wherein each helper router forwards a received packet to an optimal next hop.

16. The method according to claim 10 further comprising distributing the one or more helper routers throughout the network.

17. The method according to claim 10 further comprising configuring one or more Route Reflectors (RR) to select the helper router for routers lacking a routing table.

18. The method according to claim 17 further comprising selecting the nearest helper router for routers without a routing table based on the lowest helper router routing metric.

19. A data communications network comprising:

a plurality of interconnected routers comprising one or more helper routers, each helper router has a full routing table and announces its default route to the network using anycast prefix addressing over a routing protocol; and

a configuration wherein the routing table memory capacity for each non helper router is examined and if a non helper router's routing table memory capacity reaches a predetermined constrained threshold, that non-helper router deletes its routing table.

20. The data communications network according to claim 19 wherein the configuration further comprises a router without a routing table forwards received packets having a destination address to the closest helper router where a next hop look up for that destination is performed.

21. The data communications network according to claim 19 wherein a predetermined constrained threshold is a memory capacity that is less than that required for the network's full routing table.

22. The data communications network according to claim 20 wherein the configuration of each router without a routing table is further configured to prioritize each helper router's location in the network.

23. The data communications network according to claim 20 wherein the configuration of routers without a routing table is further configured to receive anycast prefixes from each helper router wherein a static default route points to the anycast prefix.

24. The data communications network according to claim 20 wherein each helper router is further configured to forward a received packet to an optimal next hop.

25. The data communications network according to claim 19 wherein the one or more helper routers are distributed throughout the network.

26. The data communications network according to claim 19 wherein the routing protocol is comprised of at least one of Border Gateway Protocol (BGP), Open Shortest Path First (OSPF), Intermediate System to Intermediate System (IS IS), Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP).

27. The data communications network according to claim 20 wherein the configuration further comprises one or more Route Reflectors (RR) configured to select the closest router having a full routing table for routers lacking a full routing table.

28. The data communications network according to claim 27 wherein an RR selects the nearest helper router for routers without a routing table based on the lowest helper router routing metric.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 8, 2013
From: BORKENHAGEN, JAY CHARLES; KWAPNIEWSKI, RICHARD; SCHOLL, THOMAS BRADLEY
To: AT&T INTELLECTUAL PROPERTY I, L.P.
Reel/Frame 029588/0538 →
CORRECTIVE ASSIGNMENT TO CORRECT THE ORIGINAL ASSIGNMENT COVER PAGE ON WHICH INVENTOR CHRISTOPHER YUNKER'S NAME WAS MISSPELLED PREVIOUSLY RECORDED ON REEL 025594 FRAME 0904. ASSIGNOR(S) HEREBY CONFIRMS THE MISSPELLED "CHRISTOPHE YUNKER", SHOULD READ "CHRISTOPHER YUNKER.". Recorded Dec 14, 2011
From: GROSS, RYAN WAYNE; CARROLL, JOSEPH; KLEM, DONNA; YUNKER, CHRISTOPHER; RABBANI, NAVEED; NOVATZKY, BENJAMIN
To: GENERAL ELECTRIC COMPANY
Reel/Frame 027381/0061 →
Continuity (2)
Continuation 12286479 · Sep 30, 2008
Related Publication 20110064083A1 · Mar 17, 2011