Class of dynamic programming schedulers
AssigneeSharp Laboratories of America, Inc.
InventorJohn M. Kowalski
Life of this patent
Estimating the term…
Abstract
A scheduler for use in an LAN for allocating transmission opportunities includes a scheduling policy mechanism for assigning flow-to-transmit opportunities to the stations based on network constraints; and an optimization mechanism for looking ahead a number of superframes, NL, to determine an optimal time to assign a transmit opportunity to a station. A method of allocating transmission opportunities includes assigning flow-to-transmit opportunities to the stations based on network constraints; and looking ahead a number of superframes, NL, to determine an optimal time to assign a transmit opportunity to a station.
Claims18
In a local area network, having a plurality of stations, and wherein data flow moves over the network in superframes, a scheduler for allocating transmission opportunities, comprising:
- a scheduling policy mechanism for assigning flow-to-transmit opportunities to the stations based on network constraints;
- and
- an optimization mechanism for looking ahead a number of superframes, NL, to determine an optimal time to assign a transmit opportunity to a station.
In a local area network, having a plurality of stations, and wherein data flow moves over the network in superframes, a method of allocating transmission opportunities, comprising:
- assigning flow-to-transmit opportunities to the stations based on network constraints;
- and
- looking ahead a number of superframes, NL, to determine an optimal time to assign a transmit opportunity to a station.
Dependencies are inferred from the claim text.