Patent application number | Description | Published |
20110075562 | Rate Shaping For Wireless Communication Using Token Bucket That Allows Token Debt - A modified token bucket algorithm in a rate shaping function of a wireless communication network allows for the “borrowing” of tokens, creating the possibility of a token debt, or a token bucket with a negative Token Bucket Counter (TBC) value. In this modified algorithm, an incoming packet is passed along so long as the TBC is positive, even if the packet must “borrow” some tokens, driving the TBC negative. Subsequent incoming packets are stalled until the TBC reaches a positive value. In one embodiment, the modified token bucket algorithm is not applied to a separate rate shaper, but rather to a queue size limiter that operates with a scheduler on a single queue. The inventive scheduler and queue size limiter deliver fewer, larger packets for transmission, allowing for more efficient packing within transmission frames (reducing or eliminating required padding), and allowing other traffic to be scheduled, thus increasing system throughput. | 03-31-2011 |
20110222406 | Method And Device For Enabling Indication Of Congestion In A Telecommunications Network - The invention relates to a first communication device arranged to provide congestion indications to a second communication device. The first communication device comprises a control unit arranged to determine to apply an indicating congestion mechanism on a first radio bearer to the second communication device based on a quality of service setting of the first radio bearer. The control unit is further arranged to set a congestion threshold value and a first drop threshold value of a packet buffer associated to the first determined radio bearer. The congestion threshold value indicates that when buffered packets in the packet buffer exceeds the set congestion threshold value the control unit is arranged further to transmit over a transmitting arrangement at least one congestion indication to the second communication device. The first drop threshold value indicates a level of the packet buffer that when buffered packets exceeds the first drop threshold value the control unit is arranged to drop at least one packet. | 09-15-2011 |
20110267944 | Admission Control Systems and Methods - In one aspect, the invention provides an adaptive admission control method. In some embodiments, this method includes: (a) storing an admission control threshold value (ACTV) for a GBR capacity partition; (b) for at least a plurality of GBR bearers included in the GBR partition, determining a first performance value for the GBR bearer and determining whether the first performance value for the GBR bearer exceeds a first configured threshold; (c) determine a first percentage value identifying the percentage of GBR bearers included in the GBR capacity partition whose first performance value exceeds the first configured threshold; (d) comparing the first percentage value to a first performance threshold value; and (e) using the result of the comparison in determining whether the ACTV should be increased, decreased or remain the same. | 11-03-2011 |
20150036563 | Admission Control for Control Channel - Network node ( | 02-05-2015 |
20150055460 | Method and Radio Network Node for Managing Radio Resources - A set of radio resources are allocated to a first user equipment ( | 02-26-2015 |
20150109910 | METHOD AND NETWORK NODE FOR DETERMINING ADMITTANCE BASED ON REASON FOR NOT ACHIEVING QUALITY OF SERVICE - Network node ( | 04-23-2015 |
20150117344 | Method and Arrangement for Admission Control in a Shared Channel Environment - Network node and method therein for admission control in a communication system applying shared channels for communication. The method comprises receiving a request for a bearer setup, and deciding whether to accept or reject the request for a bearer setup based on information on current bearers carrying data having a QoS value, and for which bearers a transmission of the data fulfills a criterion, the criterion representing a probability of violating the QoS value. Information on bearers carrying data which do not have a QoS value and information on bearers for which a transmission of data having a QoS value does not fulfill the criterion is disregarded. | 04-30-2015 |
20150271101 | Method and Arrangement for Admission Control Based on Priority Level Based Differentiation - The invention relates to a network node and a method therein for admission control in a wireless communication system. The method comprises receiving a request for a bearer setup from a requesting entity, where the request and/or bearer is associated with a priority level P. The method further comprises obtaining, e.g. receiving or retrieving, reports indicating a priority blocking level, BLi, per monitored system resource, i, needed for setting up a bearer. The method further comprises determining a general priority blocking level BLG, based on the reports. Further, the method comprises deciding whether to accept or reject the request for a bearer setup based on the priority level P and the general priority blocking level BLG. | 09-24-2015 |