Abstract: Example embodiments describe a method for managing data traffic congestion in a network communication node. The method comprising maintaining a marking probability based on a marking ratio indicative of a change in packets responsible for congestion in a network queue in the network communication node over a change in a total number of packets processed by the network queue. The method further comprising classifying packets processed by the network queue as scalable packets or other packets based on an identifier included in the packets; wherein the scalable packets support scalable congestion control. The method further comprising marking the scalable packets responsible for congestion in the network queue with a congestion mark to signal data traffic congestion; and marking the other packets that support unscalable congestion control with the congestion mark based on the marking probability.

Abstract: Embodiments relate to the management of data traffic congestion in a network communication node, the network communication node comprising a queue buffer configured to respectively enqueue packets at an input and dequeue packets at an output, and an Active Queue Management (AQM) module configured to determine a drop or a mark decision for a packet based on control parameters, wherein values for the control parameters are derived based on values of queue parameters weighted with respective weight factors and their associated target values, values of queue parameters and their associated target values weighted with respective weight factors, or a combination thereof.

Abstract: Various example embodiments for supporting queue management in communication systems are presented. Various example embodiments for supporting queue management in communication systems may be configured to support application-based queue management. Various example embodiments for supporting application-based queue management may be configured to support application-based congestion control. Various example embodiments for supporting application-based congestion control may be configured to support application-based congestion control based on use of trigger templates.

Abstract: A distribution network with point-to-multipoint architecture couples a line termination unit to a plurality of network termination units. A network termination unit includes one or more user network interfaces configured to interface with respective user equipment of respective users, a downstream packet buffer for temporary storage of data packets, a downstream packet buffer monitor configured to monitor the status of the downstream packet buffer and to generate back-pressure signals indicative for the status, wherein the status corresponds to a fill level or fill level variation of the downstream packet buffer, and an upstream transmitter configured to upstream transmit the back-pressure signals to the line termination unit to be used there for shaping and/or scheduling future downstream transmission of data packets to the one or more user network interfaces.

Abstract: Embodiments relate to the management of data traffic congestion in a network communication node, the network communication node comprising a queue buffer configured to respectively enqueue packets at an input and dequeue packets at an output, and an Active Queue Management (AQM) module configured to determine a drop or a mark decision for a packet based on control parameters, wherein values for the control parameters are derived based on values of queue parameters weighted with respective weight factors and their associated target values, values of queue parameters and their associated target values weighted with respective weight factors, or a combination thereof.

Abstract: A distribution network with point-to-multipoint architecture couples a line termination unit to a plurality of network termination units. A network termination unit includes one or more user network interfaces configured to interface with respective user equipment of respective users, a downstream packet buffer for temporary storage of data packets, a downstream packet buffer monitor configured to monitor the status of the downstream packet buffer and to generate back-pressure signals indicative for the status, wherein the status corresponds to a fill level or fill level variation of the downstream packet buffer, and an upstream transmitter configured to upstream transmit the back-pressure signals to the line termination unit to be used there for shaping and/or scheduling future downstream transmission of data packets to the one or more user network interfaces.

Abstract: Various example embodiments for supporting queue management in communication systems are presented. Various example embodiments for supporting queue management in communication systems may be configured to support application-based queue management. Various example embodiments for supporting application-based queue management may be configured to support application-based congestion control. Various example embodiments for supporting application-based congestion control may be configured to support application-based congestion control based on use of trigger templates.

Abstract: Network device for transmitting packets having packet properties, including at least two input-output-buffers for queuing packets in the network device; a sojourn time calculator for calculating a sojourn related time for each head packet in the at least two input-output-buffers; a sojourn related time adaptor for, based on an adaptation function assigned to the corresponding input-output-buffer, adapting the sojourn related time into an adapted time for each head packet in the at least two input-output-buffers; and a scheduler for scheduling outgoing packets based on the adapted time.

Abstract: Method for queueing packets, each packet of the packets including timing information representing a remaining time until a deadline associated with delivery at its destination; the system including N queues, each queue thereof being configured for buffering at least one packet, the N queues having a cyclic order; the method including keeping track of a pointer, initially pointing to a queue of the N queues; afterwards, repeatedly incrementing the pointer over the N queues, according to the cyclic order, after each passing of a scheduling interval S; enqueueing each packet of the packets in a queue of the N queues, that queue differing from the queue to which the pointer is pointing, based on the packet's timing information and taking into account the cyclic order; and dequeueing enqueued packets from the N queues, while prioritizing dequeueing from the queue to which the pointer is pointing.

Abstract: A method for queue management in a packet-switched network including at an intermediate node receiving first packets belonging to a first class associated with a first queue management mechanism and second packets belonging to a second class associated with a second queue management mechanism; marking or dropping of the first packets in accordance with the first queue management mechanism and marking or dropping of the second packets in accordance with the second queue management mechanism; and coupling the marking or dropping of the second packets to the marking or dropping of the first packets.

