Methods, systems, and computer program products for reducing signaling link congestion

• US 20070014294A1
• Filed: 08/12/2005
• Published: 01/18/2007
• Est. Priority Date: 08/12/2004
• Status: Active Grant

• Current Assignee: Tekelec Global, Inc. (Oracle Corporation)
• Original Assignee: Tekelec
• Inventors: Delaney, Robert, Palmer, Jonathan, Hildebrand, John
• Granted Patent: US 7,693,066 B2
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 43/0817 by checking functioning
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery

Abstract

Methods, systems, and computer program products for reducing the likelihood of signaling link congestion on a failing or recovering signaling linkset are disclosed. According to one aspect, a method for reducing or eliminating congestion on a recovered link in a previously failed linkset due to the routing of post-global title (GT) translated signaling message traffic is disclosed. When the first link in a previously failed linkset becomes available, routes associated with the recovering linkset are marked as restricted. GT translated messages are directed to the lowest cost route that is marked as allowed. If no routes are marked as allowed, messages are directed to the lowest cost route that is marked as restricted. When a predetermined number or percentage of the links in a linkset become available, routes associated with the recovering linkset are marked as allowed.

Claims

1. A method for determining the status of a route to a signaling destination, the method comprising:

(a) detecting a change in status associated with a signaling link in a signaling linkset;

(b) in response to detecting the change in the status, determining whether a number of available signaling links in the linkset has a first or a second relationship with respect to a threshold value;

(c) in response to determining that the number of available signaling links in the linkset is has the first relationship with respect to the threshold value, indicating that a route associated with the linkset is allowed; and

(d) in response to determining that the number of available signaling links in the linkset has the second relationship with respect to the threshold value, indicating that the route associated with the linkset is restricted.

2. The method of claim 1 comprising determining whether the number of available signaling links in the linkset is zero, and, in response to determining that the number of available signaling links in the linkset is zero, indicating that the linkset is unavailable.

3. The method of claim 1 wherein the first predetermined relationship includes the number of available signaling links being greater than the threshold value.

4. The method of claim 1 wherein the second predetermined relationship includes the number of available signaling links being less than or equal to the threshold value.

5. The method of claim 1 comprising maintaining a status of the route in a routing table and wherein indicating that the route is restricted includes marking the route status as restricted in the routing table.

6. The method of claim 1 wherein indicating that the route is restricted includes communicating a restricted status for the route among processor modules in a routing system.

7. The method of claim 1 wherein indicating that the route is restricted includes sending a transfer restricted (TFR) message to at least one adjacent node.

8. The method of claim 1 comprising refraining from routing messages over the restricted route in response to determining that an alternate route to the destination exists.

9. The method of claim 1 routing messages over the restricted route in response to determining that the restricted route is the last available route to the destination.

11. The method of claim 1 wherein receiving a signaling message includes receiving a signaling message at a routing node, the signaling message being global-title-addressed to the signaling destination.

10. A method for selecting a route to a signaling destination, the method comprising:

(a) receiving a signaling message having a signaling destination;

(b) determining whether an allowed route exists to the signaling destination;

(c) in response to determining that an allowed route to the signaling destination exists, selecting the allowed route to the destination;

(d) in response to determining that an allowed route to the signaling destination does not exist, selecting a restricted route to the destination; and

(e) routing the signaling message over the selected route.

12. The method of claim 10 wherein selecting the allowed route to the destination includes selecting a lowest cost allowed route to the destination.

13. The method of claim 10 wherein selecting a restricted route to the destination includes selecting a lowest cost restricted route to the destination.

14. The method of claim 10 wherein determining whether an allowed route exists to a signaling destination includes examining route status information contained in a routing table.

15. A method for managing and administering cost-weighted signaling routes, the method comprising:

(a) detecting a first change in status associated with a signaling link in a linkset; and

(b) in response to detecting the first change in the status of a signaling link associated with a linkset;

(i) determining whether the number of available signaling links in the linkset has a first relationship with respect to a threshold value;

(ii) determining whether a first route associated with the linkset is a lowest cost route to a destination;

(iii) determining whether the first route is allowed; and

(iv) in response to determining that the number of available signaling links has the first predetermined relationship, the first route is the lowest cost route, and the first route is allowed, indicating that the first route is restricted and initiating a change-over process to direct signaling messages from adjacent nodes to a second route having a higher cost than the first route.

16. The method of claim 15 comprising:

(a) detecting a second change in status associated with at least one signaling link in the linkset; and

(b) in response to detecting the second change in status;

(i) determining whether the number of available signaling links in the linkset has a second predetermined relationship with respect to the threshold value; and

(ii) in response to determining that the number of available signaling links has the second predetermined relationship with respect to the threshold value, indicating that the first route is allowed and initiating a changeback procedure to switch signaling messages sent from adjacent nodes from the second route to the first route.

17. A system for routing a signaling message, the system comprising:

(a) a communication interface for sending and receiving signaling messages;

(b) a routing address translation function for receiving a signaling message from the communication interface and performing routing address translation processing; and

(c) a routing function for;

(i) receiving a signaling message that has undergone routing address translation processing and that is addressed to a signaling destination determined by the routing address translation processing;

(ii) determining whether an allowed route to the signaling destination exists;

(iii) in response to determining that an allowed route to the signaling destination exists, selecting the allowed route to the destination;

(v) in response to determining that an allowed route to the signaling destination does not exist, selecting a restricted route to the destination; and

(vi) routing the signaling message over the selected route.

18. The system of claim 17 where the communication interface comprises a link interface module (LIM).

19. The system of claim 17 where the communication interface comprises a data communications module (DCM) module.

20. The system of claim 17 where the communication interface comprises a high-speed link (HSL) module.

21. The system of claim 17 wherein the routing address translation function is located on a database services module (DSM).

22. The system of claim 17 wherein the routing address translation function includes a global title translation application.

23. The system of claim 17 wherein the routing address translation function includes a flexible home location register (HLR) routing application.

24. The system of claim 17 wherein the routing address translation function includes a number portability application.

25. The system of claim 17 wherein the routing address translation function includes an E.164 numbering (ENUM) application.

26. The system of claim 17 wherein the routing function is adapted to receive an MTP-routed signaling message that does not require routing address translation and to perform steps (c)(ii)-c(iv) for the MTP-routed signaling message.

27. The system of claim 17 wherein selecting an allowed route to the destination includes selecting the lowest cost allowed route to the destination.

28. The system of claim 17 wherein selecting a restricted route to the destination includes selecting the lowest cost restricted route to the destination.

29. The system of claim 17 comprising a network management function for generating a transfer restricted message in response to determining that a route is restricted.

30. A computer program product comprising computer-executable instructions embodied in a computer-readable medium for performing steps comprising:

(a) detecting a change in status associated with a signaling link in a signaling linkset;

(b) in response to detecting the change in the status, determining whether a number of available signaling links in the linkset has a first or a second relationship with respect to a threshold value;

(c) in response to determining that the number of available signaling links in the linkset is has the first relationship with respect to the threshold value, indicating that a route associated with the linkset is allowed; and

(d) in response to determining that the number of available signaling links in the linkset has the second predetermined relationship with respect to the threshold value, indicating that the route associated with the linkset is restricted.