Patents by Inventor András Császár

András Császár 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: 20100182907
    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: Application
    Filed: November 9, 2006
    Publication date: July 22, 2010
    Inventors: Ferenc Pinter, Attila Bader, Andras Csaszar, Attila Takacs
  • Publication number: 20100177633
    Abstract: A method of managing quality of service in an IP network is provided. The method comprises identifying, at an egress edge node of the network, that congestion is present in one or more routers within the network. Data flows for termination to remove the congestion are selected. At least one flow termination notification is sent from the egress edge node to an ingress edge node of the network, the at least one flow termination notification identifying the selected data flows. Low priority flows from the selected data flows are terminated at the ingress edge node immediately. High priority flows are terminated only if congestion is still present after a predetermined delay period. The delay may be applied in the ingress edge node or the egress edge node. The invention also provides a method for admitting low priority flows into the network only if the network has resources available for a number of high priority flows above a dynamically determined threshold.
    Type: Application
    Filed: May 29, 2007
    Publication date: July 15, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (pub)
    Inventors: Attila Bader, Andras Csaszar
  • Publication number: 20100172293
    Abstract: Mobility between access domains in an Internet Protocol (IP) network can be supported by introducing a so-called Mobility Manager (MM) that maintains a database of currently attached devices and their current access domain location. The mobility manager may then detect, for a device registered in the database, a change of access domain from a first access domain to a second access domain by monitoring connection maintenance signaling related to the considered device. The mobility manager should at least obtain an indication of such a change of access domain. In response to a detected change of access domain, the mobility manager arranges for a reconfiguration of the network to forward traffic destined to an IP address of the device in the first access domain to a new location in the second access domain. In this way, the mobility manager allows the device to keep its IP address when moving between access domains.
    Type: Application
    Filed: January 14, 2008
    Publication date: July 8, 2010
    Inventors: Gábor Tóth, András Császár, Attila Mihaly, Zoltán Richárd Turányi
  • Publication number: 20100157807
    Abstract: In a packet switched communications transport network a method for re-routing traffic flow is provided. The invention based on the recognition of actual utilization of transport resources. In accordance with the implementation, Fast Re-Route detour paths are recalculated each time after new bandwidth information is received. The detours are re-established on new computed paths if needed, i.e., if an optimized path has been found. A node and a system are also disclosed, referring to MPLS network. Also a node is described acting as a Point of Local Repair for link failures. The node comprises a Routing engine, a Link state database, a Detour path calculator and a Detour path establisher in order to capture bandwidth information of the network links and to calculate detour path information for the nodes.
    Type: Application
    Filed: July 20, 2007
    Publication date: June 24, 2010
    Inventors: Andras Csaszar, Attila Mihaly, Octavian Papp
  • Publication number: 20100150024
    Abstract: Disclosed is a method of configuring routing information in a network router linked into a network. The network router has a forwarding table. The method comprises removing the forwarding table entries which are not used. A network router configured in accordance with the method has a forwarding table comprising only forwarding table entries that are used.
    Type: Application
    Filed: February 8, 2007
    Publication date: June 17, 2010
    Inventors: Alpár Jûttner, Andràs Császár, Attila Mihâly
  • Publication number: 20100034090
    Abstract: An egress node is proposed for a network domain that comprises at least one ingress node for receiving and routing data units belonging to a plurality of flows into said network domain, a plurality of interior routers for routing said data units through said network domain, and said egress node(s). One or more of the interior routers is arranged to detect whether it is subject to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that comprises a part for detecting the presence of congestion marked data units arriving at said edge node, and a part for reacting to the detection of the presence of congestion marked data units by invoking a congestion control process.
    Type: Application
    Filed: November 10, 2006
    Publication date: February 11, 2010
    Inventors: Attila Bader, Attila Takacs, Andras Csaszar
  • Publication number: 20090274165
    Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.
    Type: Application
    Filed: August 23, 2005
    Publication date: November 5, 2009
    Inventors: Andras Csaszar, Attila Takacs, Attila Bader
  • Publication number: 20090049194
    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 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: Application
    Filed: March 31, 2006
    Publication date: February 19, 2009
    Inventors: Andras Csaszar, Attila Takacs, Attila Bader
  • Publication number: 20070268827
    Abstract: A system a core (104), an edge node (102, 103) and a method are provided for congestion handling in a packet switched network domain. In case of congestion overload is measured, the data packets in proportion to the overload are marked and the signaled overload is stored. At least one egress node (103) receives marked and not marked packets, decodes and counts the overload from the marked packets in a counting interval. Congestion report messages are sent to ingress nodes (102) where flows are terminated. A core node (104) comprises a storage means (314) taking into account the previously signaled overload, which are already being handled in a congestion handling control loop. An edge node (103) comprises means for adding new flows to the set of affected flows, means for identifying affected flows to be terminated so that the number of identified affected flows should generate together traffic equal to the overload, and means for removing flows to be terminated from set of affected flows.
    Type: Application
    Filed: November 12, 2004
    Publication date: November 22, 2007
    Inventors: Andras Csaszar, Attila Takacs, Attila Bader, Robert Szabo, Lars Westberg
  • Publication number: 20030233422
    Abstract: The invention provides a generalized tool for information publishing and personal communication that is not limited to a dedicated purpose. The invention improves the processes associated with the creation, review, alteration, distribution and publishing of a compound derivative digital object capturing information on referred content accessible to users on an electronic information network and comprises any of the relevant characteristics of the referred content, such as its name, headline, content excerpt or sample, thumbnail-size illustration, link to network location. In particular, the invention provides an apparatus and method for easy capturing of such characteristics of referred content in a derivative digital object, altering its components and storing or transferring such derivative digital object, in the form expressed in a flyer metaphor, to other users of the electronic information network.
    Type: Application
    Filed: June 12, 2003
    Publication date: December 18, 2003
    Inventors: Andras Csaszar, James J. Spencer
  • Patent number: 5937404
    Abstract: A system for organizing access to a database that is distributed over an electronic network includes a system site on a dedicated server. A list of addresses to approved database sites on an electronic network stored on the system site is accessed by a user with a browser application. Reference cards permit the user to search and review the list of approved sites. In a first preferred embodiment, a request for access to a database site is made to the dedicated server. Access is denied for a non-approved site. An approved database is retrieved by the dedicated server. Each database link to an approved site is modified from direct to indirect to require all future access to be directed through the dedicated server. Links not in the list of approved sites will have their access denied. In a second, equally preferred embodiment, code defining a database location is removed at the dedicated server to de-activate links to non-approved database sites.
    Type: Grant
    Filed: April 23, 1997
    Date of Patent: August 10, 1999
    Assignee: Appaloosa Interactive Corporation
    Inventors: Andras Csaszar, Stephen Friedman, Gabor Ligeti