Telefonaktiebolaget Lm Ericsson (publ)

Gergo Gombos

Ferenc Fejes

Sandor Laki

Szilveszter Nádas

Sándor Laki

Csaba Keszei

Methods and apparatus for packet marking for a Hierarchical Quality of Service (HQoS) is provided to control resource sharing among a plurality of network flows with differentiated services. A packet marker at a single point (e.g., gateway) encodes the resource sharing policy for a plurality of packet flows into a single packet value. The HQoS policy is then realized by using simple PPV schedulers at the bottlenecks in the network.

Marker graph for HQoS

A computing device () identifies a plurality of regions of a Throughput Value Function, TVF (). The TVF () maps throughput values to packet values for a plurality of subflows. The computing device () periodically updates a plurality of matrices comprising a matrix of resource sharing weights and a region determination matrix. The computing device () marks a packet () with a packet value based on the plurality of matrices. The packet () is received in one of the subflows.

Fair hierarchical quality of service marking

An intermediate device () of a communication network () assigns each of a plurality of received packets () to either a Low Latency, Low Loss, Scalable throughput (L4S) queue () or a non-L4S queue (). Each queue () is associated with one packet value size counter for each of the plurality of packet values (). The intermediate device () increments, for each packet () and by a size of the packet (), the packet value size counter associated with the queue () to which the packet () is assigned and calculates, for each queue (), a congestion threshold value based on the packet value size counters associated with the queue (). The intermediate device () marks one or more of the packets () as having experienced congestion based on the congestion threshold values of the queues ().

Multi-queue packet processing performed by an intermediate device in a communication network

A network node (), such as a packet marking node, efficiently measures the bitrates of incoming packets on a plurality of timescales (TSs). A throughput-value function (TVF) is then graphed to indicate the throughput-packet value relationship for that TVF. Then, starting from the longest TS and moving towards the shortest TS, the packet marking node determines () a distance between the TVFs of different TSs at the measured bitrates. To determine the packet marking, the packet marking node selects a random throughput value between 0 and the bitrate measured on the shortest TS. Depending on how the random value relates to the measured bitrates, a TVF, and the distances to add to the random value, is then selected to determine () a packet value (PV) with which to mark the packet. The packet marking node then marks () the packet according to the determined PV.

Multi-timescale packet marker

The invention relates to a method for controlling a transmission buffer in a transmission node of a transmission network transmitting data packets of a data packet flow, wherein each data packet includes a delay value indicating a transmission delay requirement of the data packet and a packet value indicating a level of importance of the data packet. The buffer includes different buffer regions and an arriving data packet is put into its respective buffer region based on the delay requirement indicated by a delay value contained in the data packet. The number of bytes waiting before the freshly arrived data packet cannot increase so that the delay requirement is met and possibly other packets in the buffer might be dropped for the newly arriving packet.

Growing community of inventors

Budapest, Hungary

Gergo Gombos