Hospital Bed Allocation Strategy Based on Queuing Theory during the COVID-19 Epidemic

During the current epidemic,it is necessary to ensure the rehabilitation treatment of children with serious illness.At the same time,however,it is essential to effectively prevent cross-infection and prevent infections from occurring within the hospital setting.To resolve this contradiction,the rehabilitation department of Nanjing Children’s Hospital adjusted its bed allocation based on the queuing model,with reference to the regional source and classification of the children’s conditions in the rehabilitation department ward.The original triple rooms were transformed into a double room to enable the treatment of severely sick children coming from other places.A M/G/2 queuing model with priority was also applied to analyze the state of patient admissions.Moreover,patients in Nanjing were also classified into mild and severe cases.The M/M/1 queuing model with priority was used for analysis of this situation,so that severely ill children could be treated in time while patients with mild symptoms could be treated at home.This approach not only eases the bed tension in the ward,but also provides suitable conditions for controlling cross-infection.

Performance analysis of blockchain for civil aviation business data based on M/G/1 queuing theory

An Ethereum blockchain based on proof of stake ( PoS) consensus mechanism is used to achieve the data sharing within the civil aviation service platform for both airport group management and passengers. Considering the Gas consumption of Ethereum, the dynamic batch-service capacity constraint by the Block Gas Limit and the priority mechanism depending on the different Gas Price of transactions, M/ G/1 queuing theory with batch-service is used to construct the service model of transactions confirmation process in the proposed blockchain system, where the effects of transactions arrival rate, block capacity, service rate and number of nodes on the average confirmation time of transactions with different priority are analyzed, and eventually a performance analysis model of blockchain for civil aviation business data is proposed. The simulation results prove the usability and accuracy of the model, which can provide both theoretical basis for data sharing of civil aviation using Ethereum blockchain and the further optimization of transactions confirmation time.

Coordinated Voltage Control of Distribution Network ConsideringMultiple Types of Electric Vehicles

The couple between the power network and the transportation network(TN)is deepening gradually with the increasing penetration rate of electric vehicles(EV),which also poses a great challenge to the traditional voltage control scheme.In this paper,we propose a coordinated voltage control strategy for the active distribution networks considering multiple types of EV.In the first stage,the action of on-load tap changer and capacitor banks,etc.,are determined by optimal power flow calculation,and the node electricity price is also determined based on dynamic time-of-use tariff mechanism.In the second stage,multiple operating scenarios of multiple types of EVs such as cabs,private cars and buses are considered,and the scheduling results of each EV are solved by building an optimization model based on constraints such as queuing theory,Floyd-Warshall algorithm and traffic flow information.In the third stage,the output power of photovoltaic and energy storage systems is fine-tuned in the normal control mode.The charging power of EVs is also regulated in the emergency control mode to reduce the voltage deviation,and the amount of regulation is calculated based on the fair voltage control mode of EVs.Finally,we test the modified IEEE 33-bus distribution system coupled with the 24-bus Beijing TN.The simulation results show that the proposed scheme can mitigate voltage violations well.

Research and Simulate the Queuing Systems Based on the Markov Chain

This paper shows the researches of the queuing theory,especially the Markov Chainand the Poison Process,and implements the efficient way of designing the queuing system.Then simulating the queuing systems based on the“Simply package”in the“Python”programming language.And the paper would discuss and analyze the differences between different queuing systems.

Analysis and Optimization of Validation Procedure in Blockchain-Enhanced Wireless Resource Sharing and Transactions

To ensure the security of resource and intelligence sharing in 6G,blockchain has been widely adopted in wireless communications and applications.Although blockchain can ensure the traceability and non-tamperability of data in the concatenated blocks,it cannot guarantee the honest behaviors of users in the application before the generation of transactions.Thus,additional technologies are required to ensure that the source of blockchain data is reliable.In this paper,the detailed procedure is designed for the application-oriented task validation in the blockchainenhanced computing resource sharing and transactions in ultra dense networks(UDN).The corresponding queuing model is built and analyzed with the consideration of the wireless re-transmission and the probability of malicious deception by users.Based on the analysis results,the UDN deployment is optimized to save network cost while ensuring latency performance.Numerical results verify our analysis,and the optimized system deployment including the number and service capacities of both base stations and mobile edge computing(MEC)servers are also given with various system settings.

Analysis on D2D Heterogeneous Networks with State-Dependent Priority Traffic

In this work,we consider the performance analysis of state dependent priority traffic and scheduling in device to device(D2D)heterogeneous networks.There are two priority transmission types of data in wireless communication,such as video or telephone,which always meet the requirements of high priority(HP)data transmission first.If there is a large amount of low priority(LP)data,there will be a large amount of LP data that cannot be sent.This situation will cause excessive delay of LP data and packet dropping probability.In order to solve this problem,the data transmission process of high priority queue and low priority queue is studied.Considering the priority jump strategy to the priority queuing model,the queuing process with two priority data is modeled as a two-dimensionalMarkov chain.A state dependent priority jump queuing strategy is proposed,which can improve the discarding performance of low priority data.The quasi birth and death process method(QBD)and fixed point iterationmethod are used to solve the causality,and the steady-state probability distribution is further obtained.Then,performance parameters such as average queue length,average throughput,average delay and packet dropping probability for both high and low priority data can be expressed.The simulation results verify the correctness of the theoretical derivation.Meanwhile,the proposed priority jump queuing strategy can significantly improve the drop performance of low-priority data.

Optimization Scheme of Large Passenger Flow in Huoying Station,Line 13 of Beijing Subway System

