In this paper exhaustive-service priority-M/G/1 queueing systems with multiple vacations, single vacation and setup times are studied under the nonpreemptive and preemptive resume priority disciplines. For each of the...In this paper exhaustive-service priority-M/G/1 queueing systems with multiple vacations, single vacation and setup times are studied under the nonpreemptive and preemptive resume priority disciplines. For each of the six models analysed, the Laplace-Stieltjes transform of the virtual waiting time Wk(t) at time t of class k is derived by the method of collective marks. A sufficient condition for , where U has the standard normal distribution, is also given.展开更多
We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular trans...We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular transition probability matrix of two-dimensional Markov chain and matrix analytic method, the probability generating function (PGF) of the stationary system length distribution is obtained, from which we obtain the stochastic decomposition structure of system length which indicates the relationship with that of the MX/M/1 queue without vacation. Some performance indices are derived by using the PGF of the stationary system length distribution. It is important that we obtain the Laplace Stieltjes transform (LST) of the stationary waiting time distribution. Further, we obtain the mean system length and the mean waiting time. Finally, numerical results for some special cases are presented to show the effects of system parameters.展开更多
为了适应嵌入式应用的要求,提高轻量级协议栈(light weight internet protocol,LWIP)的响应速度和实时性,提出了两种优化方法。第一种优化方法是采用混合TCP-UDP协议,对少量数据的传输采用UDP协议,而对大量数据的传输采用TCP协议;另一...为了适应嵌入式应用的要求,提高轻量级协议栈(light weight internet protocol,LWIP)的响应速度和实时性,提出了两种优化方法。第一种优化方法是采用混合TCP-UDP协议,对少量数据的传输采用UDP协议,而对大量数据的传输采用TCP协议;另一种方法是分别定义紧急数据等待队列与普通数据等待队列,只有在所有紧急数据处理完成后,才可以处理普通数据。实例测试表明,这两种优化方法可以提高嵌入式设备的网络性能。展开更多
文摘In this paper exhaustive-service priority-M/G/1 queueing systems with multiple vacations, single vacation and setup times are studied under the nonpreemptive and preemptive resume priority disciplines. For each of the six models analysed, the Laplace-Stieltjes transform of the virtual waiting time Wk(t) at time t of class k is derived by the method of collective marks. A sufficient condition for , where U has the standard normal distribution, is also given.
文摘We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular transition probability matrix of two-dimensional Markov chain and matrix analytic method, the probability generating function (PGF) of the stationary system length distribution is obtained, from which we obtain the stochastic decomposition structure of system length which indicates the relationship with that of the MX/M/1 queue without vacation. Some performance indices are derived by using the PGF of the stationary system length distribution. It is important that we obtain the Laplace Stieltjes transform (LST) of the stationary waiting time distribution. Further, we obtain the mean system length and the mean waiting time. Finally, numerical results for some special cases are presented to show the effects of system parameters.
文摘为了适应嵌入式应用的要求,提高轻量级协议栈(light weight internet protocol,LWIP)的响应速度和实时性,提出了两种优化方法。第一种优化方法是采用混合TCP-UDP协议,对少量数据的传输采用UDP协议,而对大量数据的传输采用TCP协议;另一种方法是分别定义紧急数据等待队列与普通数据等待队列,只有在所有紧急数据处理完成后,才可以处理普通数据。实例测试表明,这两种优化方法可以提高嵌入式设备的网络性能。
