H04L47/627

Queue management in a forwarder

A queue management method, system, and recording medium include Selective Acknowledgments (SACK) examining to examine SACK blocks of a forwarder to selectively drop packets in a forward flow queue based on a reverse flow queue and MultiPath Transmission Control Protocol (MPTCP) examining configured to perform a first examining to examine multipath headers to recognize MPTCP flows based on a comparison between two subflows being a part of a same superflow and a second examining to examine the reverse flow queue to determine if redundant data has been sent based on a result of the first examining, a packet in the forward flow queue from a prior transmission being dropped from the forward flow queue sent from the forwarder to a receiver if a metadata of the packet does not match a metadata of an acknowledged packet in the reverse flow queue.

Packet processing technique for a communication network

A system comprising one or more network elements and configured to process at least first and second packet flows. The system comprises a first packet gate selectively switchable between an open state for packet transmission and a closed state and an associated first packet queue. The first packet gate and the first packet queue are configured to handle first packet flow packets. The system further comprises a second packet queue configured to handle second packet flow packets. Moreover, the system comprises at least one processor configured to control switching of the first packet gate between the open state and the closed state based on the occurrence of a first event associated with the second packet queue to trigger transmission of the first packet flow packets in a relative transmission order among the first packet flow packets and the second packet flow packets.

System and method for service level agreement assurance in transport domain

A method, a system, and a non-transitory storage medium are described in which an adaptive packet scheduling and policy service is provided. The adaptive packet scheduling and policy service may provide adaptive packet scheduling in a transport domain of a network based on adaptive packet scheduling policies and network information. The adaptive packet scheduling and policy service may be applied to assured network services. The adaptive packet scheduling and policy service may also provide transport domain budgeting based on service level agreement violations associated with transport devices in the transport domain.

FLOW CONTROL METHOD, APPARATUS, AND DEVICE, AND COMPUTER-READABLE STORAGE MEDIUM
20230300082 · 2023-09-21 · ·

A flow control method, apparatus, and device, and a computer-readable storage medium, and belongs to the field of communication technologies. The method includes: determining, by a flow control apparatus, a first backpressure level of a first port, where the first backpressure level indicates a congestion degree of the first port; determining a flow control policy corresponding to the first backpressure level, where the flow control policy is determined based on a user type and a user traffic attribute; and controlling, according to the flow control policy, traffic entering a cache queue of the first port, where different backpressure levels correspond to different flow control policies. The flow control policy is determined based on a user type and a user traffic attribute, and a granularity of flow control is refined to traffic of every user type.

SYSTEM AND METHOD FOR SERVICE LEVEL AGREEMENT ASSURANCE IN TRANSPORT DOMAIN
20210367892 · 2021-11-25 ·

A method, a system, and a non-transitory storage medium are described in which an adaptive packet scheduling and policy service is provided. The adaptive packet scheduling and policy service may provide adaptive packet scheduling in a transport domain of a network based on adaptive packet scheduling policies and network information. The adaptive packet scheduling and policy service may be applied to assured network services. The adaptive packet scheduling and policy service may also provide transport domain budgeting based on service level agreement violations associated with transport devices in the transport domain.

COMMUNICATION SYSTEM, COMMUNICATION APPARATUS AND BANDWIDTH ALLOCATION METHOD

A communication system includes a subscriber network unit and a communication device provided in an accommodating station. The subscriber network unit includes an acquisition unit that acquires uplink data from one or more lower-layer devices. The communication device includes: a data processing unit that acquires the uplink data from the subscriber network unit using a band of uplink communication and executes data processing on the acquired uplink data; a policy determination unit that determines a policy of band allocation of the uplink communication on the basis of the result of the data processing; and an allocation control unit that allocates the band of the uplink communication to the subscriber network unit on the basis of the policy.

Resource access policy enforcement using a hypergraph

A method trains a neural network to recognize whether a resource is authorized to be returned to a requester. One or more processors train a neural network to traverse a policy enforcement hypergraph in order to identify a security policy to be used for a resource request and to authorize a use of a requested resource by a requester. The policy enforcement hypergraph is derived from a policy enforcement graph that expresses a set of security profiles for resources and requesters. The processor(s) receive a resource request for a requested resource from a requester, where the resource request includes a description of the requester. A system/user inputs a description of the received resource request and a description of the policy enforcement hypergraph into the trained neural network in order to selectively return the requested resource to the requester.

AUTOMATIC FLOW MANAGEMENT
20220014473 · 2022-01-13 ·

Packet-switching operations in a network device are managed based on the detection of excessive-rate traffic flows. A network device receives a data unit, determines the traffic flow to which the data unit belongs, and updates flow tracking information for that flow. The network device utilizes the tracking information to determine when a rate at which the network device is receiving data belonging to the flow exceeds an excessive-rate threshold and is thus an excessive-rate flow. The network device may enable one or more excessive-rate policies on an excessive-rate traffic flow. Such a policy may include any number of features that affect how the device handles data units belonging to the flow, such as excessive-rate notification, differentiated discard, differentiated congestion notification, and reprioritization. Memory and other resource optimizations for such flow tracking and management are also described.

QUEUE MANAGEMENT IN A FORWARDER
20220029926 · 2022-01-27 ·

A queue management method, system, and recording medium include Selective Acknowledgments (SACK) examining to examine SACK blocks of a forwarder to selectively drop packets in a forward flow queue based on a reverse flow queue and MultiPath Transmission Control Protocol (MPTCP) examining configured to perform a first examining to examine multipath headers to recognize MPTCP flows based on a comparison between two subflows being a part of a same superflow and a second examining to examine the reverse flow queue to determine if redundant data has been sent based on a result of the first examining, a packet in the forward flow queue from a prior transmission being dropped from the forward flow queue sent from the forwarder to a receiver if a metadata of the packet does not match a metadata of an acknowledged packet in the reverse flow queue.

Spatial dispersion buffer
11757801 · 2023-09-12 · ·

An improved buffer for networking and other computing devices comprises multiple memory instances, each having a distinct set of entries. Transport data units (“TDUs”) are divided into storage data units (“SDUs”), and each SDU is stored within a separate entry of a separate memory instance in a logical bank. One or more grids of the memory instances are organized into overlapping logical banks. The logical banks are arranged into views. Different destinations or other entities are assigned different views of the buffer. A memory instance may be shared between logical banks in different views. When overlapping logical banks are accessed concurrently, data in a memory instance that they share may be recovered using a parity SDU in another memory instance. The shared buffering enables more efficient buffer usage in a network device with a traffic manager shared amongst egress bocks. Example read and write algorithms for such buffers are disclosed.