Abstract: The present invention is related to an intermediate node, an end node, and method for avoiding latency in a packet-switched network. According to the invention, the maximum bandwidth per flow is determined locally and transferred from the sending node to the receiving node. At each node, the information is updated if a lower local value is computed. By adjusting the transmission rate based on the maximum bandwidth per flow receiving at the receiving node, the link capacity can be optimally utilized and congestion can be minimized.

Abstract: Method for queueing packets, each packet of the packets including timing information representing a remaining time until a deadline associated with delivery at its destination; the system including N queues, each queue thereof being configured for buffering at least one packet, the N queues having a cyclic order; the method including keeping track of a pointer, initially pointing to a queue of the N queues; afterwards, repeatedly incrementing the pointer over the N queues, according to the cyclic order, after each passing of a scheduling interval S; enqueueing each packet of the packets in a queue of the N queues, that queue differing from the queue to which the pointer is pointing, based on the packet's timing information and taking into account the cyclic order; and dequeueing enqueued packets from the N queues, while prioritizing dequeueing from the queue to which the pointer is pointing.

Abstract: Network device for transmitting packets having packet properties, including at least two input-output-buffers for queuing packets in the network device; a sojourn time calculator for calculating a sojourn related time for each head packet in the at least two input-output-buffers; a sojourn related time adaptor for, based on an adaptation function assigned to the corresponding input-output-buffer, adapting the sojourn related time into an adapted time for each head packet in the at least two input-output-buffers; and a scheduler for scheduling outgoing packets based on the adapted time.

Abstract: In adaptive streaming, video segments are available in one or more quality levels, and each video segment is delivered to the client (103) in a quality level specified in a request received from that client (103). In order to reduce the risk for buffer underrun, an adaptive streaming aware network node (101) comprises: —session monitoring means (111) for collecting buffer fill information indicative for a buffer volume at the client (101) occupied by a video session; —priority calculation means (112) for determining a priority level for video segments of the session in function of the buffer fill information; and —video segment marking means (113) for marking video segments of the session with the priority level.

Abstract: The present invention relates to a method, related system, related congestion monitoring device and related media delivery personalization devices for controlling congestion in a media delivery network that includes a media delivery server and a plurality of client devices. The media delivery server is coupled over the media delivery network to each client device of the plurality of client devices. The media delivery server delivering media to a client device over a path between the media delivery server and the client device. The related method includes the steps of monitoring congestion in the media delivery network and subsequently adapting a level of personalization of the delivering of media to the client device based on the congestion monitored.

Abstract: In an embodiment the method includes, at a transmit side, grouping carriers into carrier groups, and selecting a group constellation diagram for modulation of the carriers of a given carrier group. The selected group constellation diagram is built as a hierarchical sum of I super-imposed constellations vectors having predefined decreasing powers with the P strongest and the Q weakest constellation vectors being omitted. The carriers of the carrier group are modulated by means of the selected group constellation diagram, and P and/or Q parameters per carrier group and per multi-carrier data symbol are adjusted.

Abstract: A method for queue management in a packet-switched network including at an intermediate node receiving first packets belonging to a first class associated with a first queue management mechanism and second packets belonging to a second class associated with a second queue management mechanism; marking or dropping of the first packets in accordance with the first queue management mechanism and marking or dropping of the second packets in accordance with the second queue management mechanism; and coupling the marking or dropping of the second packets to the marking or dropping of the first packets.

Abstract: The present invention relates to a method for supporting data-communication between a first communications module and a second communications module over a communications link between the first communications module and the second communications module where this method comprises the steps of at a first communications module setting up a temporary network applying at least one network connection parameter in the setting up of the temporary network and presenting data-communication supporting information, where the data-communication supporting information comprises at least one network connection parameter and data-communication specific data. Subsequently, the second communications module retrieves the data-communication supporting information presented and the second communications module connects to the temporary network of the access point of the first communications module applying the at least one network connection parameter retrieved from the data-communication supporting information.

Abstract: The present invention is related to an intermediate node, an end node, and method for avoiding latency in a packet-switched network. According to the invention, the maximum bandwidth per flow is determined locally and transferred from the sending node to the receiving node. At each node, the information is updated if a lower local value is computed. By adjusting the transmission rate based on the maximum bandwidth per flow receiving at the receiving node, the link capacity can be optimally utilized and congestion can be minimized.

Abstract: In adaptive streaming, video segments are available in one or more quality levels, and each video segment is de livered to the client (103) in a quality level specified in a request received from that client (103). In order to reduce the risk for buffer underrun, an adaptive streaming aware network node (101) comprises: —session monitoring means (111) for collecting buffer fill information indicative for a buffer volume at the client (101) occupied by a video session; —priority calculation means (112) for determining a priority level for video segments of the session in function of the buffer fill information; and—video segment marking means (113) for marking video segments of the session with the priority level.