| 摘要 |
Packet scheduling apparatus 10 schedules packets of data for transmission from a transmitter via at least one channel to a plurality of receivers. Using conventional scheduling methods, the performance aspects of a scheduling solution, i.e. data throughput, delay, fairness of packet delivery and quality of service, are generally unbalanced, e.g. round-robin solutions are fair but with poor throughput while maximum carrier-to-interference (max C/I) solutions have good throughput but at the expense of fairness. The invention provides a packet scheduler which selects a scheduling solution whose performance aspects are best in relation to a balance of performance aspects set by an operator. A plurality of candidate scheduling solutions h 1- h n are generated by a candidate solution generating unit 12 (fig. 4). The solutions may include round-robin and max C/I solutions. At least one candidate solution is generated randomly and each candidate solution specifies at least the receiver(s) to which packets are to be transmitted in a scheduling instant under consideration. A best solution selecting unit 14 compares the generated candidate solutions, e.g. by comparing preselected fitness measures of each solution, and based on the comparison results, selects a best one of the candidate solutions h best to use to transmit packets in the scheduling instant. Applications in WWW browsing, W-CDMA, IS95, TDMA, WDMA, FDMA, SDMA. |
