The invention relates to transmission of communication signal frames by a communicating entity in a packet-switched network, the communicating entity comprising an egress port for transmitting communication signal frames. The frames comprise a first type of frames, intended to be transmitted in a plurality of bursts for which a traffic shaping is defined as an express traffic, and a second type of frames, for which no traffic shaping is defined, as a sporadic traffic. The communicating entity is configured for storing a plurality of first queues of frames of the first type, associated respectively to the aforesaid plurality of bursts, and at least one second queue for frames of the second type. The bursts are stored in respective first queues with a signaling frame preceding each burst, and this signaling frame comprises a timestamp of generation of said burst. Then, for selecting a first burst to transmit among the bursts stored in said first queues, the communicating entity is configured for: —Reading the timestamp of each signaling frame located at a head of each first queues, —Determining among all the signaling frames the one having the most ancient timestamp, and —Select the burst having the thus determined signaling frame as the first burst to transmit.

A communication control system includes a plurality of layer 2 switches (SWs); and a communication control device that controls communication of the SWs. Each SW includes one or more queues that each have a variable queue length for accumulating input frames, and a transmission unit that has a shaping function of transmitting the frames accumulated in the queues to a desired destination at a desired rate. The communication control device includes a correction processing unit that acquires an amount of discarded data generated in each queue of the SW, and multiplies the acquired amount of discarded data by a correction coefficient weighted by the cumulative number of times of discarding occurrences for which the amount of discarded data is not 0 to obtain a corrected amount of discarded data; and an adjustment processing unit that determines adjustment values for the queue length of each queue and shaping rate of the SW based on the corrected amount of discarded data, and notifies each SW of the adjustment values.

Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

A system includes multiple nodes that communicate among one another. Each of the multiple nodes includes at least one data storage container. The system also includes a sender sliding window (SSW) that controls sending of data from at least one node of the multiple nodes to at least one other node of the multiple nodes. The system further includes a receiver sliding window (RSW) that controls receiving of the data from the at least one node of the multiple nodes at the at least one other node of the multiple nodes. At least one of the SSW or the RSW is sharable amongst more than one node of the multiple nodes.

An exemplary sliding window scheduling method and system are disclosed. The exemplary sliding window scheduling method and system can schedule multiple packets in a given scheduling frame with a sliding window scheduling frame. The scheduling operation can be performed using bitmap operators and can achieve a lowest time complexity of O(1) per matching computation and per port using distributed parallelization hardware. The exemplary sliding window scheduling method and system can be performed in the context of a queue-proportional scheduler (QPS) as well as iSLIP. In alternative embodiments, the SW-QPS operation can be performed in a batching window rather than in a sliding window.

A network device for a communications network includes a port configured to transmit data to the network at a maximum transmit data rate. The device also includes a transmit buffer configured to buffer data units that are ready for transmission to the network, and a packet buffer configured to buffer data units before the data units are ready for transmission. The packet buffer is configured to output data units at a maximum packet buffer transmission rate faster than the maximum transmit data rate. The device includes a rate controller configured to control a transmission rate of data from the packet buffer to the transmit buffer so that averaged over a period, the transmission rate from the packet buffer to the transmit buffer is at most equal to the maximum transmit data rate, while allowing the transmission rate, at one or more time intervals, to exceed the maximum transmit data rate.

Aspects of the present disclosure involve systems, methods, computer program products, and the like, for controlling a congestion window (CWND) value of a communication session of a CDN. In particular, a content server may analyze a request to determine or receive an indication of the type of content being requested. The content server may then set the initial CWND based on the type of content being requested. For example, the content server may set a relatively high CWND value for requested content that is not particularly large, such as image files or text, so that the data of the content is received at the client device quickly. For larger files or files that a have a determined smaller urgency, the initial CWND may be set at a lower value to ensure that providing the data of the content does not congest the link between the devices.

Described embodiments include a system that includes a network interface and a processor. The processor is configured to identify, via the network interface, a state of congestion in a communication channel between a base station belonging to a cellular network and a client device, to calculate, responsively to the state of congestion, a maximum sustainable encoding bit rate (MSEBR) for a video that is being downloaded by the client device, from a server, via the communication channel, the video being encoded at a plurality of different predefined bit rates, and to inhibit the client device, in response to calculating the MSEBR, from downloading a segment of the video that is encoded at any one of the predefined bit rates that exceeds the MSEBR. Other embodiments are also described.

The controller (10) acquires information about the band of the flow within the tunnel and the band of each flow after policing or shaping, calculates the ratio of the traffic volume after policing or shaping to the traffic volume before policing or shaping by using the acquired information about the band, and estimates the traffic volume of the flow to be monitored within the tunnel by using the calculated ratio and the band of each flow after policing or shaping.

The present disclosure provides a method and system of limiting traffic. The method includes: sending, by a distributed node, a service volume in a current preset time period to a central node according to a fixed period; determining, by the central node, a decision quota of the distributed node based on the received service volume, and sending the decision quota to the distributed node; receiving, by the distributed node, the decision quota sent by the central node; and determining, by the distributed node based on the latest received decision quota after receiving an access request, whether traffic limitation needs to be performed for the access request. The traffic limitation decision of the present application is made by the distributed node autonomously, the decision path is short, and fast and accurate decision making is achieved.