Patents by Inventor Peter Lundh
Peter Lundh 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: 8369221Abstract: A mechanism is provided to resolve the Iub transport network congestion efficiently for HSDPA by dynamic adjustment of the transmit window of the RLC. The RLC protocol is extended with congestion control functionality. The Iub TN and Uu congestion detection method in the Node-B (120) signals the congestion to the RNC (110), and this congestion indication is used by RLC to react on the congestion situation. In the RNC (110), the transmission window of the RLC is adjusted to control the flow rate. When congestion is detected, the RLC transmission window size is decreased. When there is no congestion, then the RLC transmission window size is increased automatically. Different types of congestion are distinguished and are handled in different ways. Alternatively, congestion control is achieved without any modification in the RLC layer from the existing standard. Here, RLC STATUS PDUs are used to change the RLC transmission window size.Type: GrantFiled: October 29, 2008Date of Patent: February 5, 2013Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Sandor Racz, Zoltan C. Nagy, Szilveszter Nadas, Peter Lundh
-
Patent number: 8339962Abstract: In one aspect, a method and apparatus are disclosed that can provide an efficient and robust HSDPA flow control solution. The RNC (110) can receive information regarding allowed data rate from the Node-B (120) for a data flow in a downlink direction. Based on the received data rate information and optionally based on other predetermined considerations, the RNC (110) adjusts the RLC PDU transmission window size for the data flow. When the RLC PDU transmission window is properly sized, reaction to congestion can be performed quicker relative to the existing Iub flow control.Type: GrantFiled: October 29, 2008Date of Patent: December 25, 2012Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Sandor Racz, Peter Lundh, Szilveszter Nadas, Zoltan C. Nagy
-
Patent number: 8320573Abstract: A hearing device having an input unit for converting an acoustic input to a first signal, an output unit for converting a second signal to an acoustic output and a signal processing unit for generating said second signal from said first signal based on a setting indicating a characteristic of a user's ear, said signal processing unit coupling said input unit and said output unit, to a corresponding method for providing a hearing aid and a corresponding computer program. In order to provide an adaptive hearing device and a method for providing a hearing aid which allow for a compensation for the change in a characteristic of a user's ear, in particular for the change to the ear of a child during growth and which are of a low complexity and do not need additional sensors.Type: GrantFiled: December 17, 2008Date of Patent: November 27, 2012Assignee: Oticon A/SInventors: Peter Lundh, Mark Flynn
-
Patent number: 8315644Abstract: 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: GrantFiled: November 28, 2006Date of Patent: November 20, 2012Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Peter Lundh, Carola Faronius, János Farkas, Sándor Rácz, Szilveszter Nádas
-
Patent number: 8284667Abstract: 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: GrantFiled: October 29, 2008Date of Patent: October 9, 2012Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Sandor Racz, Peter Lundh, Szilveszter Nadas, Zoltan Nagy C
-
Patent number: 8270298Abstract: 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: GrantFiled: August 26, 2005Date of Patent: September 18, 2012Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Peter Lundh, Szilveszter Nádas
-
Publication number: 20120188957Abstract: Each of a plurality of data frames transmitted from a first node to a second node carry information belonging to one of a plurality of data flows. A determining unit 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 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 bandwidth for transmission from the first node to the second node. It also allocates for each of the remaining data flows a share of the rest of the totally available bandwidth such that the sum of the shares for all said remaining data flows is equal to the rest.Type: ApplicationFiled: January 27, 2012Publication date: July 26, 2012Inventors: Peter Lundh, Szilveszter Nádas
-
Publication number: 20120008501Abstract: A method is disclosed for controlling, according to an additive increase multiplicative decrease (AIMD) principle, the bandwidth sharing among contending traffic flows over a transport network between a radio network controller and a radio base station. According to the method, a relative bit-rate (RBR) is determined (210) for each traffic flow; and the bit-rates of said traffic flows are controlled (220) such that additive increase operations of said AIMD principle depend on the respective RBR of each traffic flow. Embodiments of the invention strive at supporting Gold, Silver and Bronze HSDPA and/or EUL bit-rate subscriptions over a single TN QoS class.Type: ApplicationFiled: March 19, 2009Publication date: January 12, 2012Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Peter Lundh, Lars Blomstergren, Szilveszter Nadas
-
Patent number: 8000249Abstract: 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: GrantFiled: November 28, 2006Date of Patent: August 16, 2011Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Zoltan Nagy, Sandor Racz, Szilveszter Nadas, Peter Lundh
-
Publication number: 20110176422Abstract: The present invention proposes a solution in the area of HSDPA flow control. It proposes an improvement to transport network congestion detection and avoidance. The improvement proposes to use a measurement of incoming bitrate to determine the reduction of bitrate after a transport network congestion event. The advantage is that high bitrate reduction is only used when it is necessary; otherwise only small bitrate reduction is used, which results in small oscillation, and consequently higher transport network utilization.Type: ApplicationFiled: December 19, 2008Publication date: July 21, 2011Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nadas, Peter Lundh, Zoltan Nagy, Sandor Racz
-
Publication number: 20110164500Abstract: The present invention is related to a method, base station (RBS) and computer program for quickly recovering from a detected congestion over the air interface. First the current bitrate at the which the air interface congestion has been detected is stored as a new reference bitrate. Thereafter, the base station (RBS) requests a reduction of the bitrate associated with the air interface. When the congestion condition has subsided the base station (RBS) requests a boost of the bitrate associated with the air interface up to the stored new reference bitrate. When finally the new reference bitrate has been reached, the base station (RBS) requests a linear increase of the bitrate associated with the air interface.Type: ApplicationFiled: June 24, 2008Publication date: July 7, 2011Applicant: Telefonaktiebolaget LM Ericsson (publ)Inventors: Lars Blomstergren, Peter Lundh, Szilveszter Nádas, Zoltán Nagy
-
Publication number: 20100260049Abstract: In one aspect, a method and apparatus are disclosed that can provide an efficient and robust HSDPA flow control solution. The RNC (110) can receive information regarding allowed data rate from the Node-B (120) for a data flow in a downlink direction. Based on the received data rate information and optionally based on other predetermined considerations, the RNC (110) adjusts the RLC PDU transmission window size for the data flow. When the RLC PDU transmission window is properly sized, reaction to congestion can be performed quicker relative to the existing Iub flow control.Type: ApplicationFiled: October 29, 2008Publication date: October 14, 2010Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: Sandor Racz, Peter Lundh, Szilveszter Nadas, Zoltan C. Nagy
-
Publication number: 20100238803Abstract: A mechanism is provided to resolve the Iub transport network congestion efficiently for HSDPA by dynamic adjustment of the transmit window of the RLC. The RLC protocol is extended with congestion control functionality. The Iub TN and Uu congestion detection method in the Node-B (120) signals the congestion to the RNC (110), and this congestion indication is used by RLC to react on the congestion situation. In the RNC (110), the transmission window of the RLC is adjusted to control the flow rate. When congestion is detected, the RLC transmission window size is decreased. When there is no congestion, then the RLC transmission window size is increased automatically. Different types of congestion are distinguished and are handled in different ways. Alternatively, congestion control is achieved without any modification in the RLC layer from the existing standard. Here, RLC STATUS PDUs are used to change the RLC transmission window size.Type: ApplicationFiled: October 29, 2008Publication date: September 23, 2010Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Sandor Racz, Zoltan C. Nagy, Szilveszter Nadas, Peter Lundh
-
Publication number: 20100232293Abstract: Congestion in a radio access network (RAN) associated with transporting uplink information originating from one or more mobile terminals is detected. That detected RAN congestion is reduced using any suitable technique (several examples are described) and may be implemented in one or more nodes in the RAN. One advantageous (but non-limiting) application is to a RAN that supports high speed uplink packet access (HSUPA) and/or one or more enhanced uplink dedicated channels (E-DCHs).Type: ApplicationFiled: March 11, 2010Publication date: September 16, 2010Applicant: Telefonaktiebolaget LM Ericsson (pub)Inventors: Mats Sågfors, Peter Lundh
-
Publication number: 20100220594Abstract: 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: ApplicationFiled: October 29, 2008Publication date: September 2, 2010Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Sandor Racz, Peter Lundh, Szilveszter Nadas, Zoltan Nagy C.
-
Publication number: 20100203893Abstract: 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: ApplicationFiled: November 28, 2006Publication date: August 12, 2010Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Peter Lundh, Carola Faronius, Janos Farkas, Sandor Racz, Szilveszter Nadas
-
Patent number: 7724656Abstract: Congestion in a radio access network (RAN) associated with transporting uplink information originating from one or more mobile terminals is detected. That detected RAN congestion is reduced using any suitable technique (several examples are described) and may be implemented in one or more nodes in the RAN. One advantageous (but non-limiting) application is to a RAN that supports high speed uplink packet access (HSUPA) and/or one or more enhanced uplink dedicated channels (E-DCHs).Type: GrantFiled: January 14, 2005Date of Patent: May 25, 2010Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Mats S{dot over (a)}gfors, Peter Lundh
-
Patent number: 7710922Abstract: 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: GrantFiled: December 30, 2004Date of Patent: May 4, 2010Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Peter Lundh, Szilveszter Nádas
-
Publication number: 20100067383Abstract: 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: ApplicationFiled: November 28, 2006Publication date: March 18, 2010Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Zoltan NAGY, Sandor RACZ, Szilveszter NADAS, Peter LUNDH
-
Publication number: 20100062777Abstract: 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: ApplicationFiled: November 28, 2006Publication date: March 11, 2010Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Szilveszter Nádas, Peter Lundh, Sándor Rácz, Zoltán Nagy