Telefonaktiebolaget Lm Ericsson (publ)

Sandor Laki

Szilveszter Nádas

Gergo Gombos

Gergö Gombos

Gergely Pongrácz

Zoltán Turányi

Ferenc Fejes

Geza Szabo

Csaba Keszei

Csaba Györgyi

Zoltán Richárd TURÁNYI

A method for handling data packets by a communication node in a communication network, the method comprising storing received data packets in at least two physical queues, wherein a first of said at least two physical queues is associated with low latency data packets and a second of said at least two physical queues is associated with high latency data packets, wherein each data packet is stored in one of the at least two physical queues based on a delay characteristic associated with the data packet, for each received data packet, storing an associated information record in at least two virtual queues, VQs, wherein associated information for data packets stored in said high latency physical queue is stored in a second of said at least two virtual queues and wherein associated information for data packets stored in said low latency physical queue is stored in both said first and second of said at least two virtual queues, serving data packets from the at least two physical queues, using at least two Congestion Threshold Values, CTVs, wherein a first of said at least two CTVs is applicable to data packets in said low latency physical queue and wherein both said first and second of said at least two CTVs are applicable to data packets in said low latency physical queue and data packets in said high latency physical queue, wherein said at least two CTVs are used for at least one of dropping and marking packets based on their associated information.

Virtual dual queue core stateless active queue management (AQM) for communication networks

A method is implemented by a programmable network device, where the method is to enable debugging of a parser in a packet processing pipeline of the programmable network device. The method includes receiving a packet for processing in the packet processing pipeline, initializing a tracing structure to record debugging information for the parser, adding a current state of the parser to the tracing structure, and determining a next state of the parser.

Method for debugging the parser in programmable routers

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

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.

Delay-aware resource sharing

At an Edge Node, a method of handling data packets in order to mark the packets with respective packet values indicative of a level of importance. The method comprises implementing a variable rate token bucket to determine an estimated arrival rate of a flow of packets. The method comprises receiving a data packet, updating the estimated arrival rate to an updated arrival rate based on a token level of the token bucket and generating a random or pseudo-random number within a range with a limit determined by the updated arrival rate. The method further comprises identifying an operator policy which determines a level of service associated with the flow of packets, and a Throughput Value Function (TVF) associated with said policy, and then applying the TVF to the random number to calculate a packet value. The packet value is included in a header of the packet.

Probabilistic packet marking with fast adaptation mechanisms

A method, in a first node, for handling one or more jobs, wherein said first node receives a job over an incoming link, which job comprises a job value, wherein said method comprises the steps of determining, by said first node, a deviation of a queuing delay of the first communication node from a target queuing delay value, and using, by said first node, said deviation as an error value to determine a dropping probability which is used to determine a threshold value, wherein said threshold value corresponds to or is associated with a congestion level of a queue of the job, comparing, by said first node, the job value with the threshold value and establishing that said job value is below said threshold value, dropping, by said first node, said job based on said comparison.

First communication node, method performed thereby, computer program and computer-readable storage medium for handling packets in a communications network

Growing community of inventors

Budapest, Hungary

Sandor Laki