97 results about "Leaky bucket" patented technology

A system and process for controlling the coding bit rate of streaming media data is presented where a server streams data that exhibits one of a number of coding bit rates supported by the server. Initially, the server chooses the coding bit rate. However, after this startup period, the client provides coding bit rate requests. The server transmits the streaming media data at the most appropriate supported coding bit rate closest to the rate requested. The coding bit rates requested are those estimated to provide a high quality playback of the streaming data while still keeping a decoder buffer of the client filled to a desired level. A leaky bucket model is incorporated so that the changes in buffer duration due to natural variation in the instantaneous coding bit rate are not mistaken for changes in buffer duration due to network congestion.

A system and method for real time transmission of variable bit rate MPEG video traffic with consistent quality, wherein each frame is encoded with quantization parameter generated from an encoder rate controller, and encoded data is transmitted to an encoder buffer. Transmission rate about each frame interval is determined by a channel rate controller at the beginning of the frame interval. Data transmission buffered at the encoder buffer is first regulated by Leaky Bucket counter, and the regulated data is transferred to a decoder buffer in a video receiving system through network. The encoder rate controller and channel rate controller included in the VBR video transmission system control the transmission rate generated from the video encoder and that from the network with satisfying imposed constrained conditions, respectively.

A method for policing traffic on a computer communications network having a multitude of nodes interconnected by various communications media. An individual policer is established at each node for monitoring and/or policing the traffic incoming to that node. Traffic policy parameters are established for traffic-classes and the policy is implemented at each individual policer. Thresholds may be established and when the thresholds are met or exceeded the individual policer will export the traffic conditions at the respective node. The other individual policers or a master policer will receive the exported information. -The individual policers police the traffic incoming to its associated node depending on the traffic condition information received from all the nodes. Several classes may be handled by each individual policer. Leaky bucket algorithms may be used in some instances.

A leaky-bucket style thread scheduler for scheduling concurrent execution of multiple threads in a microprocessor is provided. The execution pipeline notifies the scheduler when it has completed instructions. The scheduler maintains a virtual water level for each thread and decreases it each time the execution pipeline executes an instruction of the thread. The scheduler includes an instruction execution rate for each thread. The scheduler increases the virtual water level based on the requested rate per a predetermined number of clock cycles. The scheduler includes virtual water pressure parameters that define a set of virtual water pressure ranges over the height of the virtual water bucket. When a thread's virtual water level moves from one virtual water pressure range to the next higher range, the scheduler increases the instruction issue priority for the thread; conversely, when the level moves down, the scheduler decreases the instruction issue priority for the thread.

A method for scheduling a network resource comprises adding tokens to first and second accumulators at first and second fill rates, respectively. A number of tokens corresponding to a size of a packet is subtracted from the first accumulator and a highest priority is assigned to a queue with which the packet is associated, if a number of tokens in the first accumulator is greater than zero. The number of tokens is subtracted from the second accumulator, and a default priority assigned to the queue, if the number of tokens in the first accumulator is less than zero and a number of tokens in the second accumulator is greater than zero. The network resource is assigned for transmission of the packet from the queue using a schedule that is based on the priority assigned to the queue. The packet is transmitted using the assigned network resource.

A method and device for delivering multimedia data using IETF QoS protocols. MPEG media data can be transmitted in packet units through a network using the IETF QoS protocol by mapping MPEG media traffic factors onto IETF QoS traffic factors. By encoding or transcoding MPEG media traffic according to a double leaky bucket condition indicated by the four factors, a maximum bit rate, a first buffer size, a guaranteed bit rate, and a second buffer size, the MPEG media traffic factors may be transmitted using the IETF QoS protocol without having to go through the process of being mapped onto QoS traffic factors.

A distributed flow control system and method for GPRS networks to control and regulate data flow between multiple sources and a single destination within a GPRS network. The present system and method ensures the departing traffic from all of the sources conforms to the peak and average rate requirements that have been set forth by the BSS/PCU. A leaky bucket flow control mechanism is used at each respective one of the multiple sources for controlling flow of data from each respective source to the single destination. A maximum bucket size of a leaky bucket and a bucket leak rate are defined for each leaky bucket flow control mechanism. A multiplier (L) is estimated and determined for each respective source based on recent data arrival behaviors of the multiple sources. When a frame of the data is sent from the respective source to the single destination, a number of bytes equal to the size of the transmitted frame times the multiplier L is added to the leaky bucket.

