2nd International ICST Conference on Communications and Networking in China

Research Article

A Dynamically Scheduling Policy with A Greedy Admission Control Algorithm Based on the Customer (Im)Patience

  • @INPROCEEDINGS{10.1109/CHINACOM.2007.4469335,
        author={Wang  Kaixi and Yang Fangchun},
        title={A Dynamically Scheduling Policy with A Greedy Admission Control Algorithm Based on the Customer (Im)Patience},
        proceedings={2nd International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2008},
        month={3},
        keywords={Next Generation Network  Weber's Law  overload  user (im)patience},
        doi={10.1109/CHINACOM.2007.4469335}
    }
    
  • Wang Kaixi
    Yang Fangchun
    Year: 2008
    A Dynamically Scheduling Policy with A Greedy Admission Control Algorithm Based on the Customer (Im)Patience
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2007.4469335
Wang Kaixi1,*, Yang Fangchun1,*
  • 1: State key Laboratory of Networking and Switching, Beijing University of Posts and Telecommunications, Beijing, China
*Contact email: kxwang@qdu.edu.cn, fcyang@bupt.edu.cn

Abstract

The service-driven NGN means that the NGN should be constructed from the perspective of satisfying customers' demands. So controlling the network based on users' willingness is an emerging demand. Based on the psychophysical laws, the paper proposes a dynamically priority queueing system, which employs a greedy admission control algorithm to schedule the services, built on a user patience on the waiting time. The analysis and simulation show that the scheduling policy has more advantages on the system throughput, the waiting time and the degree of a user's satisfaction over other three methods under a heavy load in a multi-service environment. This scheduling policy can meet a multi-service overload control requirements in NGN