Abstract: In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.

Abstract: A method and apparatus for allocating limited network resources, such as bandwidth and buffer memory, among various categories of data. Scheduler software adjusts the service weights associated with various data categories in order to regulate packet loss and delay. Central control software monitors network traffic conditions and regulates traffic at selected ingresses in order to reduce congestion at downstream bottlenecks. An advantageous method of calculating data utility functions enables utility maximization and/or fairness of resource allocation. Traffic at selected egresses is regulated in order to avoid wasting underutilized resources due to bottlenecks elsewhere in the network.

Abstract: In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.

Abstract: In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.