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.展开更多
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.展开更多
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 steadystate queueing size at the departure point.展开更多
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 ...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.展开更多
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 perf...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.展开更多
In recent years, web technology carried on growing and at same time, the number of internet users increased significantly in number. Today, a Web server is capable of processing millions of requests per day, but durin...In recent years, web technology carried on growing and at same time, the number of internet users increased significantly in number. Today, a Web server is capable of processing millions of requests per day, but during the peak period may collapse and becomes critical causing unavailability of the services offered by the servers. That is why Web server performance is a topic of great interest to many researchers. In this paper, we evaluate experimentally the impact of JSP and PHP dynamic content technology: JSP and PHP with access to a database of performance data of Apache Web server. Using the “ApacheBench” performance measurement tool, the approach is to compare the performances of four different configurations of a Web server, such as: Apache Web server implementing JSP technology with access to PostgreSQL database, Apache using PHP technology with the PostgreSQL as database, Apache Web server using the JSP technology with access to MySQL database, finally Apache and PHP with DBMS MySQL. At the end of this article, we also present a Simulink model of Web server performance based on the simple M/M/1 queue. During the modeling, the MATLAB software was used.展开更多
Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planch...Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly.展开更多
In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodol...In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis leading to the application of these theorems in various problem situations for better operations. Relevant Examples are included to aid the application of the results studied in this work.展开更多
文摘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.
基金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.
基金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 steadystate queueing size at the departure point.
基金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.
文摘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.
文摘In recent years, web technology carried on growing and at same time, the number of internet users increased significantly in number. Today, a Web server is capable of processing millions of requests per day, but during the peak period may collapse and becomes critical causing unavailability of the services offered by the servers. That is why Web server performance is a topic of great interest to many researchers. In this paper, we evaluate experimentally the impact of JSP and PHP dynamic content technology: JSP and PHP with access to a database of performance data of Apache Web server. Using the “ApacheBench” performance measurement tool, the approach is to compare the performances of four different configurations of a Web server, such as: Apache Web server implementing JSP technology with access to PostgreSQL database, Apache using PHP technology with the PostgreSQL as database, Apache Web server using the JSP technology with access to MySQL database, finally Apache and PHP with DBMS MySQL. At the end of this article, we also present a Simulink model of Web server performance based on the simple M/M/1 queue. During the modeling, the MATLAB software was used.
基金financially supported by the National Basic Research Program of China (Grant No.2006CB400502)the Promotion of 100 Young Talent Scientist Project of the Chinese Acad-emy of Sciences (8-057493)the Special Meteorology Project(GYHY(QX)2007-6-1)
文摘Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly.
文摘In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis leading to the application of these theorems in various problem situations for better operations. Relevant Examples are included to aid the application of the results studied in this work.