| 摘要 |
A method to schedule multiple traffic flows through a multiplexer server to provide fairness guarantees, while simultaneously minimizing the sizes of the associated queues, is proposed. To minimize the sizes of the associated queues, the multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. Every traffic flow to be scheduled through a multiplexer server is assigned two values, an initial Normalized Service Lag value, and a Normalized Lag Increment value. In each time-slot, the normalized service lag of every traffic flow is updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. Efficient software and hardware methods for performing the iterative calculations are presented. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule will repeat periodically. Efficient methods to compute periodic schedules is proposed. The methods can support multiple traffic flows with multiple traffic classes. The methods can be applied to packet-switched Internet routers to achieve near-minimal queue sizes and near-minimal delays.
|