This paper focuses on the distribution of passenger flow in Huoying Station,Line 13 of Beijing subway system.The transformation measures taken by Line 13 since operation are firstly summarized.Then the authors elaborate the facilities and equipment of this station,especially the node layout and passenger flow field.An optimization scheme is proposed to rapidly distribute the passenger flow in Huoying Station by adjusting the operation time of the escalator in the direction of Xizhimen.The authors adopt Queuing theory and Anylogic simulation software to simulate the original and the optimized schemes of Huoying Station to distribute the passenger flow.The results of the simulation indicate that the optimized scheme could effectively alleviate the traffic congestion in the hall of Huoying Station,and the pedestrian density in other places of the hall is lowered;passengers could move freely in the hall and no new congestion points would form.The rationality of the scheme is thus proved.

Modeling of fast charging station equipped with energy storage

The popularization of EVs(electric vehicles) has brought an increasingly heavy burden to the development of charging facilities. To meet the demand of rapid energy supply during the driving period, it is necessary to establish a fast charging station in public area. However, EVs arrive at the charging station randomly and connect to the distribution network for fast charging, it causes the grid power to fluctuate greatly and the peak-valley loads to alternate frequently, which is harmful to the stability of distribution network. In order to reduce the power fluctuation of random charging, the energy storage is used for fast charging stations. The queuing model is determined to demonstrate the load characteristics of fast charging station, and the state space of fast charging station system is described by Markov chain. After that the power of grid and energy storage is quantified as the number of charging pile, and each type of power is configured rationally to establish the random charging model of energy storage fast charging station. Finally, the economic benefit is analyzed according to the queuing theory to verify the feasibility of the model.

Efficient Resource Allocation in Fog Computing Using QTCS Model

Infrastructure of fog is a complex system due to the large number of heterogeneous resources that need to be shared.The embedded devices deployed with the Internet of Things(IoT)technology have increased since the past few years,and these devices generate huge amount of data.The devices in IoT can be remotely connected and might be placed in different locations which add to the network delay.Real time applications require high bandwidth with reduced latency to ensure Quality of Service(QoS).To achieve this,fog computing plays a vital role in processing the request locally with the nearest available resources by reduced latency.One of themajor issues to focus on in a fog service is managing and allocating resources.Queuing theory is one of the most popular mechanisms for task allocation.In this work,an efficient model is designed to improve QoS with the efficacy of resource allocation based on a Queuing Theory based Cuckoo Search(QTCS)model which will optimize the overall resource management process.

NEW DYNAMIC SLOT ASSIGNMENT SCHEME OF SELF-ORGANIZED TDMA VHF DATA LINK

According to the analysis of the very high frequency (VHF) self organized time division multiple access (S TDMA) aviation data link, a new dynamic slot assignment scheme is proposed in this paper, which adopts variable data frame structure and can eliminate the effect of the idle slot on message delay. By using queue theory, the analysis models of the new scheme and previous scheme are presented, and the performance of message delay and that of system throughput are analyzed under two schemes. The simulation results show that the new scheme has a better performance than the previous one in the message delay and system throughput.

The Handling of “Waiters” Problem by Telecommunication Service Provider: A System Dynamics Approach

The queueing theory has been used by academicians and practitioners to solve supply chain problems over the years. Here, we propose a system dynamics approach and queuing theory parameters to discover the best method to handle the (supply chain) “Waiters” problem via a telecommunication service provider. We developed more than one system dynamics model and introduced the following parameters: the number of times information about registered waiters and the number of days required for procuring and commissioning the (telecommunication) ports are collected in a month. We found the number of waiting times for the customers is reduced and improved when the above-mentioned first parameter is performed more frequently (i.e., more than once).

Analyzing the time buffer in the Theory of Constraints based lean operations

This paper uses quantitative methods to estimate the size of the time buffer in lean operations controlled by the Theory of Constraints(TOC).The main focus of the operations system of TOC is the identification and management of constraints.To protect the constraints,they should be buffered with time buffers,which protecting the system’s output from disruptions and fluctuations.Despite the importance of time buffers,the approaches to identifying the size of the time buffer in literature are very empirical.In this paper,a queuing-theory based method is applied to calculate the time buffer sizes.It provides a mathematically exact expression for the coefficient of variation of waiting time for Markov queues.It then applies the concept of isomorphism to approximate the variance of customer waiting time in a general queue.Simulation experiments are conducted to verify the accuracy of approximation.

Grafting Watermelon Seedling Production Management System Based on Process Control Strategy

Greenhouse environmental management,seedling bed scheduling,and fertilizer and water management are the core technologies of seedling nursery.Precision management and control of the whole production process guarantees high grated seedling quality.In order to improve management efficiency of grafted watermelon seedling production and seedling quality,this paper designs and develops a grafted watermelon seedling production management system based on process control methods by process control strategy,seedling bed planning design,and handheld device technology.

Quantitative analysis of real-time performance and hardware requirements for edge computing platform

For real-time edge systems such as autonomous driving,not only the correctness of task functions,but also the response and processing time of tasks should be satisfied.In the hardware selection phase of a real-time system,time series analyses must be performed on the hardware platform running real-time applications.At present,the common method of worst-case execution time(WCET)analysis focuses mainly on analyzing the impact of hardware platform architecture or task execution process on the task running time.However,different tasks in an autopilot system have different levels of urgency,and preemption between tasks is the main factor that affects the task execution time.The key problem is how to quantify the time fluctuation caused by task preemption for each subtask of the autopilot system running on a fixed hardware platform.This paper presents a time analysis method for a real-time application based on a queuing theory and preemptive scheduling strategy,which assigns different priorities to tasks according to their time urgency and preemptive scheduling according to task priority.Through an experimental case study,the impact of the running time of each subtask in a real-time application with task priority preemptive scheduling is analyzed,along with the impact of changes in hardware platform performance on such real-time applications.