Claims
- 1. A method for managing routes in a router comprising the steps of:
identifying a volume of routes in the router; determining whether the volume of routes has reached a threshold; and applying a threshold-specific discard algorithm to routes in the router if the volume of routes has reached the threshold.
- 2. The method of claim 1 wherein applying the threshold-specific discard algorithm includes applying the threshold-specific discard algorithm to routes that are stored in a route table.
- 3. The method of claim 1 wherein applying the threshold-specific discard algorithm includes applying the threshold-specific discard algorithm to incoming routes.
- 4. The method of claim 3 further comprising:
storing the incoming routes in a route table if the volume of routes has not reached the threshold.
- 5. The method of claim 1 further comprising:
determining whether the volume of routes has reached another threshold; and applying a second threshold-specific discard algorithm to the routes if the volume of routes has reached the another threshold.
- 6. The method of claim 5 further comprising:
storing the routes in a route table if the volume of routes has not reached the another threshold.
- 7. The method of claim 1 wherein the threshold is defined as a fraction of the route storage capacity in the router.
- 8. The method of claim 1 wherein the threshold is defined as a number of routes being stored in the router.
- 9. The method of claim 1 wherein the threshold-specific discard algorithm is a function of a routing protocol.
- 10. The method of claim 9 wherein the threshold-specific discard algorithm comprises:
identifying a maximum number of redundant routes; and discarding all redundant routes in excess of the maximum number of redundant routes.
- 11. The method of claim 10 wherein a first maximum number of routes are allowed to a given destination for a first threshold.
- 12. The method of claim 11 wherein a second maximum number of routes are allowed to a given destination for a second threshold.
- 13. A system for managing routes in a router comprising:
means for identifying a volume of routes in the router; means for determining whether the volume of routes has reached a threshold; and means for applying a threshold-specific discard algorithm to routes in the router if the volume of routes has reached the threshold.
- 14. The system of claim 13 wherein the means for applying the threshold-specific discard algorithm includes means for applying the threshold-specific discard algorithm to routes that are stored in a route table.
- 15. The system of claim 13 wherein the means for applying the threshold-specific discard algorithm includes means for applying the threshold-specific discard algorithm to incoming routes.
- 16. The system of claim 15 further comprising:
means for storing the incoming routes in a route table if the volume of routes has not reached the threshold.
- 17. The system of claim 13 further comprising:
means for determining whether the volume of routes has reached another threshold; and means for applying a second threshold-specific discard algorithm to the routes if the volume of routes has reached the another threshold.
- 18. The system of claim 17 further comprising:
means for storing the routes in a route table if the volume of routes has not reached the another threshold.
- 19. The system of claim 13 wherein the threshold is defined as a fraction of the route storage capacity in the router.
- 20. The system of claim 13 wherein the threshold is defined as a number of routes being stored in the router.
- 21. The system of claim 13 wherein the threshold-specific discard algorithm is a function of a routing protocol.
- 22. The system of claim 21 wherein the means for applying the threshold-specific discard algorithm comprises:
means for identifying a maximum number of redundant routes; and means for discarding all redundant routes in excess of the maximum number of redundant routes.
- 23. The system of claim 21 wherein a first maximum number of routes are allowed to a given destination for a first threshold.
- 24. The system of claim 23 wherein a second maximum number of routes are allowed to a given destination for a second threshold.
- 25. A computer readable medium comprising program instructions for managing routes in a router, the program instructions comprising the steps of:
identifying a volume of routes in the router; determining whether the volume of routes has reached a threshold; and applying a threshold-specific discard algorithm to routes in the router if the volume of routes has reached the threshold.
- 26. The computer readable medium of claim 25 wherein applying the threshold-specific discard algorithm includes applying the threshold-specific discard algorithm to routes that are stored in a route table.
- 27. The computer readable medium of claim 25 wherein applying the threshold-specific discard algorithm includes applying the threshold-specific discard algorithm to incoming routes.
- 28. The computer readable medium of claim 27 further comprising:
storing the incoming routes in a route if the volume of routes has not reached the threshold.
- 29. The computer readable medium of claim 25 further comprising:
determining whether the volume of routes has reached another threshold; and applying a second threshold-specific discard algorithm to the routes if the volume of routes has reached the another threshold.
- 30. The computer readable medium of claim 29 further comprising:
storing the routes in a route table if the volume of routes has not reached the another threshold.
- 31. The computer readable medium of claim 25 wherein the threshold is defined as a fraction of the route storage capacity in the router.
- 32. The computer readable medium of claim 25 wherein the threshold is defined as a number of routes being stored in the router.
- 33. The computer readable medium of claim 25 wherein the threshold-specific discard algorithm is a function of a routing protocol.
- 34. The computer readable medium of claim 33 wherein applying the threshold-specific discard algorithm comprises:
identifying a maximum number of redundant routes; and discarding all redundant routes in excess of the maximum number of redundant routes.
- 35. The computer readable medium of claim 34 wherein a first maximum number of routes are allowed to a given destination for a first threshold.
- 36. The computer readable medium of claim 35 wherein a second maximum number of routes are allowed to a given destination for a second threshold.
- 37. A router for use in a computer network comprising:
a buffer; a route table; and route discard logic coupled to the buffer and the route table wherein the route discard logic comprises logic for:
identifying a volume of routes in the router; determining whether the volume of routes has reached a threshold; and applying a threshold-specific discard algorithm to routes in the router if the volume of routes has reached the threshold.
- 38. The router of claim 37 wherein the route discard logic includes logic for applying the threshold-specific discard algorithm to routes that are stored in a route table.
- 39. The router of claim 37 wherein the route discard logic includes logic for applying the threshold-specific discard algorithm to incoming routes.
- 40. The router of claim 39 wherein the route discard logic includes:
logic for storing the incoming routes in the route table if the volume of routes has not reached the threshold.
- 41. The router of claim 37 wherein the route discard logic includes:
determining whether the volume of routes has reached another threshold; and applying a second threshold-specific discard algorithm to the routes if the volume of routes has reached the another threshold.
- 42. The router of claim 41 wherein the route discard logic includes:
logic for storing the routes in the route table if the volume of routes has not reached the another threshold.
- 43. The router of claim 37 wherein the threshold is defined as a fraction of the route storage capacity in the router.
- 44. The router of claim 37 wherein the threshold is defined as a number of routes being stored in the router.
- 45. The router of claim 37 wherein the threshold-specific discard algorithm is a function of a routing protocol.
- 46. The router of claim 45 wherein the logic for applying the threshold-specific algorithm comprises logic for:
identifying a maximum number of redundant routes; and discarding all redundant routes in excess of the maximum number of redundant routes.
- 47. The router of claim 46 wherein a first maximum number of routes are allowed to a given destination for a first threshold.
- 48. The router of claim 47 wherein a second maximum number of routes are allowed to a given destination for a second threshold.
CROSS-REFERENCE TO RELATED APPLICATION
[0001] This application is entitled to the benefit of provisional U.S. Patent Application Serial No. 60/389,069, filed Jun. 14, 2002.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60389069 |
Jun 2002 |
US |