Method and apparatus for scheduling packetized data flows in a calendar-based arbitration scheme
AssigneeTellabs Operations, Inc.
InventorsTerry J. Hrabik, Robert B. Magill, Ravi Chandran, Kent D. Benson
Life of this patent
Estimating the term…
Abstract
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.
Claims21
An arbitration unit, comprising:
- 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;
- and
- 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.
A method for generating binary permission vectors, comprising:
- setting a common drift direction at bifurcation points in a binary distribution tree;
- dividing allocation numbers associated with a first flow by two at the bifurcation points;
- assigning quotients from the dividing of the allocation numbers associated with the first flow to branches at the bifurcation points;
- assigning a remainder from the dividing of the allocation numbers associated with the first flow to a branch that corresponds to a drift direction at the bifurcation point where the remainder exists;
- switching the drift direction at the bifurcation point where the remainder exists;
- and
- reading outputs from the binary distribution tree as elements in a first binary permission vector.
An arbitration unit, comprising:
- means for assigning 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;
- and
- means for assigning 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.
Dependencies are inferred from the claim text.