161 research outputs found
Queueing networks: solutions and applications
During the pasttwo decades queueing network models have proven to be a versatile tool for computer system and computer communication system performance evaluation. This chapter provides a survey of th field with a particular emphasis on applications. We start with a brief historical retrospective which also servesto introduce the majr issues and application areas. Formal results for product form queuenig networks are reviewed with particular emphasis on the implications for computer systems modeling. Computation algorithms, sensitivity analysis and optimization techniques are among the topics covered. Many of the important applicationsof queueing networks are not amenableto exact analysis and an (often confusing) array of approximation methods have been developed over the years. A taxonomy of approximation methods is given and used as the basis for for surveing the major approximation methods that have been studied. The application of queueing network to a number of areas is surveyed, including computer system cpacity planning, packet switching networks, parallel processing, database systems and availability modeling.Durante as últimas duas décadas modelos de redes de filas provaram ser uma ferramenta versátil para avaliação de desempenho de sistemas de computação e sistemas de comunicação. Este capÃtulo faz um apanhado geral da área, com ênfase em aplicações. Começamos com uma breve retrospectiva histórica que serve também para introduzir os pontos mais importantes e as áreas de aplicação. Resultados formais para redes de filas em forma de produto são revisados com ênfase na modelagem de sistemas de computação. Algoritmos de computação, análise de sensibilidade e técnicas de otimização estão entre os tópicos revistos. Muitas dentre importantes aplicações de redes de filas não são tratáveis por análise exata e uma série (frequentemente confusa) de métodos de aproximação tem sido desenvolvida. Uma taxonomia de métodos de aproximação é dada e usada como base para revisão dos mais importantes métodos de aproximação propostos. Uma revisão das aplicações de redes de filas em um número de áreas é feita, incluindo planejamento de capacidade de sistemas de computação, redes de comunicação por chaveamento de pacotes, processamento paralelo, sistemas de bancos de dados e modelagem de confiabilidade
A comparison of some performance evaluation techniques
In this thesis we look at three approaches to modelling interactive computer systems: Simulation, Operational analysis and Performance-Oriented design. The simulation approach, presented first, is applied to a general purpose, multiprogrammed, machine independent, virtual memory computer system. The model is used to study the effects of different performance parameters upon important performance indices. It is also used to compare or validate the results produced by the other two methods. The major drawback of the simulation model (i.e. its relatively high cost) has been overcome by combining regression techniques with simulation, using simple experimental case studies. Next, operational analysis was reviewed in a hierarchical way (starting by analysing a single-resource queue and ending up by analysing a multi-class customer general interactive system), to study the performance model of general interactive systems. The results of the model were compared with the performance indices produced using the simulation results. The performance-oriented design technique was the third method used for building system performance models. Here, several optimization design problems have been reviewed to minimize the response time or maximize the system throughput subject to a cost constraint. Again, the model results were compared with the simulation results using different cost constraints. We suggest finally, that the above methods should be used together to assist the designer in building computer performance models
Effective Resource and Workload Management in Data Centers
The increasing demand for storage, computation, and business continuity has driven the growth of data centers. Managing data centers efficiently is a difficult task because of the wide variety of datacenter applications, their ever-changing intensities, and the fact that application performance targets may differ widely. Server virtualization has been a game-changing technology for IT, providing the possibility to support multiple virtual machines (VMs) simultaneously. This dissertation focuses on how virtualization technologies can be utilized to develop new tools for maintaining high resource utilization, for achieving high application performance, and for reducing the cost of data center management.;For multi-tiered applications, bursty workload traffic can significantly deteriorate performance. This dissertation proposes an admission control algorithm AWAIT, for handling overloading conditions in multi-tier web services. AWAIT places on hold requests of accepted sessions and refuses to admit new sessions when the system is in a sudden workload surge. to meet the service-level objective, AWAIT serves the requests in the blocking queue with high priority. The size of the queue is dynamically determined according to the workload burstiness.;Many admission control policies are triggered by instantaneous measurements of system resource usage, e.g., CPU utilization. This dissertation first demonstrates that directly measuring virtual machine resource utilizations with standard tools cannot always lead to accurate estimates. A directed factor graph (DFG) model is defined to model the dependencies among multiple types of resources across physical and virtual layers.;Virtualized data centers always enable sharing of resources among hosted applications for achieving high resource utilization. However, it is difficult to satisfy application SLOs on a shared infrastructure, as application workloads patterns change over time. AppRM, an automated management system not only allocates right amount of resources to applications for their performance target but also adjusts to dynamic workloads using an adaptive model.;Server consolidation is one of the key applications of server virtualization. This dissertation proposes a VM consolidation mechanism, first by extending the fair load balancing scheme for multi-dimensional vector scheduling, and then by using a queueing network model to capture the service contentions for a particular virtual machine placement
Parallel simulation techniques for telecommunication network modelling
In this thesis, we consider the application of parallel simulation to the performance modelling of telecommunication networks. A largely automated approach was first explored using a parallelizing compiler to speed up the simulation of simple models of circuit-switched networks. This yielded reasonable results for relatively little effort compared with other approaches. However, more complex simulation models of packet- and cell-based telecommunication networks, requiring the use of discrete event techniques, need an alternative approach. A critical review of parallel discrete event simulation indicated that a distributed model components approach using conservative or optimistic synchronization would be worth exploring. Experiments were therefore conducted using simulation models of queuing networks and Asynchronous Transfer Mode (ATM) networks to explore the potential speed-up possible using this approach. Specifically, it is shown that these techniques can be used successfully to speed-up the execution of useful telecommunication network simulations. A detailed investigation has demonstrated that conservative synchronization performs very well for applications with good look ahead properties and sufficient message traffic density and, given such properties, will significantly outperform optimistic synchronization. Optimistic synchronization, however, gives reasonable speed-up for models with a wider range of such properties and can be optimized for speed-up and memory usage at run time. Thus, it is confirmed as being more generally applicable particularly as model development is somewhat easier than for conservative synchronization. This has to be balanced against the more difficult task of developing and debugging an optimistic synchronization kernel and the application models
Queueing Network Models of Ambulance Offload Delays
Although healthcare operations management has been an active and popular research
direction over the past few years, there is a lack of formal quantitative models to analyze
the ambulance o oad delay problem. O oad delays occur when an ambulance arriving at
a hospital Emergency Department (ED) is forced to remain in front of the ED until a bed
is available for the patient. Thus, the ambulance and the paramedic team are responsible
to care for the patient until a bed becomes available inside the ED. But it is not as simple
as waiting for a bed, as EDs also admit patients based on acuity levels. While the main
cause of this problem is the lack of capacity to treat patients inside the EDs, Emergency
Medical Services (EMS) coverage and availability are signi cantly a ected. In this thesis,
we develop three network queueing models to analyze the o oad delay problem. In order
to capture the main cause of those delays, we construct queueing network models that
include both EMS and EDs. In addition, we consider patients arriving to the EDs by
themselves (walk-in patients) since they consume ED capacity as well.
In the rst model, ED capacity is modeled as the combination of bed, nurse, and
doctor. If a patient with higher acuity level arrives to the ED, the current patient's
service is interrupted. Thus, the service discipline at the EDs is preemptive resume. We
also assume that the time the ambulance needs to reach the patient, upload him into the
ambulance, and transfer him to the ED (transit time) is negligible. We develop e cient
algorithms to construct the model Markov chain and solve for its steady state probability
distribution using Matrix Analytic Methods. Moreover, we derive di erent performance
measures to evaluate the system performance under di erent settings in terms of the
number of beds at each ED, Length Of Stay (LOS) of patients at an ED, and the number
of ambulances available to serve a region. Although capacity limitations and increasing
demand are the main drivers for this problem, our computational analysis show that
ambulance dispatching decisions have a substantial impact on the total o oad delays
incurred.
In the second model, the number of beds at each ED is used to model the service
capacity. As a result of this modeling approach, the service discipline of patients is
assumed to be nonpreemptive priority. We also assume that transit times of ambulances
are negligible. To analyze the queueing network, we develop a novel algorithm to construct
the system Markov chain by de ning a layer for each ED in a region. We combine the
Markov chain layers based on the fact that regional EDs are only connected by the number
of available ambulances to serve the region. Using Matrix Analytic Methods, we nd the
limiting probabilities and use the results to derive di erent system performance measures.
Since each ED's patients are included in the model simultaneously, we solve only for small
instances with our current computational resources.
In the third model, we decompose the regional network into multiple single EDs. We
also assume that patients arriving by ambulances have higher nonpreemptive priority
discipline over walk-in patients. Unlike the rst two models, we assume that transit
times of ambulances are exponentially distributed. To analyze the decomposed queueing
network performance, we construct a Markov chain and solve for its limiting probabilities
using Matrix Analytic Methods. While the main objective for the rst two models is
performance evaluation, in this model we optimize the steady state dispatching decisions
for ambulance patients. To achieve this goal, we develop an approximation scheme for the
expected o oad delays and expected waiting times of patients. Computational analysis
conducted suggest that larger EDs should be loaded more heavily in order to keep the
total o oad delays at minimal levels
Recommended from our members
Canonical approximation in the performance analysis of distributed systems
The problem of analyzing distributed systems arises in many areas of computer science, such as communication networks, distributed databases, packet radio networks, VLSI communications and switching mechanisms. Analysis of distributed systems is difficult since one must deal with many tightly-interacting components. The number of possible state configurations typically grows exponentially with the system size, making the exact analysis intractable even for relatively small systems. For the stochastic models of these systems, whose steady-state probability is of the product form, many global performance measures of interest can be computed once one knows the normalization constant of the steady-state probability distribution. This constant, called the system partition function, is typically difficult to derive in closed form. The key difficulty in performance analysis of such models can be viewed as trying to derive a good approximation to the partition function or calculate it numerically. In this Ph.D. work we introduce a new approximation technique to analyze a variety of such models of distributed systems. This technique, which we call the method of Canonical Approximation, is similar to that developed in statistical physics to compute the partition function. The new method gives a closed-form approximation of the partition function and of the global performance measures. It is computationally simple with complexity independent of the system size, gives an excellent degree of precision for large systems, and is applicable to a wide variety of problems. The method is applied to the analysis of multihop packet radio networks, locking schemes in database systems, closed queueing networks, and interconnection networks
Discrete Time Analysis of Consolidated Transport Processes
Diese Arbeit beschäftigt sich mit der Entwicklung zeitdiskreter Modelle zur Analyse von Transportbündelungen. Mit den entwickelten Modellen für Bestands- und Fahrzeugbündelungen, insbesondere Milkrun-Systeme, kann eine detaillierte Leistungsbewertung in kurzer Zeit durchgeführt werden. Darüber hinaus erlauben die Modelle die Analyse der Umschlagslagerbündelungen, beispielweise Hub-und-Spoke-Netzwerke, indem sie im Rahmen einer Netzwerkanalyse mit einander verknüpft werden
- …