The queueing model for quantum key distribution network

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.

FUNCTIONAL ANALYSIS METHOD FOR THE M/G/1 QUEUEING MODEL WITH OPTIONAL SECOND SERVICE

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.

Development and Investigation of the Program Model of Multichannel Queueing System with Unreliable Recoverable Servers in Matlab Environment

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.

On Utilizing Model Transformation for the Performance Analysis of Queueing Networks

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.

Investigation of Probability Generating Function in an Interdependent <i>M/M/</i>1:(∞;GD) Queueing Model with Controllable Arrival Rates Using Rouche’s Theorem

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.

Single Server Queueing Models and Birth-Death Process

A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue models are also derivable from birth-death processes. These queue models consist of mathematical formulas and relationships that can be used to determine the operating characteristics （performance measures） for a waiting line. Schematic and transition diagrams of different single server queue models were shown. Relationships between birth-death processes, waiting lines （queues） and transition diagrams were given. While M/M/I/K queue model states was limited by K customers and had （K＋I） states, M/M/1/1 queue model had only two states. M/G/1/∝/∝ and M/M/1/∝/∝ shared similar characteristics. Many ideal queuing situations employ M/M/1 queueing model.

On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases

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.

Diffusion approximations for multiclass queueing networks under preemptive priority service discipline

We prove a heavy traffic limit theorem to justify diffusion approximations for multiclass queueing networks under preemptive priority service discipline and provide effective stochastic dynamical models for the systems. Such queueing networks appear typically in high-speed integrated services packet networks about telecommunication system. In the network, there is a number of packet traffic types. Each type needs a number of job classes （stages） of processing and each type of jobs is assigned the same priority rank at every station where it possibly receives service. Moreover, there is no inter-routing among different traffic types throughout the entire network.

Analytical Modeling of a Multi-queue Nodes Network Router

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.

Python Server Page Performance Analysis and Modeling

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.

Another Fast and Simple DEM Depression-Filling Algorithm Based on Priority Queue Structure

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.

Analysis and Simulink Modeling of the Performance of Dynamic Web Server Using JSP and PHP

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.

Stochastic Model for Multiple Classes and Subclasses Simple Documents Processing

The issue of document management has been raised for a long time, especially with the appearance of office automation in the 1980s, which led to dematerialization and Electronic Document Management (EDM). In the same period, workflow management has experienced significant development, but has become more focused on the industry. However, it seems to us that document workflows have not had the same interest for the scientific community. But nowadays, the emergence and supremacy of the Internet in electronic exchanges are leading to a massive dematerialization of documents;which requires a conceptual reconsideration of the organizational framework for the processing of said documents in both public and private administrations. This problem seems open to us and deserves the interest of the scientific community. Indeed, EDM has mainly focused on the storage (referencing) and circulation of documents (traceability). It paid little attention to the overall behavior of the system in processing documents. The purpose of our researches is to model document processing systems. In the previous works, we proposed a general model and its specialization in the case of small documents (any document processed by a single person at a time during its processing life cycle), which represent 70% of documents processed by administrations, according to our study. In this contribution, we extend the model for processing small documents to the case where they are managed in a system comprising document classes organized in subclasses;which is the case for most administrations. We have thus observed that this model is a Markovian ML×K/ML×K/1 queues network. We have analyzed the constraints of this model and deduced certain characteristics and metrics. In fine, the ultimate objective of our work is to design a document workflow management system, integrating a component of global behavior prediction.

Development of the Software Application with Graphical User Interface for One Model Cyber Security

The article is dedicated to the development of software application with graphical user interface for analyzing of the operation of Integrated System of Data Defense from cyber-threats (ISDD) which includes subsystems of detection and elimination of vulnerabilities existing in the system, as well as Requests of Unauthorized Access (RUA). In the subsystems of eliminations of vulnerabilities and queues of unauthorized access considered as multichannel queueing systems with corresponding servers and queues, at random times there come requests to fix threats detected by the system. It is supposed that flows of requests demanding to eliminate threats coming to the mentioned subsystems of queueing systems are described with the Poisson distribution of probabilities, but processes of their elimination obey exponential law. For the system described above, there has been developed software realization of graphical interface which allows easily to change input parameters and observe graphical reflection of changes of the output indicators of the system.

Basic Limit Theorems for Light Traffic Queues &Their Applications

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.

考虑通信延迟的智能车队纵向控制

针对智能车队纵向跟随控制中车辆之间信息传递存在的延迟问题,提出了一种通信延迟条件下运动状态估计与模型预测控制相结合的MSE-MPC(Motion State Estimation-Model Predictive Control)智能车辆队列纵向跟随控制方法。利用运动状态估计算法,对通信延迟情况下的前车状态信息进行估计,并将所预测的前车状态信息用于更新模型预测控制器的输入,决策出跟随车行驶所需的期望加速度,在保持合理的车间距情况下,实现车辆的加减速,使队列系统达到稳定。通过Simulink/Carsim联合仿真平台,在固定延迟和随机延迟两种不同延迟条件下对控制算法进行仿真验证,并与无延迟时MSE-MPC及有延迟时MPC算法的控制效果进行对比。仿真结果表明,MSE-MPC融合算法有效,对于延迟时长的变化不敏感,能够较好地抵抗通信延迟的影响,而且整体的控制效果较好,能够保证队列的稳定运行。

