Patents by Inventor Gábor Sándor Enyedi
Gábor Sándor Enyedi 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).
-
Patent number: 11394638Abstract: The present disclosure relates to forwarding of network traffic. In one of its aspects, the technology presented herein concerns a method for forwarding network traffic from multiple sources to multiple destinations on maximally disjoint paths by maximally redundant trees, MRTs. The method is implemented in a network element implementing multipoint-to-multipoint functionalities in a path computation element, PCE, of a network, wherein the network includes a plurality of network elements. According to the method, an almost directed acyclic graph, ADAG, is computed for the network. Next hops along MRTs are computed by using the ADAG. One or more valid path pair(s) of the computed MRTs that is/are disjoint is/are determined and then, the network traffic is forwarded by using the valid path pair(s) of the MRT(s).Type: GrantFiled: December 21, 2017Date of Patent: July 19, 2022Assignee: Telefonaktiebolaget LM Ericsson (Publ)Inventors: Gabor Sandor Enyedi, János Farkas, Zoltán Turányi
-
Patent number: 11362945Abstract: A method is implemented by a network device to dynamically optimize lookup speed in a packet processing table maintained at the network device while the network device is in operation. The method includes determining one or more runtime metrics of the packet processing table, selecting a lookup algorithm for the packet processing table from a set of lookup algorithms supported by the network device based on the one or more runtime metrics of the packet processing table, and configuring the network device to match incoming packets against rules in the packet processing table using the selected lookup algorithm for the packet processing table.Type: GrantFiled: April 9, 2019Date of Patent: June 14, 2022Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Gergely Pongracz, Gabor Sandor Enyedi, Laszlo Molnar, Zoltan Lajos Kis
-
Patent number: 11356248Abstract: A technique for ciphering source data (306) into target data (308) is described. As to a method aspect of the technique, a level (302) of ciphering is determined for the source data (306). A key sequence (304) is generated depending on the determined level (302) of ciphering. The source data (306) and the key sequence (304) are combined resulting in the target data (308).Type: GrantFiled: December 21, 2017Date of Patent: June 7, 2022Assignee: Telefonaktiebolaget LM Ericsson (Publ)Inventors: Gabor Sandor Enyedi, Zoltan Kiss, Gergely Pongrácz
-
Publication number: 20200403906Abstract: The present disclosure relates to forwarding of network traffic. In one of its aspects, the technology presented herein concerns a method for forwarding network traffic from multiple sources to multiple destinations on maximally disjoint paths by maximally redundant trees, MRTs. The method is implemented in a network element implementing multipoint-to-multipoint functionalities in a path computation element, PCE, of a network, wherein the network includes a plurality of network elements. According to the method, an almost directed acyclic graph, ADAG, is computed for the network. Next hops along MRTs are computed by using the ADAG. One or more valid path pair(s) of the computed MRTs that is/are disjoint is/are determined and then, the network traffic is forwarded by using the valid path pair(s) of the MRT(s).Type: ApplicationFiled: December 21, 2017Publication date: December 24, 2020Inventors: Gabor Sandor ENYEDI, János FARKAS, Zoltán TURÁNYI
-
Publication number: 20200396062Abstract: A technique for ciphering source data (306) into target data (308) is described. As to a method aspect of the technique, a level (302) of ciphering is determined for the source data (306). A key sequence (304) is generated depending on the determined level (302) of ciphering. The source data (306) and the key sequence (304) are combined resulting in the target data (308).Type: ApplicationFiled: December 21, 2017Publication date: December 17, 2020Inventors: Gabor Sandor Enyedi, Zoltan Kiss, Gergely Pongrácz
-
Publication number: 20190238458Abstract: A method is implemented by a network device to dynamically optimize lookup speed in a packet processing table maintained at the network device while the network device is in operation. The method includes determining one or more runtime metrics of the packet processing table, selecting a lookup algorithm for the packet processing table from a set of lookup algorithms supported by the network device based on the one or more runtime metrics of the packet processing table, and configuring the network device to match incoming packets against rules in the packet processing table using the selected lookup algorithm for the packet processing table.Type: ApplicationFiled: April 9, 2019Publication date: August 1, 2019Inventors: Gergely PONGRACZ, Gabor Sandor ENYEDI, Laszlo MOLNAR, Zoltan Lajos KIS
-
Patent number: 10324868Abstract: The invention relates to a counting unit (100) configured to count an amount of traffic events of a data packet traffic. The counting unit comprises a counting element (131) configured to store a value representing the amount of traffic events.Type: GrantFiled: August 24, 2015Date of Patent: June 18, 2019Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Gabor Sandor Enyedi, László Molnár, Gergely Pongrácz
-
Patent number: 10305798Abstract: A method is implemented by a network device to dynamically optimize lookup speed in a packet processing table maintained at the network device while the network device is in operation. The method includes determining one or more runtime metrics of the packet processing table, selecting a lookup algorithm for the packet processing table from a set of lookup algorithms supported by the network device based on the one or more runtime metrics of the packet processing table, and configuring the network device to match incoming packets against rules in the packet processing table using the selected lookup algorithm for the packet processing table.Type: GrantFiled: June 21, 2016Date of Patent: May 28, 2019Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Gergely Pongracz, Gabor Sandor Enyedi, Laszlo Molnar, Zoltan Lajos Kis
-
Publication number: 20180232327Abstract: The invention relates to a counting unit (100) configured to count an amount of traffic events of a data packet traffic. The counting unit comprises a counting element (131) configured to store a value representing the amount of traffic events.Type: ApplicationFiled: August 24, 2015Publication date: August 16, 2018Inventors: Gabor Sandor Enyedi, László Molnár, Gergely Pongrácz
-
Publication number: 20170366455Abstract: A method is implemented by a network device to dynamically optimize lookup speed in a packet processing table maintained at the network device while the network device is in operation. The method includes determining one or more runtime metrics of the packet processing table, selecting a lookup algorithm for the packet processing table from a set of lookup algorithms supported by the network device based on the one or more runtime metrics of the packet processing table, and configuring the network device to match incoming packets against rules in the packet processing table using the selected lookup algorithm for the packet processing table.Type: ApplicationFiled: June 21, 2016Publication date: December 21, 2017Inventors: Gergely PONGRACZ, Gabor Sandor ENYEDI, Laszlo MOLNAR, Zoltan Lajos KIS
-
Patent number: 9825841Abstract: Computer controlled method, network server (42, 43, 44, 46, 48) and system (40) for detecting data patterns in a data stream (36) received by a computer (30). The data stream (36) comprising a plurality of data symbols. The computer (30) executes a finite automata (10) comprising a plurality of states (11, 12, 13, 14, 15) including a start state (11) and at least one accepting state (15). State transitions (16) are triggered by a data symbol (17a) according to a state transition register (17) and the method comprises the steps of determining (21), by the computer (30), from a data symbol register (18) whether a data symbol of the data stream (36) is comprised in a group of data symbols not resulting in an accepting state (15), and triggering (22), by the computer (30), a transition (16) to the start state (11) for data symbols comprised in the group and a transition (23) to a state (12, 13, 14, 15) according to the state transition register (17) for detecting the data pattern otherwise.Type: GrantFiled: June 29, 2012Date of Patent: November 21, 2017Assignee: Telefonaktiebolaget LM Ericsson (Publ)Inventors: Geza Szabo, Wesley Davison Braga Melo, Gabor Sandor Enyedi, Stenio Fernandes, Gergely Pongrácz, Djamel Sadok
-
Patent number: 9736061Abstract: A method performed by a network node. The method includes detecting a loss of connection at an incoming interface to an upstream neighbor of the network node, where the network node is in a multicast communication network that includes a multicast tree to provide connectivity from a common source node to one or more multicast recipient nodes. The multicast communication network further includes a set of one or more secondary paths to provide redundancy to the multicast tree, and sending a notification packet downstream toward the one or more multicast recipient nodes when the network node cannot re-route the multicast data traffic to allow the multicast data traffic to be received by the multicast recipient nodes, wherein the notification packet causes one or more downstream nodes to switch multicast reception to one or more of the set of one or more secondary paths to re-route the multicast data traffic.Type: GrantFiled: November 17, 2014Date of Patent: August 15, 2017Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: András Császár, Evgeny Tantsura, Gábor Sándor Enyedi
-
Patent number: 9614726Abstract: A method and system is disclosed to compute and distribute a generalized almost directed acyclic graph (GADAG). The method includes computing, by a network element, a GADAG for the network, where the GADAG is a graph abstraction of the network, where the plurality of network elements are the vertices of the GADAG and links connecting the plurality of network elements are the directed edges of the GADAG. The method continues with assembling a GADAG descriptor based on the computed GADAG, and distributing the GADAG descriptor to a plurality of network elements, where each of the plurality of network elements utilizes the GADAG descriptor to compute maximally redundant trees for forwarding traffic. The method also includes leveraging layer 2 attributes and features for layer 2 deployments and updating redundant trees upon topology change events such that traffic outage is avoided or minimized.Type: GrantFiled: January 20, 2015Date of Patent: April 4, 2017Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: János Farkas, Gábor Sándor Enyedi
-
Patent number: 9614720Abstract: A technique for informing nodes in a communications network about changes in a state of the communications network using notification packets is described. In that technique, the communications network is reconfigured using a fast reroute protocol responsive to the state change. A method aspect of the technique comprises generating, upon a network state change, a notification packet. Generating the notification packet includes adding a unique identifier to the notification packet. The method further includes propagating the notification packet through the communications network.Type: GrantFiled: December 20, 2013Date of Patent: April 4, 2017Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Gabor Sandor Enyedi, András Császár
-
Patent number: 9509557Abstract: The invention refers to operating a first node of a communication network comprising a plurality of nodes which are interconnected by communication links and wherein data traffic is provided over the communication links to provide a data stream to the nodes, wherein the first node (15) performs the steps of: detecting a data traffic interruption with respect to a second node (16), determining, if the data traffic is still received, and forwarding the data traffic to the second node (16) if the first node (15) receives the data traffic, and otherwise notifying a third node (17) of the plurality of network nodes about the data traffic interruption. The invention further refers to a corresponding node, a network and a computer program to be run in the node.Type: GrantFiled: October 17, 2012Date of Patent: November 29, 2016Assignee: Telefonaktiebolaget LM Ericsson (Publ)Inventors: Gabor Sandor Enyedi, András Császár
-
Patent number: 9438472Abstract: A method is implemented by a network element or controller for determining a backup path for a fast reroute process to be utilized in response to a network event invalidating a primary path to a destination node. The method identifies at least one intermediate node that has a backup loop free alternative (LFA) path to a destination node in a network where no path meeting LFA conditions can be found for a point of local repair (PLR).Type: GrantFiled: July 19, 2013Date of Patent: September 6, 2016Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: András Császár, Balázs Peter Gerö, Gabor Sandor Enyedi
-
Publication number: 20160241461Abstract: The present disclosure relates to preparation of nodes in a packet-switched communication network for enabling packet rerouting upon a failure in the network. The rerouting occurs along a detour defined by a Multiple Redundant Tree (MRT). A method aspect of this disclosure comprises computing, by a node of a set of connected nodes, at least one first MRT pair for a first MRT area to which a node is assigned. The first MRT area comprises a first subset of connected nodes. The method further comprises computing, by the node, at least one second MRT pair for a second MRT area to which the node is assigned. The second MRT comprises a second subset of the connected nodes.Type: ApplicationFiled: October 21, 2014Publication date: August 18, 2016Inventors: Gabor Sandor Enyedi, András Császár
-
Patent number: 9363168Abstract: A technique of operating a network node of a multicast communication network comprising a plurality of network nodes which are interconnected with each other by communication links is provided, wherein the network node is associate with a common source network node. A method implementation of the technique comprises: determining a first path which connects the network node to the common source network node along a primary network tree, and determining a second path which connects the network node to the common source network node along a secondary network tree, wherein the first path and the second path show redundancy with respect to each other; receiving, at the network node, multicast data from the common source network node via the first path; triggering, by the network node, reception of multicast data from the common source network node via the second path if the network node detects a failure of the first path (e.g., determines that no multicast data is received via the first path).Type: GrantFiled: February 15, 2012Date of Patent: June 7, 2016Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Gabor Sandor Enyedi, András Császár
-
Publication number: 20160094380Abstract: A technique for informing nodes in a communications net work about changes in a state of the communications network using notification packets is described. In that technique, the communications network is reconfigured using a fast reroute protocol responsive to the state change. A method aspect of the technique comprises generating, upon a network state change, a notification packet. Generating the notification packet includes adding a unique identifier to the notification packet.Type: ApplicationFiled: December 20, 2013Publication date: March 31, 2016Inventors: Gabor Sandor Enyedi, András Császár
-
Patent number: 9264322Abstract: There is provided a method for use by a router in a communications network. Forwarding information is maintained (S1) which specifies the next hop node for each of a plurality of possible destination nodes. Update information is maintained (S1) which specifies how, if at all, the next hop nodes specified in the forwarding information are to be updated for a plurality of possible network resource failures. Known failure information is maintained (S1) which relates to a known network resource failure or which specifies that there is no known network resource failure. A failure notification is received (S2) relating to a network resource failure. In response to receipt of the failure notification, it is determined (S3) from the failure notification how, if at all, the known failure information is to be updated, and the known failure information is updated, if required, based on the determination (S4). A communications packet is received (S5).Type: GrantFiled: October 7, 2010Date of Patent: February 16, 2016Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: András Császár, Gabor Sandor Enyedi, Sriganesh Kini