This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and take...This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length . When he returns, if the queue length reaches or exceeds threshold , the server is immediately turned on but is temporarily unavailable due to a random setup time before offering service. If not, the server stays in the system until the queue length at least being . We derive the system size distribution and confirm the stochastic decomposition property. We also derive the recursion expressions of queue length distribution and other performance measures. Finally, we present some numerical examples to show the analytical results obtained. Sensitivity analysis is also performed.展开更多
Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and...Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.展开更多
In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is pre...In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is presented for estimating vehicular queue length using data from both point detectors and probe vehicles. The methodology applies the shockwave theory to model queue evolution over time and space. Using probe vehicle locations and times as well as point detector measured traffic states,analytical formulations for calculating the maximum and minimum( residual) queue length are developed. The proposed methodology is verified using ground truth data collected from numerical experiments conducted in Shanghai,China. It is found that the methodology has a mean absolute percentage error of 17. 09%,which is reasonably effective in estimating the queue length at traffic signalized intersections. Limitations of the proposed models and algorithms are also discussed in the paper.展开更多
This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient ...This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper.展开更多
In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the di...In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.展开更多
为了满足运行速度快、时延低、性能好、公平性好等特点,提出了多服务器门限服务系统,并利用BiLSTM(Bi-direc-tional Long Short-Term Memory)神经网络对其进行预测分析,使用多服务器接入方式来降低网络时延,改善系统性能。多个服务器调...为了满足运行速度快、时延低、性能好、公平性好等特点,提出了多服务器门限服务系统,并利用BiLSTM(Bi-direc-tional Long Short-Term Memory)神经网络对其进行预测分析,使用多服务器接入方式来降低网络时延,改善系统性能。多个服务器调度时,可以采用同步和异步两种方式。首先,研究多服务器门限服务的系统模型。其次,在单服务器的基础上,利用嵌入马尔可夫链和概率母函数的分析方法对多服务器门限服务的平均排队队长、平均循环周期和平均时延进行求解;同时,利用Matlab进行仿真实验,分别将单服务器系统与多服务器系统的理论值与仿真值进行系统分析,对比多服务器同步和异步两种方式。最后,构建BiLSTM神经网络来预测多服务器系统的性能。实验结果表明,该多服务器系统异步方式优于同步和单服务器系统,多服务器异步系统的性能更好,时延更低,效率更高。综合对比多服务器的3种基本服务系统,在保证公平性的情况下,门限服务系统更加稳定。并且使用BiLSTM神经网络预测算法能够准确预测系统的性能,提高计算效率,对轮询系统的性能评价具有指导意义。展开更多
文摘This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length . When he returns, if the queue length reaches or exceeds threshold , the server is immediately turned on but is temporarily unavailable due to a random setup time before offering service. If not, the server stays in the system until the queue length at least being . We derive the system size distribution and confirm the stochastic decomposition property. We also derive the recursion expressions of queue length distribution and other performance measures. Finally, we present some numerical examples to show the analytical results obtained. Sensitivity analysis is also performed.
文摘Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.
基金Sponsored by the National Natural Science Foundation of China(Grant No.51138003)
文摘In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is presented for estimating vehicular queue length using data from both point detectors and probe vehicles. The methodology applies the shockwave theory to model queue evolution over time and space. Using probe vehicle locations and times as well as point detector measured traffic states,analytical formulations for calculating the maximum and minimum( residual) queue length are developed. The proposed methodology is verified using ground truth data collected from numerical experiments conducted in Shanghai,China. It is found that the methodology has a mean absolute percentage error of 17. 09%,which is reasonably effective in estimating the queue length at traffic signalized intersections. Limitations of the proposed models and algorithms are also discussed in the paper.
基金the National Outstanding Youth Science Foundation !(79725002) the Youth Science Foundation of UEST.
文摘This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper.
文摘In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.
文摘为了满足运行速度快、时延低、性能好、公平性好等特点,提出了多服务器门限服务系统,并利用BiLSTM(Bi-direc-tional Long Short-Term Memory)神经网络对其进行预测分析,使用多服务器接入方式来降低网络时延,改善系统性能。多个服务器调度时,可以采用同步和异步两种方式。首先,研究多服务器门限服务的系统模型。其次,在单服务器的基础上,利用嵌入马尔可夫链和概率母函数的分析方法对多服务器门限服务的平均排队队长、平均循环周期和平均时延进行求解;同时,利用Matlab进行仿真实验,分别将单服务器系统与多服务器系统的理论值与仿真值进行系统分析,对比多服务器同步和异步两种方式。最后,构建BiLSTM神经网络来预测多服务器系统的性能。实验结果表明,该多服务器系统异步方式优于同步和单服务器系统,多服务器异步系统的性能更好,时延更低,效率更高。综合对比多服务器的3种基本服务系统,在保证公平性的情况下,门限服务系统更加稳定。并且使用BiLSTM神经网络预测算法能够准确预测系统的性能,提高计算效率,对轮询系统的性能评价具有指导意义。
