Tellabs Operations, Inc.

Kent Daniel Benson

Robert B Magill

Terry Jon Hrabik

Ravi Chandran

John Belden Kenney

An arbitration unit according to an embodiment of the present invention is disclosed. The arbitration unit includes an allocation unit that assigns a first number of slots in a frame to a first flow and a second number of slots in the frame to a second flow. The arbitration unit includes a scheduling unit that assigns first slot positions to the first number of slots in the frame and second slot positions to the second number of slots in the frame using a binary distribution tree.

Method and apparatus for scheduling packetized data flows in a calendar-based arbitration scheme

In allocating bandwidth to data for transfer through a network device, bandwidth is allocated to committed data traffic based on a guaranteed data transfer rate and a queue size of the network device, and bandwidth is allocated to uncommitted data traffic using a weighted maximum/minimum process. The weighted maximum/minimum process allocates bandwidth to the uncommitted data traffic in proportion to a weight associated with the uncommitted data traffic.

Allocating network bandwidth

Data switching systems for use in ATM and other packet and cell switching networks can more smoothly switch data if incoming data packets to be switched are re-ordered to avoid overwhelming an output port with too many consecutive packets to a particular destination. An apparatus and method for simply re-ordering data samples in a non-consecutive manner is computationally efficient and effective.

Growing community of inventors

Granger, IN, United States of America

Kent Daniel Benson