Patents by Inventor Gergo GOMBOS
Gergo GOMBOS has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240106758Abstract: This disclosure provides a technique for hierarchical packet marking for Core-Stateless Active Queue Management (CSAQM). In particular, a network node measures the bitrate of each of a plurality of subflows that comprise a traffic aggregate (TA). The plurality of subflows in the TA belong to a single entity, and each subflow has a normalized weight value. The node modifies a random rate determination for a throughput-value function (TVF) associated with the TA based on the bitrates and weight of each subflow in the TA. Then, based on the modified rate, the node calculates a packet value (PV) with which to mark a packet in a given subflow, and marks the packet with the PV. Marking packets according to the techniques disclosed herein achieves a desired weighted resource sharing, and ensures that the random rates are uniformly distributed for the entire TA.Type: ApplicationFiled: January 5, 2022Publication date: March 28, 2024Inventors: Szilveszter Nádas, Sándor Laki, Gergo Gombos, Ferenc Fejes
-
Publication number: 20240098028Abstract: 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.Type: ApplicationFiled: March 30, 2021Publication date: March 21, 2024Inventors: Szilveszter Nádas, Sándor Laki, Gergo Gombos, Ferenc Fejes
-
Publication number: 20240056401Abstract: An intermediate device (110) of a communication network (100) assigns each of a plurality of received packets (300) to either a Low Latency, Low Loss, Scalable throughput (L4S) queue (370a) or a non-L4S queue (370b). Each queue (370a, 370b) is associated with one packet value size counter for each of the plurality of packet values (320). The intermediate device (110) increments, for each packet (300) and by a size of the packet (300), the packet value size counter associated with the queue (370a, 370b) to which the packet (300) is assigned and calculates, for each queue (370a, 370b), a congestion threshold value based on the packet value size counters associated with the queue (370a, 370b). The intermediate device (110) marks one or more of the packets (300) as having experienced congestion based on the congestion threshold values of the queues (370a, 370b).Type: ApplicationFiled: October 22, 2021Publication date: February 15, 2024Inventors: Szilveszter Nádas, Sandor Laki, Gergo Gombos, Ferenc Fejes
-
Publication number: 20230362101Abstract: Systems and methods of the present disclosure are directed to a method performed by a receiving node. The method includes receiving a packet/frame comprising Per Packet Value (PPV) information from a transmitting node, wherein the PPV information indicates a level of importance of the packet/frame determined based on a marking policy of the transmitting node, and wherein the packet/frame comprises (a) an Ethernet packet, (b) an IPv4 packet, (c) an IPv6 packet, (d) a Multi-Protocol Label Switching (MPLS) packet, or (e) a multilayer packet descriptive of one or more of (a)-(d). The method includes processing the PPV information in the received packet/frame when the receiving node is configured to handle the PPV information.Type: ApplicationFiled: September 17, 2021Publication date: November 9, 2023Inventors: Balázs Varga, Szilveszter Nádas, János Farkas, Ferenc Fejes, Gergö Gombos, Sandor Laki, Gergely Pongrácz, János Szabó
-
Patent number: 11695703Abstract: A network node (120), 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 (88) 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 (92) a packet value (PV) with which to mark the packet. The packet marking node then marks (94) the packet according to the determined PV.Type: GrantFiled: April 21, 2020Date of Patent: July 4, 2023Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nádas, Sándor Laki, Gergo Gombos, Ferenc Fejes
-
Publication number: 20230142425Abstract: 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 CongestiType: ApplicationFiled: February 23, 2021Publication date: May 11, 2023Inventors: Szilveszter Nádas, Ferenc Fejes, Sandor Laki, Gergö Gombos
-
Patent number: 11456962Abstract: 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.Type: GrantFiled: September 28, 2018Date of Patent: September 27, 2022Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nádas, Csaba Keszei, Sandor Laki, Gergo Gombos
-
Patent number: 11425046Abstract: 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.Type: GrantFiled: January 22, 2018Date of Patent: August 23, 2022Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nádas, Gergö Gombos, Sandor Laki, Zoltán Turányi
-
Publication number: 20220224652Abstract: A network node (120), 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 (88) 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 (92) a packet value (PV) with which to mark the packet. The packet marking node then marks (94) the packet according to the determined PV.Type: ApplicationFiled: April 21, 2020Publication date: July 14, 2022Inventors: Szilveszter Nádas, Sándor Laki, Gergo Gombos, Ferenc Fejes
-
Publication number: 20210194817Abstract: 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.Type: ApplicationFiled: September 28, 2018Publication date: June 24, 2021Inventors: Szilveszter NÁDAS, Csaba KESZEI, Sandor LAKI, Gergo GOMBOS
-
Patent number: 11038806Abstract: 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.Type: GrantFiled: December 8, 2017Date of Patent: June 15, 2021Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nádas, Gergö Gombos, Sandor Laki, Gergely Pongrácz, Zoltán Turányi
-
Publication number: 20200382427Abstract: 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.Type: ApplicationFiled: January 22, 2018Publication date: December 3, 2020Inventors: Szilveszter NÁDAS, Gergö GOMBOS, Sandor LAKI, Zoltán TURÁNYI
-
Publication number: 20200127933Abstract: 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.Type: ApplicationFiled: December 8, 2017Publication date: April 23, 2020Inventors: Szilveszter Nádas, Gergö Gombos, Sandor Laki, Gergely Pongrácz, Zoltán Turányi