一种关联时效的OFDM系统调度算法仿真

Simulation of Time Critical Scheduling Algorithm for OFDM Systems

在OFDM系统中,目前主流的调度算法在考虑缓冲区的时候,都默认其为无限大,并且每类业务的包大小都是固定的,这些假设不完全符合实际情况,使得算法的实用性不高。在考虑有限缓冲和包大小不固定的基础上,更实际性地考虑各类业务的时延需求,提出了一种新的调度算法,即在兼顾有限缓冲和包大小不固定的同时,用一个时间效用函数来表示业务被服务的紧迫性,进而通过调度保证各类业务的数据包在它所能承受的最大时延范围内传输数据,从而保证各类业务的时延约束。

Most current researches on scheduling algorithm may not be practical enough due to some assumptions violating the real scenarios, such as the infinite buffer size and fixed packet length. Considering the finite buffer size and variable packet length, a new practical scheduling algorithm was proposed to meet various delay constrain. The method indicates the urgent grade of a traffic packet to be served by using Time Utility Function to schedule the traffic packet within the maximum delay constrain, and consequently ensure time critical requirement of different type of traffic.