Xerox Corporation

J Bryan Lyles

Christopher J Kappler

Landis C Rogers

This invention provides rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service.

Rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service

Multiple rate sensitive priority queues reduce relative data transport unit delay variations in time multiplexed from output queued routing mechanisms.

Multiple rate sensitive priority queues for reducing relative data

Rate shaping is provided in per-flow queued routing mechanisms for statistical bit rate service.

Rate shaping in per-flow output queued routing mechanisms for

Rate shaping is provided in per-flow output queued routing mechanisms having output links servicing multiple physical layers.

Rate shaping in per-flow output queued routing mechanisms having output

This invention provides rate shaping in per-flow output queued routing mechanisms for available bit rate (ABR) service in networks having segmented ABR control loops.

Rate shaping in per-flow output queued routing mechanisms for available

Rate shaping is provided in per-flow queued routing mechanisms for available bit rate service. A traffic shaper in a packet switched communications system serially emits packets of time multiplexed flows in substantial compliance with individual network traffic contracts for the respective flows. The individual network traffic contracts include contracts which specify respective peak packet emission rates and associated peak rate tolerances for certain of the flows and which cause each of the flows to fall into mutually exclusive categories. The traffic shaper includes a queuing mechanism and a scheduling mechanism. The queuing mechanism organizes pending packets of active flows, including the certain flows, in respective queues in accordance with an oldest pending packet at head of queue order. The scheduling mechanism is coupled to the queuing mechanism for scheduling the packets of the active flows for emission. The scheduling mechanism includes a relatively high priority non-work conserving calendar queue, at least one relatively low priority work conserving queue, and another non-working conserving calendar queue of indeterministic priority relative to the high and low priority queues. The scheduling mechanism can also include a control mechanism for monitoring emissions from the high and low priority queues and for selectively descheduling packets scheduled on the high and low priority queues.

Growing community of inventors

Mountain View, CA, United States of America

J Bryan Lyles