Patent classifications
H04L47/52
MECHANISM TO IMPLEMENT TIME STAMP-BASED TRANSMISSIONS FROM AN NETWORK INTERFACE DEVICE OF A DATACENTER
A circuitry of a network interface device of a computing network is to: access a first message from a server architecture of the computing network, the first message including a timestamp based on a time at which the circuitry is to access, from a host memory, one or more data packet descriptors that correspond to a data packet to be transmitted to the computing network from the network interface device; send, for transmission to the server architecture and at a transmission time based on the timestamp, a second message, the second message including a request to access the one or more data packet descriptors; and subsequent to sending the second message for transmission, access the one or more data packet descriptors to determine one or more addresses for the data packet in the host memory.
Congestion control
In an embodiment, header information of messages is altered to specify a window within which to receive information, so that the messages sent by a remote device will be sent at a rate that a network can receive messages. The sending of acknowledgements of messages are paced to control window growth. Bandwidth is allocated to a plurality of flows such that the satisfied flows require less bandwidth than an amount of bandwidth allocated to each unsatisfied flow.
Congestion control
In an embodiment, header information of messages is altered to specify a window within which to receive information, so that the messages sent by a remote device will be sent at a rate that a network can receive messages. The sending of acknowledgements of messages are paced to control window growth. Bandwidth is allocated to a plurality of flows such that the satisfied flows require less bandwidth than an amount of bandwidth allocated to each unsatisfied flow.
SYSTEM AND METHOD FOR MANAGING NETWORK TRAFFIC USING FAIR-SHARE PRINCIPLES
A system and method for managing network traffic in a distributed environment. the system including: a plurality of logic modules configured to determine policy data related to bandwidth management and at least one split criteria for a basis for shaping network traffic; a control processor associated with each one of the plurality of logic modules, each control processor configured to determine data associated with each of a plurality of traffic flows at the associated logic module and to coordinate traffic actions over the plurality of logic modules; a packet processor associated with each control processor and configured to determine a traffic action based on each traffic flow and received policy data; and at least two shaper objects configured to receive a split of the traffic flows and enforce the determined traffic action on their respective traffic flow.
SYSTEM AND METHOD FOR MANAGING NETWORK TRAFFIC USING FAIR-SHARE PRINCIPLES
A system and method for managing network traffic in a distributed environment. the system including: a plurality of logic modules configured to determine policy data related to bandwidth management and at least one split criteria for a basis for shaping network traffic; a control processor associated with each one of the plurality of logic modules, each control processor configured to determine data associated with each of a plurality of traffic flows at the associated logic module and to coordinate traffic actions over the plurality of logic modules; a packet processor associated with each control processor and configured to determine a traffic action based on each traffic flow and received policy data; and at least two shaper objects configured to receive a split of the traffic flows and enforce the determined traffic action on their respective traffic flow.
DYNAMIC ALLOCATION OF NETWORK RESOURCES USING EXTERNAL INPUTS
Systems and methods for managing network resources are disclosed. One method can comprise receiving first information relating to network traffic parameters and receiving second information relating to one or more contextual events having an effect on the network traffic parameters. The first information and the second information and be correlated. And one or more network resources can be allocated based on the correlation of the first information and the second information.
Distinguishing Traffic-Engineered Packets and Non-Traffic-Engineered Packets
Various embodiments providing for an indicator (termed the “Traffic Category Indicator,” TCI) to be encoded into packets, different values of which can be used, e.g., to distinguish Traffic Engineered (TE) packets and non-TE packets. In an example embodiment, the TCI can be used, e.g., to configure a network node to implement different packet queues, on each link, for TE packets and non-TE packets. In embodiments corresponding to the DiffServ TE paradigm, a node can be configured to implement different queues within each Forwarding Class for each link, said different queues distinguished by different respective TCI values. Example benefits of TCI include, but are not limited to fate separation of TE and non-TE packets in a node. The TCI concept can beneficially be applied to different packet-switching technologies supporting Source Routing, such as the IP, MPLS, Ethernet, etc.
CONGESTION CONTROL METHOD AND APPARATUS
A congestion control method and an apparatus are disclosed. The method includes: after a sending device generates an unscheduled data packet of a first flow, if it is determined, based on an unscheduled packet send window shared by all flows, that the unscheduled data packet meets a sending condition, determining whether to request to add a quota for at least one of the unscheduled packet send window and a scheduled packet send window corresponding to the first flow; and if it is determined that the quota is requested to be added for the at least one of the unscheduled packet send window and the scheduled packet send window corresponding to the first flow, setting indication information in the unscheduled data packet, and sending, to a receiving device, the unscheduled data packet in which the indication information is set.
Managing virtual output queues
A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.
Facilitating real-time transport of data streams
An interface may be provided between i) a selective forwarding unit (SFU) configured to, in real-time, receive a data stream from a sender via a first network link of a communication network and selectively forward the data stream to one or more receivers via respective second network links, and ii) one or more core network functions (PCF, PCRF, NSMF, CSMF) for establishing service guarantees for data flows in the communication network. In a specific example, the interface may be established as a network function (SMGF) which translates streaming requirements for one-to-many flows coming from WebRTC SFUs into appropriate QoS/network slice configurations, such that the quality of RTC flows may be increased. Accordingly, negative side-effects of conservative congestion control algorithms in WebRTC clients and static/overprovisioned QoS at network operators may be overcome.