We study a single-server queueing system with state-dependent arrivals and general service distribution, or simply M（n）/G/1/K, where the server follows an N policy and takes multiple vacations when the system is emp...We study a single-server queueing system with state-dependent arrivals and general service distribution, or simply M（n）/G/1/K, where the server follows an N policy and takes multiple vacations when the system is empty. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation time distribution, and the state-dependent arrival rate. The computational complexity of the algorithm is O（K^3）.展开更多
The paper is a succession of [1, 2]. Using MSP, we give a new approach to calculate the transient distribution of the length and waiting time of GI/G/1 queueing system.
针对信令寻径式交换机的特征,提出对交换机的信令实施一种以先到先服务排队策略为基础,基于信令固定优先级和交换机端口轮转优先级的二维动态优先级排队算法,该算法将不同时刻到达交换机的信令请求按照到达的先后次序进行排队,同一时刻...针对信令寻径式交换机的特征,提出对交换机的信令实施一种以先到先服务排队策略为基础,基于信令固定优先级和交换机端口轮转优先级的二维动态优先级排队算法,该算法将不同时刻到达交换机的信令请求按照到达的先后次序进行排队,同一时刻到达交换机的信令请求先按照信令固定优先级进行排队,优先级相同的信令请求按照交换机端口的轮转优先级进行排队,因此这种排队算法称为基于先到先服务的二维动态优先级排队算法,简称TDDP-FCFS(Two Dimensional Dynamic Priority-based First Come First Serve)。然后,使用强占型M/M/1/∞队列对其进行建模,讨论了TDDP-FCFS算法的性能指标以及计算方法,并给出了实际的计算结果。结果表明,TDDP-FCFS排队算法兼顾了信令优先级和交换机的端口优先级,实现简单,且能够很好地满足信令寻径式交换机的调度要求,具有较高的调度效率。展开更多
基金Supported by National Science Foundation of China(10801124,11171321,10801188)the Fundamental Research Funds for the Central Universities(WK2040170006)
基金The National Natural Science Foundation of China under Grant No.60975027,60903100the Natural Science Foundation of Ningbo of China under Grant No.2009A610080~~
基金partially supported by National Science Foundation under DMI-0200306supported in part by a grant from National Natural Science Foundation of China under No.70228001.
文摘We study a single-server queueing system with state-dependent arrivals and general service distribution, or simply M（n）/G/1/K, where the server follows an N policy and takes multiple vacations when the system is empty. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation time distribution, and the state-dependent arrival rate. The computational complexity of the algorithm is O（K^3）.
文摘The paper is a succession of [1, 2]. Using MSP, we give a new approach to calculate the transient distribution of the length and waiting time of GI/G/1 queueing system.
文摘针对信令寻径式交换机的特征,提出对交换机的信令实施一种以先到先服务排队策略为基础,基于信令固定优先级和交换机端口轮转优先级的二维动态优先级排队算法,该算法将不同时刻到达交换机的信令请求按照到达的先后次序进行排队,同一时刻到达交换机的信令请求先按照信令固定优先级进行排队,优先级相同的信令请求按照交换机端口的轮转优先级进行排队,因此这种排队算法称为基于先到先服务的二维动态优先级排队算法,简称TDDP-FCFS(Two Dimensional Dynamic Priority-based First Come First Serve)。然后,使用强占型M/M/1/∞队列对其进行建模,讨论了TDDP-FCFS算法的性能指标以及计算方法,并给出了实际的计算结果。结果表明,TDDP-FCFS排队算法兼顾了信令优先级和交换机的端口优先级,实现简单,且能够很好地满足信令寻径式交换机的调度要求,具有较高的调度效率。