乐园游客排队最大接受时长影响因素研究——基于上海迪士尼乐园的实证研究

以ACSI模型为核心,结合ABC态度模型和归因理论等建立了概念模型,旨在探究游客排队最大接受时长的影响因素。将迪士尼乐园作为研究对象,对收集到的220份问卷进行统计分析结果发现,顾客期望维度的四个变量对排队最大接受时长均存在正向影响;游客排队时的感知质量中,游客对于园方排队管理的努力程度的感知以及游乐项目对于游客预期的个性化需求的满足程度对排队最大接受时长有正向影响,而排队的感知时长会对其产生负向影响;排队最大接受时长与顾客的抱怨/不满之间存在负向影响。研究结论为乐园优化游客排队体验,提升游客排队最大接受时长提供了一定的指导。

信号交叉口车辆生态驾驶速度优化策略

为提高交叉口车辆通行效率,降低车辆因频繁启停造成的能耗及污染物排放,提出一种考虑排队长度动态变化的信号交叉口车辆生态驾驶速度优化策略。首先,根据排队长度预测目标车辆与排队队列的碰撞时间(TTC)。其次,将目标车辆通行策略分为匀速、加速、减速三种情况建立通行决策模型,结合改进的三角函数速度优化模型计算最优通行速度,确保车辆以平滑的速度顺利通过信号交叉口。最后,在不同排队长度场景下进行仿真实验,对比分析速度优化策略与无速度优化策略的时空轨迹。仿真结果表明,提出的速度优化策略既可以提高绿灯利用率,又可以降低目标车辆的燃油消耗,相较于无速度优化策略驾驶,燃油消耗最多可降低19.5%,对信号交叉口处车辆生态驾驶有积极作用。

脑卒中住院患者性别、年龄及时空分布特征:基于宁夏地区19万例患者数据

背景脑卒中是血液无法流入大脑而导致脑组织受损的一种急性脑血管疾病,其致残率、致死率以及复发率较高,宁夏地区相关研究多为脑卒中临床相关分析,缺乏对近年宁夏地区脑卒中住院情况的变化趋势分析。目的分析宁夏地区脑卒中住院患者疾病流行特征及分布情况,为制定脑卒中综合防治措施提供依据。方法收集宁夏地区共55家中医及西医医院的病案首页数据,筛选出2013—2019年出院且主要诊断为脑卒中[国际疾病分类(ICD)-10编码为I60~I63]的数据进行分析。应用SPSS 24.0软件采用χ^(2)检验对性别及年龄进行差异性分析,应用地理信息系统采用全局空间自相关分析方法对宁夏地区2013—2019年脑卒中住院率数据的分布进行分析。结果最终纳入190634例脑卒中患者数据。2013—2019年宁夏地区脑卒中住院率呈逐年上升趋势(住院率分别为24.302/10000、30.045/10000、34.949/10000、39.397/10000、44.049/10000、47.617/10000、52.944/10000,χ_(趋势)^(2)=5.982,P=0.014),且在每年的寒冷季节住院率较高,每年3月份有1个明显的高峰,之后稍有下降。2013—2019年宁夏地区脑卒中住院患者中,缺血性脑卒中167194例,出血性脑卒中23440例;缺血性脑卒中和出血性脑卒中患者不同性别、年龄比较,差异有统计学意义(χ^(2)=473.533、7518.543,P<0.05);且从数据上看,缺血性脑卒中和出血性脑卒中男性、≥60岁住院患者所占比例均超过50%。全局空间自相关分析结果显示,2013年、2018年和2019年脑卒中住院率存在空间聚集性(P<0.05)。空间分布图显示,宁夏地区住院的脑卒中患者主要集中在宁夏中北部。结论2013—2019年宁夏地区脑卒中患者住院率表现为不断上升且存在不同程度的聚集性,住院率较高的地区集中在宁夏中北部。

基于CloudSim的电力系统计算云原生模型与仿真方法

分析基于云计算的电力系统计算过程是实现资源高效利用的基础。因此,提出一种基于CloudSim的电力系统计算的云原生建模与仿真方法。基于云原生技术阐述了电力系统计算架构的关键要素,提出基于CloudSim的电力系统计算架构的云原生模型,分析电力云任务调配时的资源供需平衡问题。建立基于微服务的电力云任务模型,分析微服务的处理时序逻辑及其层级关系并生成微服务队列。据此提出微服务的动态调配模型,采用微服务-容器映射策略与实体动态整合策略,实现微服务在实体间的动态映射。利用CloudSim进行仿真分析,结果证明所提方法可行且有效,可为电力云计算的资源配置、任务调度等提供基本的仿真工具与方法。