TABLE BASED SCHEDULING ALGORITHM FOR DOWNLINK BANDWIDTH ALLOCATION

摘要

The present invention provides a method for downlink bandwidth allocation. The method allocates (302) subclass entries in an ordered list (200) (which may be organized as a table, for example). Each entry (210-214) generally corresponds to one of several predetermined cell subclasses, and the allocation reserves a total number of each subclass entry in the ordered list according to a predetermined amount of bandwidth desired for each cell subclass. The subclasses may be associated with factors such as coding rate, downlink beam area, virtual paths or virtual circuits, quality of service parameters, and the like. The method then examines (304) each subclass entry in the ordered list and selects (306) a cell from a cell memory (which may be a queue) that matches the subclass entry. The matched cell is then transmitted (308). The method may also allocate sets of subclass entries in groups corresponding to a frame size and dynamically update (310) the ordered list during operation of the cell switch.