A network device for scheduling packets in a plurality of queues includes a plurality of leaky bucket modules, each of the plurality of leaky bucket mechanisms being associated with one of a plurality of queues and configured to process information based on a predefined bandwidth, a scheduler configured to schedule services of the plurality of queues and a metering module for tracking whether or not the plurality of queues has exceeded a predefined threshold through the leaky bucket modules. If the plurality of queues has exceeded the predefined threshold, the metering module is configured to compute a new bandwidth allocation for each of the plurality of queues, the new bandwidth allocation replacing the predefined bandwidth and being proportional to the predefined bandwidth for each of the plurality of queues.

A traffic shaper comprises a bandwidth controller 40 having a plurality of leaky bucket units 41-1 to 41-n prepared in correspondence with buffer memories 20-1 to 20-n, and an output queue designation unit 43 for specifying a buffer memory from which a packet is to be read out. Each of the leaky bucket units 41 has a level counter 416 for decrementing the count value at a predetermined rate, and a level increaser 411 to 417 for increasing the count value of the level counter by a value proportional to the product of the length of a transmitted packet and a unitary increment value which is variable depend on the current count value of the level counter.

Method and apparatus embodiments are provided for dynamical adjusting a retry service request timer associated with User Equipment (UE) responsive to a service request based on a current load. In one embodiment, a method includes receiving a service request, and modifying a timer value associated with a User Equipment (UE) responsive to the service request based on a current load. The timer value is indicative of a period the UE is to wait before making a next service request. The timer value may be modified based on a leaky bucket algorithm. When the current load is indicative of an overload condition, the timer value is increased. For example, when the total number of service request establishment failures is above the high water mark, the timer value may be is increased. The timer value may be communicated to the UE.

A signal which varies over time is monitored to determine an alarm condition, where the sample stream of digital values from an A/D converter is divided in to equal length pieces and a Fourier Transform (FT) algorithm is used to transform each piece of the stream into a three dimensional dataset including frequency domain amplitude, frequency and time. A Frequency Envelope is calculated by taking the maxima over the time dimension for a period of time, leaving a two dimensional frequency domain amplitude vs frequency dataset which is compared with new data arriving to determine the alarm condition for each element of the Frequency Envelope either by applying a constant delta additively or multiplicatively or by using a “leaky bucket” algorithm.

The invention discloses a method and user device for triggering buffer area state report, belonging to the communication field. The method comprises the following steps: obtaining the water quantity for ensuring bit rate in PBR leaky bucket of radio bearer; and when the water quantity of PBR leaky bucket of radio bearer reaches the water quantity threshold of PBR leaky bucket of radio bearer and the radio bearer contains data to be sent, triggering the buffer area state report. The user device comprises an obtaining module and a triggering module. The method provided by the embodiment of the invention can timely trigger BSR, do not caused radio bearer resource starvation, reduce the cost used for sending BSR and provide efficient and fair buffer area state information needed by uplink scheduling so as to ensure the QoS requirements of various services.

A method is provided of regulating a load placed on a first node of a telecommunications network caused by messages sent to the first node by a second node of the network according to a signalling protocol between the first node and the second node, comprising: using a leaky bucket restrictor associated with the second node to regulate the load, the leaky bucket having an adjustable leak rate; determining a roundtrip response delay relating to at least some of the messages during a measurement period; and adjusting the leak rate in dependence upon the determined response delay.

The invention includes a method and apparatus for performing packet policing by operating an input queue as a leaky bucket queue. The method includes storing a received packet in a shared memory shared by a plurality of input queues and a plurality of output queues, storing a corresponding packet pointer for the packet in one of the plurality of input queues, transferring the packet pointer from the one of the plurality of input queues to one of the plurality of output queues associated with an output port to which the packet is assigned, and transmitting the packet from the output port using the packet pointer. The packet pointer identifies a storage location in the shared memory. The packet pointer is removed from the one of the plurality of output queues and used for retrieving the packet from the shared memory.