On two modifications of E-r/E-s/1/m queuing system subject to disasters

The paper deals with modelling a finite single-server queuing system with the server subject to disasters. Inter-arrival times and service times are assumed to follow the Erlang distribution defined by the shape parameter r or s and the scale parameter rλ or sμ respectively. We consider two modifications of the model − server failures are supposed to be operate-independent or operate-dependent. Server failures which have the character of so-called disasters cause interruption of customer service, emptying the system and balking incoming customers when the server is down. We assume that random variables relevant to server failures and repairs are exponentially distributed. The constructed mathematical model is solved using Matlab to obtain steady-state probabilities which we need to compute the performance measures. At the conclusion of the paper some results of executed experiments are shown.Web of Science12215814

Mathematical Analysis of Queue with Phase Service: An Overview

We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent

Analysis of buffer allocations in time-dependent and stochastic flow lines

This thesis reviews and classifies the literature on the Buffer Allocation Problem under steady-state conditions and on performance evaluation approaches for queueing systems with time-dependent parameters. Subsequently, new performance evaluation approaches are developed. Finally, a local search algorithm for the derivation of time-dependent buffer allocations is proposed. The algorithm is based on numerically observed monotonicity properties of the system performance in the time-dependent buffer allocations. Numerical examples illustrate that time-dependent buffer allocations represent an adequate way of minimizing the average WIP in the flow line while achieving a desired service level

Stability Problems for Stochastic Models: Theory and Applications II

Most papers published in this Special Issue of Mathematics are written by the participants of the XXXVI International Seminar on Stability Problems for Stochastic Models, 21­25 June, 2021, Petrozavodsk, Russia. The scope of the seminar embraces the following topics: Limit theorems and stability problems; Asymptotic theory of stochastic processes; Stable distributions and processes; Asymptotic statistics; Discrete probability models; Characterization of probability distributions; Insurance and financial mathematics; Applied statistics; Queueing theory; and other fields. This Special Issue contains 12 papers by specialists who represent 6 countries: Belarus, France, Hungary, India, Italy, and Russia

Distributed Control Methods for Integrating Renewable Generations and ICT Systems

With increased energy demand and decreased fossil fuels usages, the penetration of distributed generators (DGs) attracts more and more attention. Currently centralized control approaches can no longer meet real-time requirements for future power system. A proper decentralized control strategy needs to be proposed in order to enhance system voltage stability, reduce system power loss and increase operational security. This thesis has three key contributions: Firstly, a decentralized coordinated reactive power control strategy is proposed to tackle voltage fluctuation issues due to the uncertainty of output of DG. Case study shows results of coordinated control methods which can regulate the voltage level effectively whilst also enlarging the total reactive power capability to reduce the possibility of active power curtailment. Subsequently, the communication system time-delay is considered when analyzing the impact of voltage regulation. Secondly, a consensus distributed alternating direction multiplier method (ADMM) algorithm is improved to solve the optimal power ow (OPF) problem. Both synchronous and asynchronous algorithms are proposed to study the performance of convergence rate. Four different strategies are proposed to mitigate the impact of time-delay. Simulation results show that the optimization of reactive power allocation can minimize system power loss effectively and the proposed weighted autoregressive (AR) strategies can achieve an effective convergence result. Thirdly, a neighboring monitoring scheme based on the reputation rating is proposed to detect and mitigate the potential false data injection attack. The simulation results show that the predictive value can effectively replace the manipulated data. The convergence results based on the predictive value can be very close to the results of normal case without cyber attack

Optimal Dynamic Control of Queueing Networks: Emergency Departments, the W Service Network, and Supply Chains under Disruptions.

Many systems in both the service and manufacturing sectors can be modeled and analyzed as queueing networks. In such systems, control and design is often an important issue that may significantly affect the performance. This dissertation focuses on the development of innovative techniques for the design and control of such systems. Special attention is given to real-world applications in (a) the design and control of patient flow in the hospital emergency departments, (b) design and control of service/call centers, and (c) the design and control of supply chains under disruption risks. With respect to application (a), using hospital data, analytical models, and simulation analyses we show how (1) better patient prioritization, (2) enhanced triage systems, and (3) improved patient flow designs allow emergency departments to significantly improve their performance with respect to both operational efficiency and patient safety. Regarding application (b), we give specific attention to a two-server and three-demand class network in the shape of a ``W'' with random server disruption and repair times. Studying this network, we show how effective control and design strategies that efficiently make use of (partial) flexibility of servers can be implemented to achieve high performance and resilience to server disruptions. In addition to establishing stability properties of different known control mechanisms, a new heuristic policy, termed Largest Expected Workload Cost (LEWC), is proposed and its performance is extensively benchmarked with respect to other widely used polices. Regarding application (c), we demonstrate how supply chains can boost their performance using better control and design strategies that efficiently take into account supply disruption risks. Motivated by several real-world examples of disruptions, production flexibility, and supply contracts within supply chains, we model the informational and operational flexibility approaches to designing a resilient supply chain. By analyzing optimal ordering policies, sourcing strategies, and the optimal levels of back-up capacity reservation contracts, various disruption risk mitigation strategies are considered and compared, and new insights into the design of resilient supply chains are provided.PHDIndustrial and Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/94002/1/soroush_1.pd

