ChinaCom2008-Frontiers on Communications and Networking Symposium

Research Article

A Probabilistic Scheduling Algorithm for Providing Proportional Delay Differentiation in Content-based Online Charging System

  • @INPROCEEDINGS{10.1109/CHINACOM.2008.4685143,
        author={Hai Huang and Jian-xin Liao and Xiao-min Zhu and Le-jian Zhang and Qi Qi},
        title={A Probabilistic Scheduling Algorithm for Providing Proportional Delay Differentiation in Content-based Online Charging System},
        proceedings={ChinaCom2008-Frontiers on Communications and Networking Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2008-FCN},
        year={2008},
        month={11},
        keywords={Content-based billing Online charging system Proportional delay differentiation model Scheduling algorithm},
        doi={10.1109/CHINACOM.2008.4685143}
    }
    
  • Hai Huang
    Jian-xin Liao
    Xiao-min Zhu
    Le-jian Zhang
    Qi Qi
    Year: 2008
    A Probabilistic Scheduling Algorithm for Providing Proportional Delay Differentiation in Content-based Online Charging System
    CHINACOM2008-FCN
    IEEE
    DOI: 10.1109/CHINACOM.2008.4685143
Hai Huang1,*, Jian-xin Liao1, Xiao-min Zhu1, Le-jian Zhang1, Qi Qi1
  • 1: State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876, China
*Contact email: huanghai525@gmail.com

Abstract

The emergence of new data services in 3G networks is driving the support of advanced content-based billing mechanisms whose unique characteristics require that the OCS (Online Charging System) provide relative differentiated services based on different contents. The OCS can be modeled by the PDD (Proportional Delay Differentiation) structure and it aims to maintain the prespecified mean system response-time delay ratios between different classes of requests. A novel request scheduling algorithm is proposed in this paper. The basic idea is that one of the requests from all classes of service queues is chosen with some priority probability which is based on the system queue-length, the request arrival rate, and the preassigned delay differentiation parameter. The experimental results show that this new algorithm significantly outperforms some other traditional PDD scheduling ones when request service delays increase and vary greatly from each other. Furthermore, it can efficiently meet 6 QoS requirements proposed in this paper.