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

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.