Scalable, Data- intensive Network Computation

To enable groups of collaborating researchers at different locations to effectively share large datasets and investigate their spontaneous hypotheses on the fly, we are interested in de- veloping a distributed system that can be easily leveraged by a variety of data intensive applications. The system is composed of (i) a number of best effort logistical depots to en- able large-scale data sharing and in-network data processing, (ii) a set of end-to-end tools to effectively aggregate, manage and schedule a large number of network computations with attendant data movements, and (iii) a Distributed Hash Table (DHT) on top of the generic depot services for scalable data management. The logistical depot is extended by following the end-to-end principles and is modeled with a closed queuing network model. Its performance characteristics are studied by solving the steady state distributions of the model using local balance equations. The modeling results confirm that the wide area network is the performance bottleneck and running concurrent jobs can increase resource utilization and system throughput. As a novel contribution, techniques to effectively support resource demanding data- intensive applications using the ¯ne-grained depot services are developed. These techniques include instruction level scheduling of operations, dynamic co-scheduling of computation and replication, and adaptive workload control. Experiments in volume visualization have proved the effectiveness of these techniques. Due to the unique characteristic of data- intensive applications and our co-scheduling algorithm, a DHT is implemented on top of the basic storage and computation services. It demonstrates the potential of the Logistical Networking infrastructure to serve as a service creation platform

Performance of Computer Systems; Proceedings of the 4th International Symposium on Modelling and Performance Evaluation of Computer Systems, Vienna, Austria, February 6-8, 1979

These proceedings are a collection of contributions to computer system performance, selected by the usual refereeing process from papers submitted to the symposium, as well as a few invited papers representing significant novel contributions made during the last year. They represent the thrust and vitality of the subject as well as its capacity to identify important basic problems and major application areas. The main methodological problems appear in the underlying queueing theoretic aspects, in the deterministic analysis of waiting time phenomena, in workload characterization and representation, in the algorithmic aspects of model processing, and in the analysis of measurement data. Major areas for applications are computer architectures, data bases, computer networks, and capacity planning. The international importance of the area of computer system performance was well reflected at the symposium by participants from 19 countries. The mixture of participants was also evident in the institutions which they represented: 35% from universities, 25% from governmental research organizations, but also 30% from industry and 10% from non-research government bodies. This proves that the area is reaching a stage of maturity where it can contribute directly to progress in practical problems

ROBUST DECISION-MAKING AND DYNAMIC RESILIENCE ESTIMATION FOR INTERDEPENDENT RISK ANALYSIS

When systems and subsystems are put under external shocks and duress, they suffer physical and economic collapse. The ability of the system components to recover and operate at new stable production levels characterizes resilience. This research addresses the problem of estimating, quantifying and planning for resilience in interdependent systems, where interconnectedness adds to problem complexity. Interdependence drives the behavior of sectors before and after disruptions. Among other approaches this study concentrates on economic interdependence because it provides insights into other levels of interdependence. For sectors the normalized losses in economic outputs and demands are suitable metrics for measuring interdependent risk. As such the inoperability input-output model enterprise is employed and expanded in this study to provide a useful tool for measuring the cascading effects of disruptions across large-scale interdependent infrastructure systems. This research defines economic resilience for interdependent infrastructures as an "ability exhibited by such systems that allows them to recover productivity after a disruptive event in a desired time and/or with an acceptable cost". Through the dynamic interdependent risk model resilience for a disrupted infrastructure is quantified in terms of its average system functionality, maximum loss in functionality and the time to recovery, which make up a resilience estimation decision-space. Estimating such a decision-space through the dynamic model depends upon the estimation of the rate parameter in the model. This research proposes a new approach, based on dynamic data assimilation methods, for estimating the rate parameter and strengthening post-disaster resilience of economic systems. The solution to the data assimilation problem generates estimates for the rate of resilient recovery that reflects planning considerations interpreted as commodity substitutions, inventory management and incorporating redundancies. The research also presents a robust optimization based risk management approach for strengthening interdependent static resilience estimation. There is a paucity of research dealing with quantification and assessment of uncertainties in interdependency models. The focus here is more on the extreme bounds of event and data uncertainties. The deterministic optimization becomes a robust optimization problem when extremes of uncertainties are considered. Computationally tractable robust counterparts to nominal problems are presented here. Also presented in this research is a discrete event simulation based queuing model for studying multi-modal transportation systems with particular focus on inland waterway ports. Such models are used for impact analysis studies of inland port disruptions. They can be integrated with the resilience planning methodologies to develop a framework for large-scale interdependent risk and recovery analysis