A real-time dynamic API traffic shaping and infrastructure resource protection in a multiclient network environment is provided. A traffic rules engine (TRE) applies traffic shaping only to customers that are utilizing “more than their fair share” of the currently available bandwidth without allowing them to negatively impact the user experience of other users. The present invention takes current API traffic into consideration, allowing one or a few high volume users to utilize most of all available bandwidth as long as other users do not need that bandwidth. This includes dynamically measuring and adjusting which users had traffic shaping applied to them based on the overall traffic during any given second. The solution of the present invention avoids any slowdown of customer API requests unless the maximum allowable TPS limit is near to being reached.

A method includes storing entries in a first first-in first-out (FIFO) buffer, each entry of the first FIFO buffer includes a respective segment of plural segments of a first data stream and timing attributes corresponding to the respective segment. The method also includes processing the respective segments in entries output from the first FIFO buffer using a first media processing task of a workflow in a network-based media processing (NBMP) system. The respective segments are processed independently from each other and the first media processing task is performed in a cloud computing environment. The method also includes generating a continuous data stream by concatenating the processed segments according to the timing attributes corresponding to the processed segments.

A network appliance can have an input port that can receive network packets at line rate, two or more ingress queues, a line rate classification circuit that can place the network packets on the ingress queues at the line rate, a packet buffer that can store the network packets, and a sub line rate packet processing circuit that can process the network packets that are stored in the packet buffer. The line rate classification circuit can place a network packet on one of the ingress queues based on the network packet's packet contents. A buffer scheduler can select network packets for processing by a sub line rate packet processing circuit based on the priority levels of the ingress to queues.

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.

A real-time dynamic API traffic shaping and infrastructure resource protection in a multiclient network environment is provided. A traffic rules engine (TRE) applies traffic shaping only to customers that are utilizing “more than their fair share” of the currently available bandwidth without allowing them to negatively impact the user experience of other users. The present invention takes current API traffic into consideration, allowing one or a few high volume users to utilize most of all available bandwidth as long as other users do not need that bandwidth. This includes dynamically measuring and adjusting which users had traffic shaping applied to them based on the overall traffic during any given second. The solution of the present invention avoids any slowdown of customer API requests unless the maximum allowable TPS limit is near to being reached.

This application provides a scheduling method and an apparatus. The method includes: determining, by an application processor, a type of a to-be-sent data packet, and putting, by the application processor, the to-be-sent data packet into a quality of service QoS data flow corresponding to the type of the to-be-sent data packet, where the type of the to-be-sent data packet is a GBR type or a non-GBR type; and scheduling, by the application processor, a to-be-sent data packet in a QoS data flow corresponding to the GBR type to send the to-be-sent data packet to a modem in a terminal in which the application processor is located, and after determining that a data transmission rate requirement of the GBR type is met, scheduling, by the application processor, a to-be-sent data packet in a QoS data flow corresponding to the non-GBR type to send the to-be-sent data packet to the modem.

This application provides a scheduling method and an apparatus. The method includes: determining, by an application processor, a type of a to-be-sent data packet, and putting, by the application processor, the to-be-sent data packet into a quality of service QoS data flow corresponding to the type of the to-be-sent data packet, where the type of the to-be-sent data packet is a GBR type or a non-GBR type; and scheduling, by the application processor, a to-be-sent data packet in a QoS data flow corresponding to the GBR type to send the to-be-sent data packet to a modem in a terminal in which the application processor is located, and after determining that a data transmission rate requirement of the GBR type is met, scheduling, by the application processor, a to-be-sent data packet in a QoS data flow corresponding to the non-GBR type to send the to-be-sent data packet to the modem.

An apparatus for managing data messages comprises: one or more producers generating data streams containing data messages of varying sizes that required processing; one or more consumers for processing the data messages; a multi-message queues sub-system for queuing data messages having different processing time durations; a rate limiter for discriminating data messages based on processing speed for queuing the data messages in one or the other message queue of the multi-message queues sub-system; a fair dispatcher for dispatching the data messages to one or more consumers according to their processing statuses to maximize the processing capacity of the apparatus; and a task splitter for splitting data messages that are deemed too large.

An apparatus for managing data messages comprises: one or more producers generating data streams containing data messages of varying sizes that required processing; one or more consumers for processing the data messages; a multi-message queues sub-system for queuing data messages having different processing time durations; a rate limiter for discriminating data messages based on processing speed for queuing the data messages in one or the other message queue of the multi-message queues sub-system; a fair dispatcher for dispatching the data messages to one or more consumers according to their processing statuses to maximize the processing capacity of the apparatus; and a task splitter for splitting data messages that are deemed too large.

A packet control method, a flow table update method, and a node device including a first queue and a second queue, where the method includes: obtaining, by the node device, a first packet; determining, by the node device, that a data flow to which the first packet belongs is marked as an isolated flow; and if the first queue and/or the second queue meet and/or meets a first preset condition, controlling, by the node device, the first packet to enter the first queue and wait to be scheduled; or if the first queue and/or the second queue meet and/or meets a second preset condition, controlling, by the node device, the first packet to enter the second queue and wait to be scheduled.