Patents by Inventor Szilveszter Nadas

Szilveszter Nadas 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: 20100220594
    Abstract: In one aspect, a mechanism is provided to resolve the Iub transport network congestion in the uplink direction by using the transmission window of the RLC to control the transfer rate of the flow. The RNC (110) detects the Iub TN congestion for the flow in the uplink. The EUL flow control running in the RNC (110) calculates the RLC transmission window size for the UE for the flow and the calculated RLC transmission window size is signaled to the peer RLC entity in the UE (130) through an RLC STATUS PDU.
    Type: Application
    Filed: October 29, 2008
    Publication date: September 2, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Sandor Racz, Peter Lundh, Szilveszter Nadas, Zoltan Nagy C.
  • Publication number: 20100203893
    Abstract: The invention discloses a method (200, 300, 400) for traffic control in a cellular telephony system (100) comprising a number of cells, each cell comprising at least one Radio Base Station, RBS, (170). The system (100) comprises at least one Radio Network Controller, RNC, (110 130 150), for the control of a number of Radio Base stations. The traffic between an RBS and an RNC comprises a number of flows. The invention is intended for the control of flows from the Radio Base Stations to their RNC. The method uses one control function for each flow from each of said Radio Base Stations, and also comprises a congestion detection function (220) which detects the presence or absence of congestion in the traffic from an RBS to an RNC, and which, upon detection of congestion reduces the bit rate of the congested traffic, and in the absence of congestion, increases the bit rate of the previously congested traffic.
    Type: Application
    Filed: November 28, 2006
    Publication date: August 12, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Peter Lundh, Carola Faronius, Janos Farkas, Sandor Racz, Szilveszter Nadas
  • Patent number: 7746806
    Abstract: A method for determining the capacity that is needed on an lub link to fulfill Grade of Service (GoS) requirements in a Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN) for both Dedicated Channel (DCH) traffic and High-Speed Downlink Packet Access (HSDPA) traffic. The method includes determining the bandwidth demand of the HSDPA traffic (ElasticDim); calculating an average bandwidth of the DCH traffic on the lub interface (BW use,avg); setting an initial capacity (Capacity) to the capacity need of the DCH traffic (Capacity DCH), wherein at least the initial capacity will be provided for the DCH traffic in the dimensioned system; and, increasing the value of Capacity until a quality requirement of the HSDPA traffic is fulfilled, the maximum value of Capacity reached being the capacity that is needed for DCH and HSDPA traffic for the lub interface.
    Type: Grant
    Filed: September 11, 2006
    Date of Patent: June 29, 2010
    Assignee: Telefonaktiebolaget L M Ericsson (PUBL)
    Inventors: Sándor Rácz, Szilveszter Nádas, Szabolcs Malomsoky, Balázs Peter Gerö, Ulf Rosberg
  • Patent number: 7710922
    Abstract: A control node (26) of a radio access network participating in a cell change procedure is permitted to begin sending HS-DSCH data frames to a target radio base station (28) even before the control node knows a calculated capacity allocation for the target cell. Such pre-knowledge transmission of HS-DSCH data frames by the control node effectively reduces a control node (e.g., RNC) bitrate transmission gap which otherwise would occur had the control node waited to send the high-speed downlink shared channel (HS-DSCH) data frames after the control node had been informed of the calculated capacity allocation. The control node is permitted to begin sending the HS-DSCH data frames even prior to an activation time (AT), and typically just after a switch time (ST).
    Type: Grant
    Filed: December 30, 2004
    Date of Patent: May 4, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Peter Lundh, Szilveszter Nádas
  • Publication number: 20100097930
    Abstract: A method of controlling the rate of traffic flow through an Iub interface of a Radio Network Controller is described. The method includes obtaining a licensed rate, which defines the maximum throughput permitted through the Iub interface, at the Radio Network Controller. The rate of traffic flow through the Iub interface and all Iu interfaces of the Radio Network Controller is measured, and the extent to which packet switched traffic flow through the Iub interface exceeds the licensed rate identified. If the packet switched traffic flow through the Iub interface exceeds the licensed rate, packets are dropped from traffic flow through the Iub interface to reduce the traffic flow to the licensed rate.
    Type: Application
    Filed: February 8, 2007
    Publication date: April 22, 2010
    Inventors: Sandor Racz, Szilveszter Nádas, Mats Zachrison, Wenbiao Wu
  • Publication number: 20100067383
    Abstract: The invention discloses a method for detecting and controlling traffic congestion in a wireless telecommunications system (100, 300, 400) comprising at least a first node (130, 330, 430) such as a Radio Base Station, and at least one second node (110, 310, 410) such as a Radio Network Controller, the system also comprising a Transport Network, TN (120, 320, 420), for conveying traffic between said first and second nodes, in which system (100, 300, 400) the traffic can comprise one or more flow. The method comprises the use of one flow control function (315, 415) per each of said flows, said one flow control function (315, 415) comprising a congestion detection and control function. In addition, the congestion detection function acts to reduce the traffic on said flow before the system becomes congested.
    Type: Application
    Filed: November 28, 2006
    Publication date: March 18, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Zoltan NAGY, Sandor RACZ, Szilveszter NADAS, Peter LUNDH
  • Publication number: 20100061324
    Abstract: A first device (124) in a High Speed Downlink Packet Access environment (100) may generate a High Speed Down-link Shared Channel data frame (700, 730, 735, 750) that includes a group of packet data units, where a first packet data unit of the group of packet data units is of a different length than a second packet data unit of the group of packet data units. The first device (124) may further transfer the High Speed Downlink Shared Channel data frame (700, 730, 735, 750) to a second device (122).
    Type: Application
    Filed: January 7, 2008
    Publication date: March 11, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Min Liao, Anna Larmo, Peter Lundh, Szilveszter Nadas, Ina Widegren
  • Publication number: 20100062777
    Abstract: A method for traffic control in a cellular telephony system (100), each cell comprising at least one node, an RBS (130), for the control of traffic to and from users (150) in the cell. The traffic to each UE (150) can comprise at least one flow, and the method is intended for control of the flows in the traffic to UEs (150) in the system (100). and comprises one control function for each controlled flow to each of said UEs (150). Said control function comprises a congestion avoidance function (240, 440) which detects the presence or absence of congestion in a flow to an UE (150), and which, upon congestion or low utilization of the network reduces the bit rate to the UE (150) in a non-linear fashion, and which, in the absence of congestion, linearly increases the bit rate of the traffic to the UE (150).
    Type: Application
    Filed: November 28, 2006
    Publication date: March 11, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Szilveszter Nádas, Peter Lundh, Sándor Rácz, Zoltán Nagy
  • Patent number: 7675948
    Abstract: In a circuit switched mobile telecommunications network a performance analysis is provided. In accordance with the invention a method is implemented, which can be carried out both OFF-LINE and ON-LINE, wherein transport channels carrying the circuit switched traffic of a service are found, then bit-streams of the circuit switched traffic are demultiplexed. A traffic database is built and a set of Key Performance Indicators and usage measures characterizing the service are defined and calculated. A passive traffic monitor is also disclosed, which is attached to a standardized interface of the circuit switched mobile telecommunications network consisting of mobile terminals, radio access network and core network. The passive traffic monitor comprises a trace analyzer connected to a signaling analyzer, to a user plane protocol analyzer and to a traffic database writer.
    Type: Grant
    Filed: November 26, 2004
    Date of Patent: March 9, 2010
    Assignee: Telefonaktiebolaget L M Ericsson (Publ)
    Inventors: Szabolcs Malomsoky, Szilveszter Nadas, Laszlo Rozgonyi
  • Publication number: 20090221292
    Abstract: A network includes a first node and a second node and data frames are transmitted from the first node to the second node. Each of the data frames carry information belonging to one of a plurality of data flows. A determining unit (911) determines at periodically repeated times, for each of the data flows, whether there are more data frames in the first node waiting to be transmitted. A capacity allocating unit (919) allocates for each of those data flows for which no data frames have been waiting to be transmitted for a predetermined time period, only a small amount of the totally available bitrate or bandwidth for transmission from the first node to the second node. It also allocates for each of the remaining data flows, for transmission from the first node to the second node, a share of the rest of the totally available bitrate or bandwidth, so that the sum of the shares for all said remaining data flows is equal to the rest.
    Type: Application
    Filed: August 26, 2005
    Publication date: September 3, 2009
    Inventors: Peter Lundh, Szilveszter Nadas
  • Publication number: 20090215462
    Abstract: A network includes a first node and a second node and data frames are transmitted from the first node to the second node. Each of the data frames carry information belonging to one of a plurality of data flows. In a flow control unit (125) there is an estimate or measure determining unit (1201) for determining for each of the data flows, at the ends of first time periods having a predetermined first length, an estimate of or a measure representing the total number of received data frames that have been faulty during the first time period. A reference calculating unit (1101) is connected to the estimate or measure determining unit for calculating, based on the determined estimate or measure, a bandwidth capacity reference value determining the currently maximum allowable bandwidth for transmission from the data transmitting node to the data receiving node. The first node can be a radio network controller and the second node a radio base station, the data frames forwarded in an HS-DSCH over an Iub interface.
    Type: Application
    Filed: August 26, 2005
    Publication date: August 27, 2009
    Inventors: Peter Lundh, Szilveszter Nàdas
  • Publication number: 20090003227
    Abstract: In a circuit switched mobile telecommunications network a performance analysis is provided. In accordance with the invention a method is implemented, which can be carried out both OFF-LINE and ON-LINE, wherein transport channels carrying the circuit switched traffic of a service are found, then bit-streams of the circuit switched traffic are demultiplexed. A traffic database is built and a set of Key Performance Indicators and usage measures characterizing the service are defined and calculated. A passive traffic monitor is also disclosed, which is attached to a standardized interface of the circuit switched mobile telecommunications network consisting of mobile terminals, radio access network and core network. The passive traffic monitor comprises a trace analyzer connected to a signaling analyzer, to a user plane protocol analyzer and to a traffic database writer.
    Type: Application
    Filed: November 26, 2004
    Publication date: January 1, 2009
    Inventors: Szabolcs Malomsoky, Szilveszter Nadas, Laszlo Rozgonyi
  • Publication number: 20080259812
    Abstract: A method for determining the capacity that is needed on an lub link to fulfill Grade of Service (GoS) requirements in a Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN) for both Dedicated Channel (DCH) traffic and High-Speed Downlink Packet Access (HSDPA) traffic, the method comprising the steps of determining the bandwidth demand of the HSDPA traffic (ElasticDim); calculating an average bandwidth of the DCH traffic on the lub interface (BW use,avg) setting an initial capacity (Capacity) to the capacity need of the DCH traffic (Capacity DCH), wherein at least the initial capacity will be provided for the DCH traffic in the dimensioned system; and, increasing the value of Capacity until a quality requirement of the HSDPA traffic is fulfilled, the maximum value of Capacity reached being the capacity that is needed for DCH and HSDPA traffic for the lub interface.
    Type: Application
    Filed: September 11, 2006
    Publication date: October 23, 2008
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Sandor Racz, Szilveszter Nadas, Szabolcs Malomsoky, Balazs Peter Gero, Ulf Rosberg
  • Publication number: 20080002656
    Abstract: A radio base station (RBS) is described herein that detects when a high-speed downlink shared channel (HS-DSCH) data frame (110) is lost after it was transmitted by a radio network controller (RNC) over a transport link (Iub) towards the RBS (104). To accomplish this, the RBS (104) upon receiving a HS-DSCH data frame (110) inspects a frame sequence number (302) located within the received HS-DSCH data frame (110) to determine if the frame sequence number (302) is in sequence with a frame sequence number (302) located within a previously received HS-DSCH data frame (110). If the two frame sequence numbers (302) are not in sequence, then one or more HS-DSCH data frames (110) that were previously transmitted towards the radio base station (104) have been lost.
    Type: Application
    Filed: December 22, 2004
    Publication date: January 3, 2008
    Inventors: Peter Lundh, Szilveszter Nadas
  • Patent number: 7283535
    Abstract: A traffic concentrator (40) aggregates traffic in a radio access network. The traffic concentrator comprises an Asynchronous Transfer Mode (ATM) switch (42) and a control node (44) associated with the ATM switch. The Asynchronous Transfer Mode (ATM) switch which performs a switching operation for switching unspecified bit rate (UBR) virtual channels (VCs) carrying user traffic between plural virtual paths (VPs). The user traffic is transported as ATM Adaptation Layer 2 (AAL2) connections over the unspecified bit rate (UBR) virtual channels (VCs). The control node is arranged to process AAL2 signaling messages which concern the AAL2 connections included in the VCs for which the ATM switch performs the switching operation. The AAL2 signaling messages are carried in virtual channels which do not carry the user traffic and which are either originated or terminated at the control node. In one example implementation, the traffic concentrator aggregates traffic of plural base stations of the radio access network.
    Type: Grant
    Filed: October 28, 2002
    Date of Patent: October 16, 2007
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Szabolcs Malomsoky, Szilveszter Nádas, Sándor Racz
  • Patent number: 7158527
    Abstract: Example embodiments of protocol multiplexing systems comprise a multiplexer which receives multiplexed packet(s) and which uses contents of the multiplexed packets to form carrying packets which are stored in an output buffer. Some of the multiplexed packets belong to differing ones of plural virtual channels, but the multiplexer uses multiplexed packet(s) belonging to only one virtual channel to form a given carrying packet. The multiplexing systems accommodate transmission on a same virtual path of numerous connections belonging to differing virtual channels, balancing both payload efficiency and delay considerations.
    Type: Grant
    Filed: April 2, 2002
    Date of Patent: January 2, 2007
    Assignee: Telefonaktiebolaget Lmeericsson (publ)
    Inventors: Szabolcs Malomsoky, Szilveszter Nádas, Sándor Rácz
  • Publication number: 20060146749
    Abstract: A control node (26) of a radio access network participating in a cell change procedure is permitted to begin sending HS-DSCH data frames to a target radio base station (28) even before the control node knows a calculated capacity allocation for the target cell. Such pre-knowledge transmission of HS-DSCH data frames by the control node effectively reduces a control node (e.g., RNC) bitrate transmission gap which otherwise would occur had the control node waited to send the high-speed downlink shared channel (HS-DSCH) data frames after the control node had been informed of the calculated capacity allocation. The control node is permitted to begin sending the HS-DSCH data frames even prior to an activation time (AT), and typically just after a switch time (ST). In one example mode of operation, the pre-knowledge sending of the HS-DSCH data frames to the target radio base station is performed with a presumptive capacity allocation for the target cell.
    Type: Application
    Filed: December 30, 2004
    Publication date: July 6, 2006
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Peter Lundh, Szilveszter Nadas
  • Publication number: 20050163103
    Abstract: The present invention is generally based on the recognition that the true admissible regions for a multi-service traffic mix can be well approximated by a construction of a non-linear admissible region and one or more linear admissible regions. This makes it possible to accurately control admission of a new connection onto a transport link by checking whether the multi-service traffic mix defined by previously admitted connections together with the new connection is contained within an intersection on a non-linear admissible region and at least one linear admissible region, and admitting the connection if the traffic mix is contained within the intersecton of regions.
    Type: Application
    Filed: March 13, 2002
    Publication date: July 28, 2005
    Applicant: Telefonakiebolaget LM Ericsson (publ)
    Inventors: Szabolcs Malomsoky, Szilveszter Nadas, Sandor Racz
  • Publication number: 20040081168
    Abstract: A traffic concentrator (40) aggregates traffic in a radio access network. The traffic concentrator comprises an Asynchronous Transfer Mode (ATM) switch (42) and a control node (44) associated with the ATM switch. The Asynchronous Transfer Mode (ATM) switch which performs a switching operation for switching unspecified bit rate (UBR) virtual channels (VCs) carrying user traffic between plural virtual paths (VPs). The user traffic is transported as ATM Adaptation Layer 2 (AAL2) connections over the unspecified bit rate (UBR) virtual channels (VCs). The control node is arranged to process AAL2 signaling messages which concern the AAL2 connections included in the VCs for which the ATM switch performs the switching operation. The AAL2 signaling messages are carried in virtual channels which do not carry the user traffic and which are either originated or terminated at the control node. In one example implementation, the traffic concentrator aggregates traffic of plural base stations of the radio access network.
    Type: Application
    Filed: October 28, 2002
    Publication date: April 29, 2004
    Inventors: Szabolcs Malomsoky, Szilveszter Nadas, Sandor Racz
  • Publication number: 20030185213
    Abstract: Example embodiments of protocol multiplexing systems comprise a multiplexer which receives multiplexed packet(s) and which uses contents of the multiplexed packets to form carrying packets which are stored in an output buffer. Some of the multiplexed packets belong to differing ones of plural virtual channels, but the multiplexer uses multiplexed packet(s) belonging to only one virtual channel to form a given carrying packet. The multiplexing systems accommodate transmission on a same virtual path of numerous connections belonging to differing virtual channels, balancing both payload efficiency and delay considerations.
    Type: Application
    Filed: April 2, 2002
    Publication date: October 2, 2003
    Inventors: Szabolcs Malomsoky, Szilveszter Nadas, Sandor Racz