内容计费实时系统中一种提供比例时延区分的概率调度算法

Probabilistic scheduling algorithm for providing proportional delay differentiation in content-based online charging system

针对OCS(online charging system)服务器,提出了一种新的请求调度算法,算法的基本思想是利用系统队列的长度、请求的到达率以及预先分配的时延区分参数作为调度的优先级依据,在调度时采用概率的方式选取需要服务的队列请求。实验结果表明,在考虑服务时延的情况下,新算法性能总是优于一些传统的PDD(proportional delay differentiation)调度算法,当请求服务时延增加和彼此差别很大时,性能优势相对更大,并且有效地满足了内容计费环境下提出的6点QoS(quality of service)要求。

A novel request scheduling algorithm was proposed for the OCS （online charging system） server. The basic idea is that one of the requests from all classes of service queues is scheduled with some priority probability which is based on the system queue-length, the request arrival rate, and the pre-assigned delay differentiation parameter. The experimental results show that, in considering request service delays, this proposed algorithm always outperforms some other traditional PDD （proportional delay differentiation） scheduling ones and the performance advantages are relatively greater when request service delays increase and vary greatly from each other. Furthermore, it can efficiently meet 6 QoS （quality of service） requirements proposed in content-based billing.