EP-4740573-A1 - METHOD AND SYSTEM FOR AUTOMATICALLY DIVERTING A NETWORK TRAFFIC TO A TIME EFFICIENT PATH

EP4740573A1EP 4740573 A1EP4740573 A1EP 4740573A1EP-4740573-A1

Abstract

The present disclosure relates to a method and a system for automatically diverting a network traffic to a time efficient path The disclosure encompasses fetching, at a Service Communication Proxy performance automated intelligence (SCP-pAI) engine [301], a set of statistics data associated with traffic route paths; identifying one or more time efficient paths based on the set of statistics data; determining a target time efficient paths from the one or more time efficient paths based on the set of statistics data; and automatically facilitating routing of the network traffic via a target time efficient path.

Inventors

BISHT, SANDEEP
BHATNAGAR, AAYUSH
SINHA, ANURAG
Ansari, Ezaj
YADAV, RAVINDRA
PANDEY, PRASHANT

Assignees

Jio Platforms Limited

Dates

Publication Date: 20260513
Application Date: 20240612

Claims (1)

We Claim: 1. A method [400] for automatically diverting a network traffic to a time efficient path, the method [400] comprising: fetching, by a fetching unit [302], at a Service Communication Proxy performance automated intelligence (SCP-pAI) engine [301], a set of statistics data associated with each path from a set of traffic route paths between a first node [3 OOf] and a target node [300t]; identifying, by an identification unit [303], at the SCP-pAI engine [301], one or more time-efficient paths between the first node [3 OOf] and the target node [3 OOt] based on the set of network statistics data; determining, by a determination unit [304] , at the SCP-pAI engine [301 ] , a target time efficient paths from the one or more time-efficient paths between the first node [3 OOf] and the target node [3 OOt] based on the set of statistics data; and automatically facilitating, routing at the SCP-pAI engine [301], by a routing unit [305], of the network traffic between the first node [300f] and the target node [300t] via the target time efficient path. 2. The method [400] as claimed in claim 1, further comprising: identifying, by a Service Communication Proxy (SCP) [306], the network traffic between the first node [300f] and the target node [300t]; identifying, by the SCP [306], a predetermined traffic route path based on the network traffic between the first node [300f] and the target node [300t]; identifying, by the SCP [306], the set of traffic route paths between the first node [300f] and the target node [300t]; and - providing, by the SCP [306], to the SCP-pAI engine [301], the set of traffic route paths. 3. The method [400] as claimed in claim 1, wherein the set of network statistics data comprises at least one of a network statistics associated with each path of the set of traffic route paths, a performance statistics associated with each path of the set of traffic route paths and a system statistics associated with each path of the set of traffic route paths. 4. The method [400] as claimed in claim 1, wherein the SCP-pAI engine [301] is an artificialintelligence based engine trained based on a historical statistical data. 5. The method [400] as claimed in claim 3, wherein the network statistics is at least one of a Round Trip Time (RTT) statistics associated with each path from the set of traffic route paths, an available bandwidth statistics associated with the each path from the set of traffic route paths, wherein the performance statistics is at least a current load statistics associated with the each path from the set of traffic route paths, and wherein the system statistics is at least one of a Random-Access Memory (RAM) statistics associated with the each path from the set of traffic route paths, a Central Processing Unit (CPU) statistics associated with the each path from the set of traffic route paths, and a storage utilisation statistics associated with the each path from the set of traffic route paths. 6. The method [400] as claimed in claim 5, wherein identifying by the identification unit [303] at the SCP-pAI engine [301] the one or more time-efficient paths between the first node [3 OOf] and the target node [3 OOt] further comprises: - generating, by the identification unit [303], a sorted set of traffic route paths based on sorting the set of traffic route paths between the first node [3 OOf] and the target node [3 OOt] in a predefined order, wherein the predefined order is based on the network statistics associated with the each path from the set of traffic route paths; determining, by the identification unit [303], at least one of the current load statistics associated with the each path from the sorted set of traffic route paths, a maximum supported traffic load associated with the each path from the sorted set of traffic route paths and a traffic requirement of at least one of the first node [300f] and the target node [300t] ; and identifying, by the identification unit [303], the one or more time-efficient paths between the first node [3 OOf] and the target node [3 OOt] based on at least the maximum supported traffic load associated with the each path from the sorted set of traffic route paths. 7. The method [400] as claimed in claim 1, the method [400] further comprises computing a latency associated with each path from the set of traffic route paths, and wherein the target time efficient path from the one or more time efficient paths between the first node [3 OOf] and the target node [300t] is determined by the determination unit [304] based on the latency associated with each path from the set of traffic route paths. 8. The method [400] as claimed in claim 1, wherein the automatically facilitating routing of the network traffic between the first node [3 OOf] and the target node [300t] via the target time efficient path is further based on initiating, by the SCP-pAI engine [301], an update registration procedure to update one or more registrations details associated with the network traffic and a predetermined traffic route path between the first node [3 OOf] and the target node [300t], 9. The method [400] as claimed in claim 1, further comprising: identifying, by the identification unit [303], at the SCP-pAI engine [301], a latency fluctuation associated with one or more traffic route paths from the set of traffic route paths; and - generating, by an alert unit [307], at the SCP-pAI engine [301], one or more alerts based on the identified latency fluctuation. 10. The method [400] as claimed in claim 8, wherein the update registration procedure comprises: - transmitting, by a transceiver unit [308], to the SCP [306], a trigger to update the one or more registrations details; and re-registering, to a controller [309], the one or more registrations details based on the trigger. 11. The method [400] as claimed in claim 10, wherein the update registration procedure further comprises: - sending, by the controller [309], to a Network Repository Function (NRF) [310], an update registration request; and - sending, by the controller [309], a broadcast message comprising the one or more registrations details to all SCP [306], 12. The method [400] as claimed in claim 11, wherein the update registration procedure further comprises: - sending by the NRF [310] to at least one of the first node [3 OOf] and the target node [3 OOt] , the one or more registrations details. 13. A system [300] for automatically diverting a network traffic to a time efficient path, the system [300] comprises: a Service Communication Proxy performance automated intelligence (SCP-pAI) engine [301], the SCP-pAI engine [301] further comprising: o a fetching unit [302] configured to: • fetch a set of network statistics data associated with each path from a set of traffic route paths between a first node [3 OOf] and a target node [3 OOt] ; o an identification unit [303] connected to at least the fetching unit [302], the identification unit [303] configured to: • identify one or more time -efficient paths between the first node [3 OOf] and the target node [3 OOt] based on the set of network statistics data; o a determination unit [304] connected to at least the identification unit [303], the determination unit [304] configured to determine a target time efficient path from the one or more time-efficient paths between the first node [3 OOf] and the target node [3 OOt] based on the set of network statistics data; and o a routing unit [305] connected to at least the determination unit [304], the routing unit [305] configured to automatically facilitate routing of the network traffic between the first node [3 OOf] and the target node [3 OOt] via the target time efficient path. 14. The system [300] as claimed in claim 13, wherein the SCP-pAI engine [301] is in communication with a Service Communication Proxy (SCP) [306], wherein the SCP [306] is configured to: identify the network traffic between the first node [3 OOf] and the target node [300t]; identify a predetermined traffic route path based on the network traffic between the first node [3 OOf] and the target node [300t]; identify the set of traffic route paths between the first node [3 OOf] and the target node [300t]; and - provide to the SCP-pAI engine [301], the set of traffic route paths. 15. The system [300] as claimed in claim 13, wherein the set of network statistics data comprises at least one of a network statistics associated with each path of the set of traffic route paths, a performance statistics associated with each path of the set of traffic route paths and a system statistics associated with each path of the set of traffic route paths. 16. The system [300] as claimed in claim 13, wherein the SCP-pAI engine [301] is an artificialintelligence based engine trained based on a historical statistical data. 17. The system [300] as claimed in claim 15, wherein the network statistics is at least one of a round trip time statistics associated with each path from the set of traffic route paths, an available bandwidth statistics associated with the each path from the set of traffic route paths, wherein the performance statistics is at least a current load statistics associated with the each path from the set of traffic route paths, and wherein the system statistics is at least one of a Random-Access Memory (RAM) statistics associated with the each path from the set of traffic route paths, a Central Processing Unit (CPU) statistics associated with the each path from the set of traffic route paths, and a storage utilisation statistics associated with the each path from the set of traffic route paths. 18. The system [300] as claimed in claim 17, wherein to identify the one or more time-efficient paths between the first node [300f] and the target node [3 OOt] , the identification unit [303] is further configured to: - generate a sorted set of traffic route paths based on sorting the set of traffic route paths between the first node [3 OOf] and the target node [3 OOt] in a predefined order, wherein the predefined order is based on the network statistics associated with the each path from the set of traffic route paths; determine at least one of the current load statistics associated with the each path from the sorted set of traffic route paths, a maximum supported traffic load associated with the each path from the sorted set of traffic route paths and a traffic requirement of at least one of the first node [300f] and the target node [300t]; and identify, the one or more time-efficient paths between the first node [300f] and the target node [3 OOt] based on at least the maximum supported traffic load associated with the each path from the sorted set of traffic route paths. 19. The system [300] as claimed in claim 13, wherein the determination unit [304] is further configured to compute a latency associated with each path from the set of traffic route paths, and wherein the target time efficient path from the one or more time efficient paths between the first node [300f] and the target node [3 OOt] is determined by the determination unit [304] based on the latency associated with each path from the set of traffic route paths. 20. The system [300] as claimed in claim 14, wherein the routing unit [305] is configured to automatically facilitate routing of the network traffic between the first node [300f] and the target node [3 OOt] via the target time efficient path, further based on initiating by the SCP-pAI engine [301], an update registration procedure to update one or more registrations details associated with the network traffic and the predetermined traffic route path between the first node [300f] and the target node [300t]. 21. The system [100] as claimed in claim 13, wherein: - the identification unit [303] is further configured to identify a latency fluctuation associated with one or more traffic route paths from the set of traffic route paths; and an alert unit [307] is configured to generate one or more alerts based on the identified latency fluctuation. 22. The system [100] as claimed in claim 20, wherein to perform the update registration procedure, the system [100] further comprising: a transceiver unit [308] configured to transmit to the SCP [306], a trigger to update the one or more registrations details; and re-register, to a controller [309], the one or more registrations details based on the trigger. 23. The system [300] as claimed in claim 22, wherein to perform the update registration procedure, the controller [309] is configured to: - send to a Network Repository Function (NRF) [310], an update registration request, and - send a broadcast message comprising the one or more registrations details to all SCPs [306], 24. The system [300] as claimed in claim 23, wherein to perform the update registration procedure: - the NRF [310] is configured to send to at least one of the first node [300f] and the target node [3 OOt] , the one or more registrations details. 25. A non-transitory computer-readable storage medium for automatically diverting a network traffic to a time efficient path, the storage medium comprising executable code which, when executed by one or more units of a Service Communication Proxy performance automated intelligence (SCP-pAI) engine [301] of a system [100], causes: o a fetching unit [302] to: • fetch a set of network statistics data associated with each path from a set of traffic route paths between a first node [3 OOf] and a target node [3 OOt] ; an identification unit [303] to: • identify one or more time -efficient paths between the first node [3 OOf] and the target node [3 OOt] based on the set of network statistics data; a determination unit [304] to determine a target time efficient path from the one or more time-efficient paths between the first node [300f] and the target node [3 OOt] based on the set of network statistics data; and a routing unit [305] to automatically facilitate routing of the network traffic between the first node [3 OOf] and the target node [3 OOt] via the target time efficient path.

