US2023199090A1PendingUtilityA1

Micro-level network node failover system

Assignee: T MOBILE USA INCPriority: Jun 27, 2018Filed: Feb 17, 2023Published: Jun 22, 2023
Est. expiryJun 27, 2038(~11.9 yrs left)· nominal 20-yr term from priority
G06F 11/2005G06F 11/2028H04L 69/40H04L 41/0668H04L 45/22H04L 41/0677H04L 43/16H04L 45/28
70
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

An improved core network that can monitor micro-level issues, identify specific services of specific nodes that may be causing an outage, and perform targeted node failovers in a manner that does not cause unnecessary disruptions in service is described herein. For example, the improved core network can include a failover and isolation server (FIS) system. The FIS system can obtain service-specific KPIs from the various nodes in the core network. The FIS can then compare the obtained KPI values of the respective service with corresponding threshold values. If any KPI value exceeds a corresponding threshold value, the FIS may preliminarily determine that the service of the node associated with the KPI value is responsible for a service outage. The FIS can initiate a failover operation, which causes the node to re-route any received requests corresponding to the service potentially responsible for the service outage to a redundant node.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A computer-implemented method comprising:
 obtaining node data for one or more nodes in a core network that offers a first service;   generating a service request graph using the node data;   determining a first node in the one or more nodes that is redundant of a second node in the one or more nodes using the service request graph; and   in response to a determination that the second node satisfies a condition, performing a failover operation with respect to the second node to allow the first node to perform one or more operations in place of the second node in association with the first service.   
     
     
         2 . The computer-implemented method of  claim 1 , wherein generating a service request graph further comprises:
 identifying that the second node and a third node in the one or more nodes processed a first request associated with the first service using the node data;   determining an order in which the second node and the third node processed the first request; and   generating a path for the first service for inclusion in the service request graph based on the determined order.   
     
     
         3 . The computer-implemented method of  claim 2 , wherein generating a service request graph further comprises:
 identifying that the first node processed a second request associated with the first service using the node data; and   generating a second path for the first service for inclusion in the service request graph that includes an identification of the first node.   
     
     
         4 . The computer-implemented method of  claim 1 , wherein generating a service request graph further comprises:
 determining that the second node offers the first service and communicates with a third node in the one or more nodes that offers the first service using the node data; and   generating a path for the first service for inclusion in the service request graph based on the determining that the second node and the third node offer the first service.   
     
     
         5 . The computer-implemented method of  claim 1 , wherein the node data comprises an indication of a request associated with the first service that is processed by the one or more nodes. 
     
     
         6 . The computer-implemented method of  claim 1 , wherein the first node and the second node perform the same operations. 
     
     
         7 . The computer-implemented method of  claim 1 , wherein the first service is one of a file transfer service, a voice call service, a call waiting service, a conference call service, a video chat service, or a short message service (SMS). 
     
     
         8 . The computer-implemented method of  claim 1 , wherein the first node comprises one of a session border controller (SBC), a call session control function (CSCF), a breakout gateway control function (BGCF), or a media gateway controller function (MGCF). 
     
     
         9 . Non-transitory, computer-readable storage media comprising computer-executable instructions, wherein the computer-executable instructions, when executed by a computer system, cause the computer system to:
 obtain node data for one or more nodes in a core network that offers a first service;   generate a service request graph using the node data;   determine a first node in the one or more nodes that is redundant of a second node in the one or more nodes using the service request graph; and   in response to a determination that the second node satisfies a condition, perform a failover operation with respect to the second node to allow the first node to perform one or more operations in place of the second node in association with the first service.   
     
     
         10 . The non-transitory, computer-readable storage media of  claim 9 , wherein the computer-executable instructions further cause the computer system to:
 identify that the second node and a third node in the one or more nodes processed a first request associated with the first service using the node data;   determine an order in which the second node and the third node processed the first request; and   generate a path for the first service for inclusion in the service request graph based on the determined order.   
     
     
         11 . The non-transitory, computer-readable storage media of  claim 10 , wherein the computer-executable instructions further cause the computer system to:
 identify that the first node processed a second request associated with the first service using the node data; and   generate a second path for the first service for inclusion in the service request graph that includes an identification of the first node.   
     
     
         12 . The non-transitory, computer-readable storage media of  claim 9 , wherein the computer-executable instructions further cause the computer system to:
 determine that the second node offers the first service and communicates with a third node in the one or more nodes that offers the first service using the node data; and   generate a path for the first service for inclusion in the service request graph based on the determining that the second node and the third node offer the first service.   
     
     
         13 . The non-transitory, computer-readable storage media of  claim 9 , wherein the node data comprises an indication of a request associated with the first service that is processed by the one or more nodes. 
     
     
         14 . The non-transitory, computer-readable storage media of  claim 9 , wherein the first node and the second node perform the same operations. 
     
     
         15 . The non-transitory, computer-readable storage media of  claim 9 , wherein the first service is one of a file transfer service, a voice call service, a call waiting service, a conference call service, a video chat service, or a short message service (SMS). 
     
     
         16 . The non-transitory, computer-readable storage media of  claim 9 , wherein the first node comprises one of a session border controller (SBC), a call session control function (CSCF), a breakout gateway control function (BGCF), or a media gateway controller function (MGCF). 
     
     
         17 . A core network comprising:
 one or more nodes that each offer a first service; and   a server comprising a processor in communication with the one or more nodes and configured with specific computer-executable instructions to: 
 obtain node data for one or more nodes in a core network that offers a first service; 
 generate a service request graph using the node data; 
 determine a first node in the one or more nodes that is redundant of a second node in the one or more nodes using the service request graph; and 
 in response to a determination that the second node satisfies a condition, perform a failover operation with respect to the second node to allow the first node to perform one or more operations in place of the second node in association with the first service. 
   
     
     
         18 . The core network of  claim 17 , wherein the server is further configured with specific computer-executable instructions to:
 identify that the second node and a third node in the one or more nodes processed a first request associated with the first service using the node data;   determine an order in which the second node and the third node processed the first request; and   generate a path for the first service for inclusion in the service request graph based on the determined order.   
     
     
         19 . The core network of  claim 18 , wherein the server is further configured with specific computer-executable instructions to:
 identify that the first node processed a second request associated with the first service using the node data; and   generate a second path for the first service for inclusion in the service request graph that includes an identification of the first node.   
     
     
         20 . The core network of  claim 17 , wherein the server is further configured with specific computer-executable instructions to:
 determine that the second node offers the first service and communicates with a third node in the one or more nodes that offers the first service using the node data; and   generate a path for the first service for inclusion in the service request graph based on the determining that the second node and the third node offer the first service.

Join the waitlist — get patent alerts

Track US2023199090A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.