Fair queue servicing using dynamic weights (DWFQ)

Claim 3

A method as claimed in claim 1 , wherein the minimum bandwidth requirement for at least one service class is determined during connection admission control of a connection to said queuing point.

Claim 4

A method as claimed in claim 1 , wherein said weights are also modified in accordance with real-time service class information.

Claim 5

A method as claimed in claim 1 , wherein buffer usage is monitored by a queue growth monitor, said queue growth monitor performing real-time estimation of queue growth every sampling interval T s .

Claim 6

A method as claimed in claim 1 , wherein said packet switched network is an ATM network and said packets are ATM cells.

Claim 7

A method as claimed in claim 1 , wherein the weights of the weighted fair queue scheduler are modified by carrying out the following steps during a series of sampling intervals: a) determine whether the queue growth is positive, and if so adjust the weight to bring the queue size to said predetermined target value TQSi in accordance with the relationship Wi=max{Ai+Qi+ΔQi−TQsi), min_Wi}, wherein Wi is the weight, Ai is the number of arrivals during a previous sampling period Ts, Qi is the queue size at the end of the sampling period Ts, ΔQi is the change in queue size during the sampling period Ts, or else if the queue growth is not positive, adjusting the weight to bring the queue size to the predetermined target value TQSi in accordance with the relationship Wi=max{Ai+Qi−TQsi), min_Wi}; and b) determining the difference ΔWi=Wi−min_Wi, where Wi is determined in step a).

Claim 8

A method as claimed in claim 1 , wherein cell transfer delay cell loss ratio requirements for each class of service are stored and taken into account in dynamically modifying the weights of said weighted fair queue scheduler.