Description

METHOD AND SYSTEM FOR AUTOMATICALLY DIVERTING A NETWORK TRAFFIC TO A TIME EFFICIENT PATH TECHNICAL FIELD [0001] Embodiments of the present disclosure generally relate to network performance management systems. More particularly, embodiments of the present disclosure relate to systems and methods for automatically diverting a network traffic to a time efficient path. BACKGROUND [0002] The following description of the related art is intended to provide background information pertaining to the field of the disclosure. This section may include certain aspects of the art that may be related to various features of the present disclosure. However, it should be appreciated that this section is used only to enhance the understanding of the reader with respect to the present disclosure, and not as admissions of the prior art. [0003] Wireless communication technology has rapidly evolved over the past few decades, with each generation bringing significant improvements and advancements. The first generation of wireless communication technology was based on analog technology and offered only voice services. However, with the advent of the second-generation (2G) technology, digital communication and data services became possible, and text messaging was introduced. The third- generation (3G) technology marked the introduction of high-speed internet access, mobile video calling, and location-based services. The fourth-generation (4G) technology revolutionized wireless communication with faster data speeds, better network coverage, and improved security. Currently, the fifth-generation (5G) technology is being deployed, promising even faster data speeds, low latency, and the ability to connect multiple devices simultaneously. With each generation, wireless communication technology has become more advanced, sophisticated, and capable of delivering more services to its users. [0004] In a 5G cellular communication, a re-routing of the traffic load is needed due to various factors such as to latency factor, load factor, bandwidth factor, etc. to make sure that communication network is stable and running smoothly. A Service Communication Proxy (SCP) is a solution deployed along side of 5G Network Functions (NF) for providing routing control, resiliency, and observability to the core network. The rerouting of the traffic load is done from one SCP to another SCP. [0005] Further, over the period of time various solutions have been developed to improve the performance of communication devices to provide a trained model for intelligent route recommendation in a cellular communication. However, there are certain challenges with existing solutions. In the existing art, the rerouting of the traffic load is done by manually checking and verifying the existing traffic load on one or more SCPs installed at various geographic locations to understand the latency factor, load factor, bandwidth factor, etc. at the one or more SCPs to identify an ideal SCP to divert the traffic load. This manual checking and verification of the one or more SCPs installed at various geographic locations is a time-consuming, cumbersome, and error-prone process. Further, it is difficult and cumbersome to analyze all the parameters required to select an ideal route to divert the traffic load. [0006] Thus, there exists an imperative need in the art to provide a trained model for intelligent route recommendation in a cellular communication to make sure that communication network is stable and running smoothly and a solution for automatically diverting a network traffic to a time efficient path, which the present disclosure aims to address. SUMMARY OF THE DISCLOSURE [0007] This section is provided to introduce certain aspects of the present disclosure in a simplified form that are further described below in the detailed description. This summary is not intended to identify the key features or the scope of the claimed subject matter. [0008] An aspect of the present disclosure may relate to a method for automatically diverting a network traffic to a time efficient path. The method comprises fetching, by a fetching unit, at a Service Communication Proxy performance automated intelligence (SCP-pAI) engine, a set of statistics data associated with each path from a set of traffic route paths between a first node and a target node. The method further comprises identifying, by an identification unit, at the SCP-pAI engine, one or more time efficient paths between the first node and the target node based on the set of statistics data. The method further comprises determining, by a determination unit, at the SCP-pAI engine, a target time efficient paths from the one or more time efficient paths between the first node and the target node based on the set of statistics data; and automatically facilitating, routing at the SCP-pAI engine, by a routing unit, of the network traffic between the first node and the target node via the target time efficient path. [0009] In an exemplar