Methods, systems and computer program products for individually identifying and disabling circular routes from a plurality of active routes to a common destination

• US 20070286083A1
• Filed: 08/25/2006
• Published: 12/13/2007
• Est. Priority Date: 06/09/2006
• Status: Abandoned Application

• Current Assignee: Tekelec
• Original Assignee: Tekelec
• Inventors: Hildebrand, John L., Khungar, Komal G., Marsico, Peter J.
• Application Number:
  US11/510,120
• Publication Number:
  US 20070286083A1
• Time in Patent Office: Days
• US Class Current: 370/238
• CPC Class Codes: H04Q 3/0025 Provisions for signalling
• CPC Class Codes: H04Q 3/66 Traffic distributors

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.

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.

2. The method of the claim 1 wherein maintaining a plurality of active routes to a common destination includes maintaining a plurality of routes that use a common destination point code (DPC) as a routing key.

3. The method of claim 2 wherein maintaining a plurality of active routes includes maintaining at least one route keyed by an originating point code (OPC) and the DPC.

4. The method of claim 3 wherein maintaining a plurality of active routes to a common destination includes maintaining at least one route keyed by a circuit identification code (CIC) and the DPC.

5. The method of claim 4 wherein maintaining a plurality of active routes to a common destination includes maintaining at least one route keyed by a service indicator (SI) and the DPC.

6. The method of claim 1 wherein detecting congestion includes determining whether a depth for a transmit queue associated with the signaling link exceeds a congestion threshold.

7. The method of claim 6 wherein testing at least one of the routes includes:

(a) generating a circular route test message based on a message in the transmit queue;

(b) routing the circular route test message; and

(c) determining whether the circular route test message has been routed back to a sender within a timeout period.

8. The method of claim 7 wherein generating a circular route test message based on a message in the transmit queue includes generating a circular route test that includes routing keys present in the message in the transmit queue.

9. The method of claim 8 wherein generating a circular route test message includes generating a circular route test message that includes at least one parameter from the message in the transmit queue in addition to the routing keys.

10. The method of claim 7 wherein the circular route test message comprises an ISDN user part (ISUP) message having a reserved message type and a payload identifying the message as a circular route test message.

11. The method of claim 7 wherein the circular route test message comprises a network management message having a reserved h0h1 value and a payload identifying the message as a circular route test message.

12. The method of claim 7 wherein the circular route test message comprises a signaling connection control part (SCCP) message having a reserved message type and a payload identifying the message as a circular route test message.

13. The method of claim 1 wherein testing at least one of the routes includes testing a route for which a number of messages in a transmit queue associated with the signaling link exceeds a threshold.

14. The method of claim 1 wherein the signaling link comprises an SS7 over time-division multiplexed (TDM) signaling link.

15. The method of claim 1 wherein the signaling link comprises an SS7 over asynchronous transfer mode (ATM) signaling link.

16. The method of claim 1 wherein the signaling link comprises an SS7 over Internet protocol (IP) signaling link.

17. The method of claim 1 wherein testing at least one of the routes includes generating a circular route test message on a signaling link interface module associated with the signaling link and informing other signaling link interface modules of the initiation of the circular route testing.

18. The method of claim 1 wherein initiating circular route testing includes initiating circular route testing for a signaling message received from a first domain and destined for a second domain that is different from the first domain.

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.

20. The system of claim 19 wherein the route table includes a plurality of routes that use a common destination point code (DPC) as a routing key.

21. The system of claim 20 wherein the route table includes at least one route keyed by an originating point code (OPC) and the DPC.

22. The system of claim 20 wherein the route table includes at least one route keyed by a circuit identification code (CIC) and the DPC.

23. The system of claim 20 wherein the route table includes a route keyed by a service indicator (SI) and the DPC.

24. The system of claim 19 wherein, in detecting the congestion, the route manager is adapted to determine whether a depth for a transmit queue associated with the signaling link exceeds a congestion threshold.

