Abstract: A bandwidth packing rate control technique includes altering bandwidth allocations of existing flows on a link depending on a current utilization of a current bandwidth allocation for a flow. A disclosed example decreases the bandwidth allocation for flows that are utilizing a current bandwidth allocation below a selected target utilization rate. Flows with higher utilization can receive increased bandwidth allocation, which provides increased throughput for such flows. One overall result of a disclosed example is increased utilization and increased throughput using existing bandwidth resources.

Abstract: By approximating a packet network, such as the Internet, by an M/M/1 queuing model, the available bandwidth of the network can determined from the variance of the distribution of the sojourn times of packets transmitted through the network. In order to determine the variance of the distribution of sojourn times, and thus the bandwidth of the packet network that is available for transport of packets from an input to an output, a probe train of N packets with known inter-packet intervals is injected from an input on a sending side of the network. At the receiving side of the network, the packet arrival times are measured and the inter-packet intervals of each pair of received packets in the received train are calculated and compared with the known inter-packet interval times of the corresponding input packets.

Abstract: A bandwidth packing rate control technique includes altering bandwidth allocations of existing flows on a link depending on a current utilization of a current bandwidth allocation for a flow. A disclosed example decreases the bandwidth allocation for flows that are utilizing a current bandwidth allocation below a selected target utilization rate. Flows with higher utilization can receive increased bandwidth allocation, which provides increased throughput for such flows. One overall result of a disclosed example is increased utilization and increased throughput using existing bandwidth resources.

Abstract: A controller 26 for a packet radio network 20 includes a processor 27 that, in turn, includes a plurality of processor resources 30A–30D for processing a plurality of packet classes. Each packet class has a different delay sensitivity associated therewith. The processor 27 allocates to each packet class at least a portion of at least one processor resource 30A–30D, the allocation being based on the delay sensitivities associated with each packet class. Each processor resource 30A–30D may have a processing threshold, and the processor 27 may determine, based upon arriving packets, whether at least one processor resource will exceed its processing threshold, thus defining at least one overloaded processor resource 30A. The processor 27 may reallocate at least a portion of at least one processor resource to process packets for the at least one overloaded processor resource 30A thereby defining at least one reallocated processor resource 30D.

Abstract: This invention relates to a method and apparatus for management of traffic processor resources supporting UMTS Quality of Service (QoS) classes. More particularly, the invention is directed to an approach to processor scheduling and management according to the delay tolerance ratios among the four different QoS classes. Each class has its own share of the processing time under the normal condition. As traffic grows and consequently delay increases, bearers with lower delay tolerance QoS classes (such as conversational and streaming ones) are allowed to preempt the processing of bearers with higher delay tolerance, such as the background class. This approach makes effective use of the critical processor resource for supporting the highest QoS class while protecting the minimum needs of the streaming as well as interactive class and covering the background class with best effort.

Abstract: A controller 26 for a packet radio network 20 includes a processor 27 that, in turn, includes a plurality of processor resources 30A-30D for processing a plurality of packet classes. Each packet class has a different delay sensitivity associated therewith. The processor 27 allocates to each packet class at least a portion of at least one processor resource 30A-30D, the allocation being based on the delay sensitivities associated with each packet class. Each processor resource 30A-30D may have a processing threshold, and the processor 27 may determine, based upon arriving packets, whether at least one processor resource will exceed its processing threshold, thus defining at least one overloaded processor resource 30A. The processor 27 may reallocate at least a portion of at least one processor resource to process packets for the at least one overloaded processor resource 30A thereby defining at least one reallocated processor resource 30D.