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 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: In a UMTS network, each packet data service user requires a dedicated channel (DCH) to transmit at high data rates. However, the number of DCHs available is small due to code and power limitations. Thus many users will have to be allocated the same DCH on a time sharing basis. Such sharing will not impact the quality of service for users whose applications are not delay sensitive and whose traffic generation pattern toggles between transmit and idle states. Such applications include web browsing, FTP sessions and E-mail. The present invention discloses four algorithms that can be used to dynamically allocate DCH channels to a contending user based on the user's need according to its traffic generation.

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: In a UMTS network, each packet data service user requires a dedicated channel (DCH) to transmit at high data rates. However, the number of DCHs available is small due to code and power limitations. Thus many users will have to be allocated the same DCH on a time sharing basis. Such sharing will not impact the quality of service for users whose applications are not delay sensitive and whose traffic generation pattern toggles between transmit and idle states. Such applications include web browsing, FTP sessions and E-mail. The present invention discloses four algorithms that can be used to dynamically allocate DCH channels to a contending user based on the user's need according to its traffic generation.

Abstract: A method and apparatus that uses the number of in-service trunks in each trunk group connected to a communication switch as the number of indices that are contained in its respective trunk group distribution table. Each of the indices of each trunk group distribution table corresponds to a single trunk ID of a respective in-service trunk of the trunk group. The method provides for a uniform distribution of call assignments among the indices. Thus, with the uniform distribution of indices, the assignment of trunks to calls will also be uniformly distributed. With trunk traffic distributed among all the trunks of a trunk group, the overall efficiency of the trunk group will be very high.