Patents by Inventor Gabor Enyedi

Gabor 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: 8804501
    Abstract: A method of routing packets across a packet switched network domain, comprising a multiplicity of nodes. Each node comprises an ingress interface and an egress interface. For each destination node a default and a detour branching are defined, each specifying a route to the destination node. For each two-edge connected node the default and detour branchings do not share a common ingress interface.
    Type: Grant
    Filed: July 16, 2007
    Date of Patent: August 12, 2014
    Assignee: Telefonaktiebolaget L M Ericsson (publ)
    Inventors: Andras Csaszar, Gabor Enyedi
  • Patent number: 8780696
    Abstract: A system, method, and node for implementing lightweight Not-via Internet Protocol fast reroutes of a packet in a telecommunications network between a first node and a destination node. The method determines a shortest path between the first node and the destination node and two redundant trees between the first node and the destination node. Each redundant tree provides an alternate path from the first node and the destination node. When a failure in a link between the first node and the destination node is detected, the packet is forwarded to the destination node via a first redundant tree, and if not available, via a second redundant tree. If the second redundant tree is not available, the packet is dropped. If no failure in the link between the first node and the destination node is detected, the packet is sent via the determined shortest path to the destination node.
    Type: Grant
    Filed: November 16, 2009
    Date of Patent: July 15, 2014
    Assignee: Telefonaktiebolaget L M Ericsson (Publ)
    Inventors: Gabor Enyedi, András Császár
  • Publication number: 20120039164
    Abstract: A system, method, and node for implementing lightweight Not-via Internet Protocol fast reroutes of a packet in a telecommunications network between a first node and a destination node. The method determines a shortest path between the first node and the destination node and two redundant trees between the first node and the destination node. Each redundant tree provides an alternate path from the first node and the destination node. When a failure in a link between the first node and the destination node is detected, the packet is forwarded to the destination node via a first redundant tree, and if not available, via a second redundant tree. If the second redundant tree is not available, the packet is dropped. If no failure in the link between the first node and the destination node is detected, the packet is sent via the determined shortest path to the destination node.
    Type: Application
    Filed: November 16, 2009
    Publication date: February 16, 2012
    Inventors: Gabor Enyedi, András Császár
  • Publication number: 20100189113
    Abstract: A method of routing packets across a packet switched network domain, comprising a multiplicity of nodes. Each node comprises an ingress interface and an egress interface. For each destination node a default and a detour branching are defined, each specifying a route to the destination node. For each two-edge connected node the default and detour branchings do not share a common ingress interface.
    Type: Application
    Filed: July 16, 2007
    Publication date: July 29, 2010
    Inventors: Andras Csaszar, Gabor Enyedi