Patents by Inventor Andras Csaszar

Andras Csaszar 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: 20120079056
    Abstract: There is described a method and apparatus for sending data through one or more packet data networks. A stripped-down packet is sent from a packet sending node towards a cache node, the stripped down packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the stripped-down packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the stripped-down packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.
    Type: Application
    Filed: January 26, 2010
    Publication date: March 29, 2012
    Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
    Inventors: Zoltán Richárd Turányi, András Császár, Ayodele Damola, Stefan Hellkvist, Attila Mihály, Lars Westberg
  • 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: 20120026884
    Abstract: The present invention relates to a solution for handling mobility and attachment of users in a wireless communication network (10). User equipment (1) is connected logically to an attachment node (14) at initial attachment and this attachment is determined from an analysis of stored historical mobility patterns of the user equipment. For instance, a mobility management device may be responsible for handling the attachment and for handling the determination of suitable attachment node, e.g. a gateway (5, 7, 8).
    Type: Application
    Filed: April 8, 2009
    Publication date: February 2, 2012
    Applicant: Telefonaktiebolaget L M Ericsson
    Inventors: Hans-Olof Sundell, Andras Csaszar, Christian Gotare, Attila Mihaly, Lars-Bertil Olsson, Lasse Olsson
  • Publication number: 20110277009
    Abstract: The present invention relates to a method for controlling downloading of video segments or segmented video stream to a subscriber client unit, and a subscriber client unit adapted to perform said method. One object of the invention is to guarantee seamless playback and the optimal server load. Said object is by a method and a subscriber client unit that is controlled by a segment selector (SSA) and a server bandwidth control (SBC) algorithm.
    Type: Application
    Filed: October 8, 2009
    Publication date: November 10, 2011
    Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
    Inventors: Ayodele Damola, András Császár, Ákos Kiss, Attila Köröse, Csaba Lukovszki, Balázs Székely
  • Publication number: 20110243024
    Abstract: Disclosed is a method of selecting a data source node from a plurality of data source nodes, the selected data source node being used to send data to a data requesting node over a packet data network. The method includes, at an intermediate node of the network, intercepting at least one message sent to or from the data requesting node, the message(s) relating to data source node suitability, determining a cost of communication between the data requesting node and each of the data source nodes to which the message(s) relate, and influencing data source node suitability information sent to the data requesting node to take account of the cost to enable the data requesting node to use the information to select a data source node.
    Type: Application
    Filed: December 2, 2008
    Publication date: October 6, 2011
    Inventors: Jacob Österling, András Császár, Anne-Marie Bosneag
  • Patent number: 8009568
    Abstract: Reducing congestion in an IP domain wherein congested data flows arriving at an egress edge node of the network are identified. Total congestion represented by the congested flows is determined, and a congestion extent notification is sent from the egress edge node to its ingress edge node peer. The congestion extent notification includes information regarding the total congestion and is sent on a per-class basis. Congested core routers in the network insert DSCPs into data packets passing through them to enable the egress edge nodes to identify the affected flows. The core routers may also send congestion metric messages, designed to follow the same path as the marked packets, to inform the egress edge nodes of the extent of congestion. In an alternative method, the egress edge nodes inform their ingress peers that congestion is present, without initially identifying the extent. The ingress edge node sends a query downstream with a congestion metric.
    Type: Grant
    Filed: November 9, 2006
    Date of Patent: August 30, 2011
    Assignee: Telefonaktiebolaget L M Ericsson (publ)
    Inventors: Ferenc Pinter, Attila Bader, Andras Csaszar, Attila Takacs
  • Publication number: 20110142044
    Abstract: Method and apparatus for controlling transmission of data packets in a packet-switched network. When a first end-host (A) sends an address query to a DNS system (300) for a second end-host, the DNS system responds by providing a sender key created from a destination key registered for the second end-host, if the first end-host is authorised to send packets to the second end-host. Thereby, the first end-host, if authorised, is able to get across data packets to the second end-host by attaching a sender tag (TAG) generated from the sender key, as ingress tag to each transmitted data packet. A router (302) in the network matches an ingress tag in a received packet with entries in a forwarding table and sends out the packet on an output port (X) according to a matching entry. Otherwise, the router discards the packet if no matching entry is found in the table.
    Type: Application
    Filed: August 22, 2008
    Publication date: June 16, 2011
    Inventors: Andras Csaszar, Lars Westberg, Mats Naslund, Lars G. Magnusson
  • Publication number: 20110064085
    Abstract: Method and apparatus for controlling the routing of data packets in an IP network (200). A DNS system (202) stores a packet admission policy configured for a first end-host (B) that dictates conditions for allowing other end-hosts to get across data packets to the first end-host or not. A routing voucher is defined which is required for routing data packets to the first end-host. The routing voucher is distributed to routers (R) in the IP network. When an address query is received at the DNS system (202) from a second end-host, the voucher is supplied to the second end-host if the configured policy allows the second end-host to convey data packets. Otherwise, the voucher is not supplied. If allowed, the second end-host will add the routing voucher to any data packets directed to the first end-host. When a valid routing voucher is present in a packet at a router (204) in the network, the packet will be forwarded to the next router in the IP network. The router will otherwise discard the packet.
    Type: Application
    Filed: May 22, 2008
    Publication date: March 17, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Lars Westberg, Andras Csaszar, Mats Naslund
  • Publication number: 20110044171
    Abstract: The invention relates to techniques for traffic handling in congestion situations in a point-to-multipoint (‘PTM’) enabled network. A method embodiment of the inventive technique is performed in an egress node of the network and comprises the steps of detecting marked packets, the marking being indicative of a congestion situation in a core node of the PTM-enabled network; selecting, based on the detected markings, a particular PTM flow from one or more PTM flows passing the egress node for termination; and indicating the selected PTM flow in an upstream direction of the selected flow.
    Type: Application
    Filed: April 25, 2008
    Publication date: February 24, 2011
    Inventors: Andras Csaszar, Attila Bader, Csaba Antal
  • Publication number: 20110032843
    Abstract: A method for setting up a VPN is described. The VPN is set up in a backbone network having a plurality of PE routers for controlling the transfer of IP traffic to and from CE routers in satellite networks. In a PE router, a VRF is configured for the VPN and populated with local routes for the VPN. A VLAN identifier is assigned for the VPN, and advertised to other PE routers in the backbone network. Alternatively, the VLAN identifier may be determined by a predetermined mapping algorithm so it will be unique to the VPN in all PE routers, in which case the advertisement to other PE routers may contain an implicit NULL label.
    Type: Application
    Filed: April 10, 2008
    Publication date: February 10, 2011
    Inventors: Oktavian Papp, András Császár, Attila Mihály, Lars Westberg, Gabor Toth
  • Publication number: 20110022728
    Abstract: The present invention relates to a method and apparatus for synchronizing local databases maintained control plane (CP) nodes in a GMPLS network. CP nodes that are not involved in path computation do not need to store the TE information contained in opaque link state advertisements (LSAs). These CP nodes only store that part of an opaque LS which is used during the flooding procedure to verify if the LS is new or updated. This verification is based on a few fields of the LSA that contain link state (LS) identifying information. A CP node that is not involved in path computation stores only the LS identifying information and discards the remainder after the LSA is relayed to it neighbor CP nodes.
    Type: Application
    Filed: July 22, 2009
    Publication date: January 27, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: András Kern, András Császár, Benoit C. Tremblay
  • Publication number: 20110019654
    Abstract: A method is provided of enabling access for a terminal (12-1) to a remote network (60) via a mobile network (40). A first connectivity service function (30) is provided as part of the mobile network (40). A second connectivity service function (20) is provided as part of the remote network (60). A third connectivity service function (10) is provided associated with the terminal (12-1). The first connectivity service function (30) is adapted to cooperate in establishing a first layer 2 tunnel (25) between itself (30) and the second connectivity service function (20). The first connectivity service function (30) is also adapted to cooperate in establishing a second layer 2 tunnel (15) between itself (30) and the third connectivity service function (10). The terminal (12-1) thereby has layer 2 access into the remote network (60) through the first and second tunnels (25, 15) using the first, second and third connectivity service functions (30, 20, 10).
    Type: Application
    Filed: December 17, 2008
    Publication date: January 27, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Janos Harmatos, Andras Csaszar, Attila Mihaly, Oktavian Papp, Zoltan Toth, Lars Westberg
  • Publication number: 20100309784
    Abstract: A method and apparatus for selecting an edge node from a plurality of edge nodes in a fixed access communications network. A selection node receives from a host entity a request for a network service. The selection node then obtains, from at least one further network node, data relating to a plurality of edge nodes. On thebasis of the retrieved data, the selection node selects an edge node from the plurality of edge nodes, wherein the selected edge node provides a path between the host entity and the requested network service. The selection node then sends a response to the host entity, the response including information identifying the selected edge node.
    Type: Application
    Filed: January 23, 2008
    Publication date: December 9, 2010
    Inventors: Attila Mihaly, Andras Csaszar, Oktavian Papp, Lars Westberg
  • Publication number: 20100309894
    Abstract: A method of allowing a nomadic terminal to access a home network on the Layer 2 level. The method comprises connecting said terminal to a remote access network via an access point, the remote access network being connected to an operator's backbone network via a remote access router. Signalling is exchanged between the access point and an authentication server within the backbone network in order to authenticate the terminal to the authentication server and, following successful authentication, a Layer 2 tunnel extending across the backbone network is established for the purpose of connecting said nomadic terminal to the home network.
    Type: Application
    Filed: September 7, 2007
    Publication date: December 9, 2010
    Applicant: Telefonaktiebolaget L M Ericsson (publ)
    Inventors: Andras Csaszar, Janos Harmatos, Attila Mihaly, Oktavian Papp, Lars Westberg
  • Patent number: 7849215
    Abstract: Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification.
    Type: Grant
    Filed: March 31, 2006
    Date of Patent: December 7, 2010
    Assignee: Telefonaktiebolaget L M Ericsson (Publ)
    Inventors: Andras Csaszar, Attila Takacs, Attila Bader
  • Publication number: 20100284305
    Abstract: A method for setting up a VPN is described. The VPN is set up in a backbone network having a plurality of PE routers for controlling the transfer of IP traffic to and from CE routers in satellite networks. In a PE router, a VRF is configured for the VPN and populated with local routes for the VPN. A VRF IP loopback address is assigned for the VRF, and a PE IP loopback address is assigned for the ingress PE router. A local route with the VRF and PE IP loopback addresses is then advertised to other PE routers in the backbone network.
    Type: Application
    Filed: January 9, 2008
    Publication date: November 11, 2010
    Inventors: Oktavian Papp, Attila Mihaly, András Csàszàr, Lars Westberg
  • Publication number: 20100272107
    Abstract: A technique for address resolution in data transmission networks, for example ARP-based address resolution in IPv4 networks. An embodiment of the technique comprises the following steps performed in a host of the data transmission network: Maintaining an association of at least one physical address with at least one network address range comprising multiple network addresses; obtaining a target network address; comparing the target network address with the network address range to determine an associated target physical address; and providing the determined target physical address, e.g. for initiating a data transmission.
    Type: Application
    Filed: November 26, 2007
    Publication date: October 28, 2010
    Inventors: Oktavian Papp, András Császár, Attila Mihály, Lars Westberg
  • Publication number: 20100250930
    Abstract: A method and apparatus for protecting the routing of data packets in a packet data network. When a first end-host sends an address query to a DNS server system regarding a second end-host, the DNS server system responds by providing a destination parameter containing an encrypted destination address associated with the second end-host. Thereby, the first end-host is able to get across data packets to the second end-host by attaching the destination parameter to each transmitted data packet. A router in the packet data network admits a received packet if a destination parameter is attached to the pocket including a valid destination address encrypted by a key dependent on a distributed master encryption key. Otherwise, the router discards the packet if no such valid destination address can be derived from the packet by applying decryption to the destination parameter.
    Type: Application
    Filed: May 9, 2008
    Publication date: September 30, 2010
    Inventors: Andras Csaszar, Lars Westberg, Mats Naslund
  • 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
  • Publication number: 20100188986
    Abstract: A network node (e.g., edge node, muter, network management node) is described herein that implements a method for providing fast and exact traffic information during normal traffic fluctuations in a network and also during a sudden and big change in the traffic conditions of the network. In one embodiment, the method monitors a parameter of traffic flowing within a network by: (1) measuring a traffic parameter (mi); and (2) determining whether a value of the measured parameter (mi) is significantly different than a value of an average of previously measured parameters (avgi-1); (2a) if yes, then quickly adapting a value of an updated average of measured parameters (avgi) to be closer to the value of the measured parameter (mi); and (2b) if no, then slowly adapting the value of the updated average of measured parameters (avgi) to be closer to the value of the measured parameter (mi).
    Type: Application
    Filed: November 29, 2006
    Publication date: July 29, 2010
    Inventors: Andras Csaszar, Attila Bader