Methods, systems and computer program products for individually identifying and disabling circular routes from a plurality of active routes to a common destination
First Claim
1. A method for individually identifying circular routes from a plurality of routes to a common destination, the method comprising:
- (a) maintaining a plurality of active routes to a common destination;
(b) detecting congestion on a signaling link associated with at least one of the routes;
(c) in response to detecting the congestion, testing at least one of the routes for circularity;
(d) identifying, based on the testing, at least one of the routes as circular; and
(e) in response to identifying at least one of the routes as circular, disabling the at least one route identified as circular and continuing use of remaining active routes to the destination.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods, systems, and computer program products for individually identifying and disabling circular routes from active routes to a common destination are disclosed. According to one method, multiple active routes are maintained to a common destination. Congestion is detected on a signaling link associated with at least one of the routes. In response to detecting the congestion, at least one of the routes is tested for circularity. One of the routes is identified as circular based on the testing. In response to identifying the route as circular, the route is disabled and use of the remaining active routes to the destination is continued.
-
Citations
51 Claims
-
1. A method for individually identifying circular routes from a plurality of routes to a common destination, the method comprising:
-
(a) maintaining a plurality of active routes to a common destination; (b) detecting congestion on a signaling link associated with at least one of the routes; (c) in response to detecting the congestion, testing at least one of the routes for circularity; (d) identifying, based on the testing, at least one of the routes as circular; and (e) in response to identifying at least one of the routes as circular, disabling the at least one route identified as circular and continuing use of remaining active routes to the destination. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system for individually identifying circular routes from a plurality of routes to a common destination, the system comprising:
-
(a) a route table for maintaining a plurality of active routes to a common destination; and (b) a route manager for; (i) detecting congestion on a signaling link associated with at least one of the routes; (ii) in response to detecting the congestion, testing at least one of the routes for circularity; (iii) identifying, based on the testing, at least one of the routes as circular; and (iv) in response to identifying at least one of the routes as circular, disabling the at least one route identified as circular and allowing continued use of remaining active routes to the destination. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35)
-
-
36. A computer program product comprising computer executable instructions embodied in a computer readable medium for performing steps comprising:
-
(a) maintaining a plurality of active routes to a common destination; (b) detecting congestion on a signaling link associated with at least one of the routes; (c) in response to detecting the congestion, testing at least one of the routes for circularity; (d) identifying, based on the testing, at least one of the routes as circular; and (e) in response to identifying at least one of the routes as circular, disabling the at least one route identified as circular and continuing use of remaining active routes to the destination. - View Dependent Claims (37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51)
-
Specification