25. The system of claim 24 wherein the route manager, in testing at least one of the routes, is adapted to:

(a) generate a circular route test message based on a message in the transmit queue;

(b) route the circular route test message; and

(c) determine whether the circular route test message has been routed back to a sender within a timeout period.

26. The system of claim 25 wherein the circular route test message includes routing keys present in the message in the transmit queue.

27. The system of claim 26 wherein the circular route test message includes at least one parameter from the message in the transmit queue in addition to the routing keys.

28. The system of claim 25 wherein the circular route test message comprises an ISDN user part (ISUP) message having a reserved message type and a payload identifying the message as a circular route test message.

29. The system of claim 25 wherein the circular route test message comprises a network management message having a reserved h0h1 value and a payload identifying the message as a circular route test message.

30. The system of claim 25 wherein the circular route test message comprises a signaling connection control part (SCCP) message having a reserved message type and a payload identifying the message as a circular route test message.

31. The system of claim 19 wherein the route manager is adapted to test for circularity a route for which a number of messages in a transmit queue associated with the signaling link exceeds a threshold.

32. The system of claim 19 wherein the signaling link comprises an SS7 over time-division-multiplexed (TDM) signaling link.

33. The system of claim 19 wherein the signaling link comprises an SS7 over asynchronous transfer mode (ATM) signaling link.

34. The system of claim 19 wherein the signaling link comprises an SS7 over Internet protocol (IP) signaling link.

35. The system of claim 19 wherein the signaling message originates from a first domain of a first type and is destined for a second domain of a second type different from the first type.

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.

37. The computer program product of claim 36 wherein maintaining a plurality of active routes to a common destination includes maintaining a plurality of routes that use a common destination point code (DPC) as a routing key.

38. The computer program product of claim 37 wherein maintaining a plurality of active routes includes maintaining at least one route keyed by an originating point code (OPC) and the DPC.

39. The computer program product of claim 37 wherein maintaining a plurality of active routes to a common destination includes maintaining at least one route keyed by a circuit identification code (CIC) and the DPC.

40. The computer program product of claim 37 wherein maintaining a plurality of active routes to a common destination includes maintaining at least one route keyed by a service indicator (SI) and the DPC.

41. The computer program product of claim 36 wherein detecting congestion includes determining whether a depth for a transmit queue associated with the signaling link exceeds a congestion threshold.

42. The computer program product of claim 36 wherein testing at least one of the routes includes:

(a) generating a circular route test message based on a message in the transmit queue;

(b) routing the circular route test message; and

(c) determining whether the circular route test message has been routed back to a sender within a timeout period.

43. The computer program product of claim 42 wherein generating a circular route test message based on a message in the transmit queue includes generating a circular route test message that includes routing keys present in the message in the transmit queue.

44. The computer program product of claim 43 wherein generating a circular route test message includes generating a circular route test message that includes at least one parameter from the message in the transmit queue in addition to the routing keys.

45. The computer program product of claim 42 wherein the circular route test message comprises an ISDN user part (ISUP) message having a reserved message type and a payload identifying the message as a circular route test message.

46. The computer program product of claim 42 wherein the circular route test message comprises a network management message having a reserved h0h1 value and a payload identifying the message as a circular route test message.

47. The computer program product of claim 42 wherein the circular route test message comprises a signaling connection control part (SCCP) message having a reserved message type and a payload identifying the message as a circular route test message.

48. The computer program product of claim 36 wherein testing at least one of the routes includes testing a route for which a number of messages in a transmit queue associated with the signaling link exceeds a threshold.

49. The computer program product of claim 36 wherein the signaling link comprises an SS7 over time-division multiplexed (TDM) signaling link.

50. The computer program product of claim 36 wherein the signaling link comprises an SS7 over asynchronous transfer mode (ATM) signaling link.

51. The computer program product of claim 36 wherein the signaling link comprises an SS7 over Internet protocol (IP) signaling link.