Today, in the field of computer networks, new services have been developed on the Internet or intranets, including the mail server, database management, sounds, videos and the web server itself Apache. The number of s...Today, in the field of computer networks, new services have been developed on the Internet or intranets, including the mail server, database management, sounds, videos and the web server itself Apache. The number of solutions for this server is therefore growing continuously, these services are becoming more and more complex and expensive, without being able to fulfill the needs of the users. The absence of benchmarks for websites with dynamic content is the major obstacle to research in this area. These users place high demands on the speed of access to information on the Internet. This is why the performance of the web server is critically important. Several factors influence performance, such as server execution speed, network saturation on the internet or intranet, increased response time, and throughputs. By measuring these factors, we propose a performance evaluation strategy for servers that allows us to determine the actual performance of different servers in terms of user satisfaction. Furthermore, we identified performance characteristics such as throughput, resource utilization, and response time of a system through measurement and modeling by simulation. Finally, we present a simple queue model of an Apache web server, which reasonably represents the behavior of a saturated web server using the Simulink model in Matlab (Matrix Laboratory) and also incorporates sporadic incoming traffic. We obtain server performance metrics such as average response time and throughput through simulations. Compared to other models, our model is conceptually straightforward. The model has been validated through measurements and simulations during the tests that we conducted.展开更多
First of all, this paper shows clearly careless mistake of Kornai Weibull queue model with the waiting buyers in J.Kornai , as well as Kornai Weibull queue model without waiters . Secondly, strictl...First of all, this paper shows clearly careless mistake of Kornai Weibull queue model with the waiting buyers in J.Kornai , as well as Kornai Weibull queue model without waiters . Secondly, strictly prove that revised model has `normal state', under more natural conditions. We advance theory of Kornai Weibull queue model such that deeply understand an abuse of the planned economy.展开更多
This paper develops a QKD (quantum key distribution)-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of...This paper develops a QKD (quantum key distribution)-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.展开更多
By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its s...By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.展开更多
By studying the spectrum of the underlying operator corresponding to the exhaustive-service M/G/1 queueing model with single vacations we prove that the time-dependent solution of the model strongly converges to its s...By studying the spectrum of the underlying operator corresponding to the exhaustive-service M/G/1 queueing model with single vacations we prove that the time-dependent solution of the model strongly converges to its steady-state solution.展开更多
In real life, in different industries, we often deal with systems designed for multiple use for performing single-type tasks. Processes taking place at this time are called service of requirements, and the systems the...In real life, in different industries, we often deal with systems designed for multiple use for performing single-type tasks. Processes taking place at this time are called service of requirements, and the systems themselves—Queueing Systems. This article is dedicated to computer software modelling of processes taking place in the systems in question, Markov processes in particular. In this article, by means of Matlab environment, software realization of one of the typical models of queueing service theory-multichannel QS with unreliable recoverable servers and limited number of requirements in the system, is fulfilled. The results of this research are important because it gives the possibility to use received results to determine optimality degree of some real queueing systems that possess Markov property.展开更多
Present paper deals a M/M/1:(∞;GD) queueing model with interdependent controllable arrival and service rates where- in customers arrive in the system according to poisson distribution with two different arrivals rate...Present paper deals a M/M/1:(∞;GD) queueing model with interdependent controllable arrival and service rates where- in customers arrive in the system according to poisson distribution with two different arrivals rates-slower and faster as per controllable arrival policy. Keeping in view the general trend of interdependent arrival and service processes, it is presumed that random variables of arrival and service processes follow a bivariate poisson distribution and the server provides his services under general discipline of service rule in an infinitely large waiting space. In this paper, our central attention is to explore the probability generating functions using Rouche’s theorem in both cases of slower and faster arrival rates of the queueing model taken into consideration;which may be helpful for mathematicians and researchers for establishing significant performance measures of the model. Moreover, for the purpose of high-lighting the application aspect of our investigated result, very recently Maurya [1] has derived successfully the expected busy periods of the server in both cases of slower and faster arrival rates, which have also been presented by the end of this paper.展开更多
We analyze a Coxian stochastic queueing model with three phases. The Kolmogorov equations of this model are constructed, and limit probabilities and the stationary probabilities of customer numbers in the system are f...We analyze a Coxian stochastic queueing model with three phases. The Kolmogorov equations of this model are constructed, and limit probabilities and the stationary probabilities of customer numbers in the system are found. The performance measures of this model are obtained and in addition the optimal order of service parameters is given with a theorem by obtaining the loss probabilities of customers in the system. That is, putting the greatest service parameter at first phase and the second greatest service parameter at second phase and the smallest service parameter at third phase makes the loss probability and means waiting time minimum. We also give the loss probability in terms of mean waiting time in the system. is the transition probability from j-th phase?to??phase . In this manner while and this system turns into queueing model and while the system turns into Cox(2) queueing model. In addition, loss probabilities are graphically given in a 3D graph for corresponding system parameters and phase transient probabilities. Finally it is shown with a numeric example that this theorem holds.展开更多
In this paper, we present an approach for model transformation from Queueing Network Models (QNMs) into Queueing Petri Nets (QPNs). The performance of QPNs can be analyzed using a powerful simulation engine, SimQPN, d...In this paper, we present an approach for model transformation from Queueing Network Models (QNMs) into Queueing Petri Nets (QPNs). The performance of QPNs can be analyzed using a powerful simulation engine, SimQPN, designed to exploit the knowledge and behavior of QPNs to improve the efficiency of simulation. When QNMs are transformed into QPNs, their performance can be analyzed efficiently using SimQPN. To validate our approach, we apply it to analyze the performance of several queueing network models including a model of a database system. The evaluation results show that the performance analysis of the transformed QNMs has high accuracy and low overhead. In this context, model transformation enables the performance analysis of queueing networks using different ways that can be more efficient.展开更多
This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes (mQN) model. In this model, expressions are derived to calculate two pe...This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes (mQN) model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.展开更多
目的分析1990-2019年中国睾丸癌的发病和死亡情况,并探讨年龄、时期和队列效应对睾丸癌发病和死亡的影响。方法利用全球疾病负担(Global Burden of Disease,GBD)2019数据库,分析1990-2019年中国睾丸癌发病和死亡情况,应用Joinpoint软件...目的分析1990-2019年中国睾丸癌的发病和死亡情况,并探讨年龄、时期和队列效应对睾丸癌发病和死亡的影响。方法利用全球疾病负担(Global Burden of Disease,GBD)2019数据库,分析1990-2019年中国睾丸癌发病和死亡情况,应用Joinpoint软件分析标化发病率和标化死亡率的时间变化趋势,计算平均年度变化百分比。构建年龄-时期-队列模型,分析年龄、时期和出生队列效应对睾丸癌发病及死亡趋势变化的影响。结果2019年,中国睾丸癌发病率为1.21/10万,死亡率为0.08/10万,发病率和死亡率比1990年升高了348.15%和14.29%。1990-2019年,中国睾丸癌标化发病率呈升高趋势,平均每年升高5.23%,趋势有统计学意义(P<0.05),睾丸癌标化死亡率呈下降趋势,平均每年下降0.12%,但趋势无统计学意义(P>0.05)。年龄效应结果显示,1990-2019年中国睾丸癌的发病率和死亡率整体呈升高趋势,发病率和死亡率均在60岁以后呈快速升高趋势,在85岁以上年龄组达到高峰。时期效应结果显示,1990-2019年,中国睾丸癌发病风险的时期变化相对危险度(relative ratio,RR)呈升高趋势,在2015-2019年发病风险最高,发病风险RR=2.44[95%可信区间(confidence interval,CI)2.31~2.56];睾丸癌死亡风险的时期变化RR值趋势呈下降趋势,1995-1999年死亡风险最高,死亡风险RR=1.09(95%CI 0.99~1.19)。队列效应结果显示,出生越晚的人,发病风险越高,死亡风险越低。结论1990-2019年,中国居民睾丸癌的标化发病率呈升高趋势,标化死亡率呈下降趋势但无统计学意义。不同年龄、时期和出生队列的睾丸癌流行病学模式和趋势可能为公共卫生提供新的见解,这些发现可为进一步减轻睾丸癌负担的公共卫生策略的制定提供重要依据。展开更多
文摘Today, in the field of computer networks, new services have been developed on the Internet or intranets, including the mail server, database management, sounds, videos and the web server itself Apache. The number of solutions for this server is therefore growing continuously, these services are becoming more and more complex and expensive, without being able to fulfill the needs of the users. The absence of benchmarks for websites with dynamic content is the major obstacle to research in this area. These users place high demands on the speed of access to information on the Internet. This is why the performance of the web server is critically important. Several factors influence performance, such as server execution speed, network saturation on the internet or intranet, increased response time, and throughputs. By measuring these factors, we propose a performance evaluation strategy for servers that allows us to determine the actual performance of different servers in terms of user satisfaction. Furthermore, we identified performance characteristics such as throughput, resource utilization, and response time of a system through measurement and modeling by simulation. Finally, we present a simple queue model of an Apache web server, which reasonably represents the behavior of a saturated web server using the Simulink model in Matlab (Matrix Laboratory) and also incorporates sporadic incoming traffic. We obtain server performance metrics such as average response time and throughput through simulations. Compared to other models, our model is conceptually straightforward. The model has been validated through measurements and simulations during the tests that we conducted.
文摘First of all, this paper shows clearly careless mistake of Kornai Weibull queue model with the waiting buyers in J.Kornai , as well as Kornai Weibull queue model without waiters . Secondly, strictly prove that revised model has `normal state', under more natural conditions. We advance theory of Kornai Weibull queue model such that deeply understand an abuse of the planned economy.
基金Project supported by National Fundamental Research Program of China (Grant No 2006CB921900)National Natural Science Foundation of China (Grant Nos 60537020 and 60621064)Knowledge Innovation Project of Chinese Academy of Sciences
文摘This paper develops a QKD (quantum key distribution)-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.
基金supported by the National Natural Science Foundation of China(11371303)Natural Science Foundation of Xinjiang(2012211A023)Science Foundation of Xinjiang University(XY110101)
文摘By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.
基金supported by National Natural Science Foundation of China (GrantNo. 10861011)
文摘By studying the spectrum of the underlying operator corresponding to the exhaustive-service M/G/1 queueing model with single vacations we prove that the time-dependent solution of the model strongly converges to its steady-state solution.
文摘In real life, in different industries, we often deal with systems designed for multiple use for performing single-type tasks. Processes taking place at this time are called service of requirements, and the systems themselves—Queueing Systems. This article is dedicated to computer software modelling of processes taking place in the systems in question, Markov processes in particular. In this article, by means of Matlab environment, software realization of one of the typical models of queueing service theory-multichannel QS with unreliable recoverable servers and limited number of requirements in the system, is fulfilled. The results of this research are important because it gives the possibility to use received results to determine optimality degree of some real queueing systems that possess Markov property.
文摘Present paper deals a M/M/1:(∞;GD) queueing model with interdependent controllable arrival and service rates where- in customers arrive in the system according to poisson distribution with two different arrivals rates-slower and faster as per controllable arrival policy. Keeping in view the general trend of interdependent arrival and service processes, it is presumed that random variables of arrival and service processes follow a bivariate poisson distribution and the server provides his services under general discipline of service rule in an infinitely large waiting space. In this paper, our central attention is to explore the probability generating functions using Rouche’s theorem in both cases of slower and faster arrival rates of the queueing model taken into consideration;which may be helpful for mathematicians and researchers for establishing significant performance measures of the model. Moreover, for the purpose of high-lighting the application aspect of our investigated result, very recently Maurya [1] has derived successfully the expected busy periods of the server in both cases of slower and faster arrival rates, which have also been presented by the end of this paper.
文摘We analyze a Coxian stochastic queueing model with three phases. The Kolmogorov equations of this model are constructed, and limit probabilities and the stationary probabilities of customer numbers in the system are found. The performance measures of this model are obtained and in addition the optimal order of service parameters is given with a theorem by obtaining the loss probabilities of customers in the system. That is, putting the greatest service parameter at first phase and the second greatest service parameter at second phase and the smallest service parameter at third phase makes the loss probability and means waiting time minimum. We also give the loss probability in terms of mean waiting time in the system. is the transition probability from j-th phase?to??phase . In this manner while and this system turns into queueing model and while the system turns into Cox(2) queueing model. In addition, loss probabilities are graphically given in a 3D graph for corresponding system parameters and phase transient probabilities. Finally it is shown with a numeric example that this theorem holds.
文摘In this paper, we present an approach for model transformation from Queueing Network Models (QNMs) into Queueing Petri Nets (QPNs). The performance of QPNs can be analyzed using a powerful simulation engine, SimQPN, designed to exploit the knowledge and behavior of QPNs to improve the efficiency of simulation. When QNMs are transformed into QPNs, their performance can be analyzed efficiently using SimQPN. To validate our approach, we apply it to analyze the performance of several queueing network models including a model of a database system. The evaluation results show that the performance analysis of the transformed QNMs has high accuracy and low overhead. In this context, model transformation enables the performance analysis of queueing networks using different ways that can be more efficient.
文摘This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes (mQN) model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.