H04L12/841

SYSTEMS AND METHODS FOR TRANSPORT BASED NETWORK SLICING ORCHESTRATION AND MANAGEMENT
20210320878 · 2021-10-14 ·

A network device obtains service requirements associated with a customer identifier, obtains a first profile describing an infrastructure design of multiple transport domains associated with at least one network slice of a network, and obtains a second profile describing performance characteristics of the multiple transport domains of the at least one network slice. The network device receives training data associated with performance measurements of the multiple transport domains of the at least one network slice, and updates a machine learning model based on the training data. The network device selects at least one of the multiple transport domains for orchestration using the updated machine learning model, the service requirements, the first profile, and the second profile.

DOMAIN NAME SYSTEM (DNS) OPTIMIZATION FOR WIDE AREA NETWORKS
20210320864 · 2021-10-14 ·

A method including receiving, in a controller, from a client device in a network, a resolution query specifying a host name, is provided. The method includes parsing the resolution query to determine whether the host name is associated with an core host or with a public host, and directing the resolution query to a remote domain name system server dedicated to service the core host when the host name is associated with an enterprise name. The method also includes directing the resolution query to a local domain name system server when the host name is associated with a public service provided by the public host. A system to perform the above method is also provided.

Methods and apparatus for sharing and arbitration of host stack information with user space communication stacks

Methods and apparatus for efficient data transfer within a user space network stack. Unlike prior art monolithic networking stacks, the exemplary networking stack architecture described hereinafter includes various components that span multiple domains (both in-kernel, and non-kernel). For example, unlike traditional “socket” based communication, disclosed embodiments can transfer data directly between the kernel and user space domains. Direct transfer reduces the per-byte and per-packet costs relative to socket based communication. A user space networking stack is disclosed that enables extensible, cross-platform-capable, user space control of the networking protocol stack functionality. The user space networking stack facilitates tighter integration between the protocol layers (including TLS) and the application or daemon. Exemplary systems can support multiple networking protocol stack instances (including an in-kernel traditional network stack).

Systems and methods for dynamic voice-over-internet-protocol routing
11146690 · 2021-10-12 · ·

Embodiments described herein provide a dynamic voice over Internet Protocol (VoIP) audio quality management mechanism in real time, e.g., when a VoIP call is ongoing. Specifically, when a VoIP call has unsatisfactory audio quality, e.g., due to packet loss, jitter, etc., the dynamic VoIP audio quality management mechanism may redirect the VoIP traffic from the previous endpoint that initiates the VoIP session to a different endpoint within the same carrier. Upon the endpoint redirection, a new call leg is established, allowing re-negotiation or re-configuration of VoIP parameters. The re-negotiated or re-configured VoIP parameters may then be used to conduct the remainder of the VoIP call to improve the audio quality.

METHODS, APPARATUS AND SYSTEMS FOR SATISFYING A TIME CONTROL REQUIREMENT IN A WIRELESS COMMUNICATION
20210314807 · 2021-10-07 · ·

Methods, apparatus and systems for satisfying a time control requirement in a wireless communication are disclosed. In one embodiment, a method performed by a first network node is disclosed. The method comprises: generating a timestamp associated with downlink data to be transmitted; and transmitting the downlink data with the timestamp.

SYSTEMS AND METHODS FOR IDENTIFYING CANDIDATE FLOWS IN DATA PACKET NETWORKS

A computer-implemented method and a transport manager system operate to reduce network congestion by detecting one or more data flows in a network, determining, using a candidate flow detection threshold, whether a data flow of the one or more data flows is a candidate flow, the candidate flow detection threshold being based on one or more characteristics of the one or more data flows, and in response to determining that the data flow is the candidate flow, managing the data flow. A consumption rate, a duration, a number of bytes communicated, a throughput, or aggregated characteristics of the one or more data flows may be used to determine the candidate flow detection threshold.

DYNAMIC PACKET BUFFERING DURATION

Certain aspects of the present disclosure provide techniques for packet buffering. A method that may be performed by a receiving node includes dynamically determining one or more time durations to buffer packets. The one or more time durations can be different than a time duration of a configured timer for buffering the packets. The receiving node may input one or more parameters to a machine learning algorithm and obtain, as output of the machine learning algorithm based on the input one or more parameters, one or more time durations to buffer packets. The receiving node buffers packets for the determined one or more time durations. The receiving node may use machine learning to dynamically determine the one or more time durations to buffer packet. The buffering may be at a radio link control (RLC) reassembling buffer and/or a packet data convergence protocol (PDCP) buffer.

FILTERING NETWORK TRAFFIC FROM AUTOMATED SCANNERS
20210314269 · 2021-10-07 ·

Methods, systems, and devices for filtering network traffic from automated scanner are described. A device (e.g., an application server) may receive an activity message associated with an interaction with an electronic communication message and identify, from the activity message, at least a source identifier of the activity message and one or more attributes associated with the electronic communication message. The device may then add the activity message to a mapping of source identifiers and attributes associated with previously received activity messages and classify the activity message as being associated with an automated scanner based on a comparison of the received activity message to the mapping over a previous time window. Upon classifying the activity message, the device may transmit a classification result to an external server.

Service forwarding method and network device

This application relates to the field of communications technologies, and discloses a service forwarding method and a network device that performs such method. The method includes: forwarding, by a first network device, a data packet of a first service to a second network device in a period (T.sub.1); and if the data volume of the forwarded first service reaches a threshold, forwarding, by the first network device, a data packet of a second service to the second network device. The first service is a low-latency service, and the second service is a non-low-latency service. In addition, the period (T.sub.1) is determined based on a delay allowed by a device for forwarding the data packet of the first service, and the threshold is a value determined based on a maximum transmission rate of the first service.

Data transmission method and device
11140082 · 2021-10-05 · ·

This application provides a data transmission method. The method includes: calculating a first duration based on at least one to-be-sent data flow and a first time interval, where the first time interval is a preset value, and different data flows in the at least one to-be-sent data flow have different 5-tuples; and sending a first data flow, where the first data flow belongs to the at least one to-be-sent data flow; where a first set of packets of the first data flow are sent in a first time period, a second set of packets of the first data flow are sent in a second time period following a second time interval, a duration of the first time period and a duration of the second time period are equal to the first duration, and the second time interval is greater than or equal to the first time interval.