244 research outputs found
Reversibility and further properties of FCFS infinite bipartite matching
The model of FCFS infinite bipartite matching was introduced in
caldentey-kaplan-weiss 2009. In this model there is a sequence of items that
are chosen i.i.d. from and an independent
sequence of items that are chosen i.i.d. from ,
and a bipartite compatibility graph between and
. Items of the two sequences are matched according to the
compatibility graph, and the matching is FCFS, each item in the one sequence is
matched to the earliest compatible unmatched item in the other sequence. In
adan-weiss 2011 a Markov chain associated with the matching was analyzed, a
condition for stability was verified, a product form stationary distribution
was derived and the rates of matches between compatible types
and were calculated.
In the current paper, we present several new results that unveil the
fundamental structure of the model. First, we provide a pathwise Loynes' type
construction which enables to prove the existence of a unique matching for the
model defined over all the integers. Second, we prove that the model is
dynamically reversible: we define an exchange transformation in which we
interchange the positions of each matched pair, and show that the items in the
resulting permuted sequences are again independent and i.i.d., and the matching
between them is FCFS in reversed time. Third, we obtain product form stationary
distributions of several new Markov chains associated with the model. As a by
product, we compute useful performance measures, for instance the link lengths
between matched items.Comment: 33 pages, 12 figure
Dynamical Modeling of Cloud Applications for Runtime Performance Management
Cloud computing has quickly grown to become an essential component in many modern-day software applications. It allows consumers, such as a provider of some web service, to quickly and on demand obtain the necessary computational resources to run their applications. It is desirable for these service providers to keep the running cost of their cloud application low while adhering to various performance constraints. This is made difficult due to the dynamics imposed by, e.g., resource contentions or changing arrival rate of users, and the fact that there exist multiple ways of influencing the performance of a running cloud application. To facilitate decision making in this environment, performance models can be introduced that relate the workload and different actions to important performance metrics.In this thesis, such performance models of cloud applications are studied. In particular, we focus on modeling using queueing theory and on the fluid model for approximating the often intractable dynamics of the queue lengths. First, existing results on how the fluid model can be obtained from the mean-field approximation of a closed queueing network are simplified and extended to allow for mixed networks. The queues are allowed to follow the processor sharing or delay disciplines, and can have multiple classes with phase-type service times. An improvement to this fluid model is then presented to increase accuracy when the \emph{system size}, i.e., number of servers, initial population, and arrival rate, is small. Furthermore, a closed-form approximation of the response time CDF is presented. The methods are tested in a series of simulation experiments and shown to be accurate. This mean-field fluid model is then used to derive a general fluid model for microservices with interservice delays. The model is shown to be completely extractable at runtime in a distributed fashion. It is further evaluated on a simple microservice application and found to accurately predict important performance metrics in most cases. Furthermore, a method is devised to reduce the cost of a running application by tuning load balancing parameters between replicas. The method is built on gradient stepping by applying automatic differentiation to the fluid model. This allows for arbitrarily defined cost functions and constraints, most notably including different response time percentiles. The method is tested on a simple application distributed over multiple computing clusters and is shown to reduce costs while adhering to percentile constraints. Finally, modeling of request cloning is studied using the novel concept of synchronized service. This allows certain forms of cloning over servers, each modeled with a single queue, to be equivalently expressed as one single queue. The concept is very general regarding the involved queueing discipline and distributions, but instead introduces new, less realistic assumptions. How the equivalent queue model is affected by relaxing these assumptions is studied considering the processor sharing discipline, and an extension to enable modeling of speculative execution is made. In a simulation campaign, it is shown that these relaxations only has a minor effect in certain cases
Approximate Analysis of an Unreliable M/M/2 Retrial Queue
This thesis considers the performance evaluation of an M/M/2 retrial queue for which both servers are subject to active and idle breakdowns. Customers may abandon service requests if they are blocked from service upon arrival, or if their service is interrupted by a server failure. Customers choosing to remain in the system enter a retrial orbit for a random amount of time before attempting to re-access an available server. We assume that each server has its own dedicated repair person, and repairs begin immediately following a failure. Interfailure times, repair times and times between retrials are exponentially distributed, and all processes are assumed to be mutually independent. Modeling the number of customers in the orbit and status of the servers as a continuous-time Markov chain, we employ a phase-merging algorithm to approximately analyze the limiting behavior. Subsequently, we derive approximate expressions for several congestion and delay measures. Using a benchmark simulation model, we assess the accuracy of the approximations and show that, when the algorithm assumptions are met, the approximation procedure yields favorable results. However, as the rate of abandonment for blocked arrivals decreases, the performance declines while the results are insensitive to the rate of abandonment of customers preempted by a server failure
EUROPEAN CONFERENCE ON QUEUEING THEORY 2016
International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the TakĂĄcs Award for outstanding PhD thesis on "Queueing Theory and its Applications"
Representative queueing network models of computer systems in terms of time delay probability distributions
Imperial Users onl
Recommended from our members
Approximation and Control of Skill Based Parallel Service Systems with Homogeneous Service
A skill base parallel service system is comprised of a set of customers of different classes that arrive randomly for service, a set of servers that serve those customers and a set of qualifications that defines which customer classes can be served by which server. Systems of this kind appear in a wide range of applications from the assignment of jobs to employees with different skills to network traffic routing. Literature regarding these systems has almost exclusively been focused on the asymptotic heavy traffic regime. The reason being that such an asymptotic regime is convenient to analyze and allows the derivation of exact results. However, although many applications can be well approximated by an asymptotic regime, many others can not. In this work we are especially concerned with large scale sparse systems where, despite the system being large of scale, each customer class can only be served by a small subset of the servers. After laying foundations for the model in Chapter 1 and exploring structural properties in Chapter 2 we go on to present the two main contributions of this work. In Chapter 3 we develop a set of approximations that compile to a , first of its kind, approximation scheme of matching rates of skill based parallel service system operating under the \textit{first-come-first-serve} or \textit{longest-queue-first} policies. The accuracy of the approximation is verified with extensive simulation experiments where it is shown to provide matching rate estimates with an absolute error of for a wide range of traffic intensities. Later, in Chapter 4 we use insights provided by the new approximation to derive weighted versions of the \textit{first-come-first-serve} or \textit{longest-queue-first} and show, through comprehensive simulation testing, that these weighted polices dramatically reduce the waiting time of customers in congested system compared to the original unweighted versions. Finally, we extend the use of the weighted policies to systems with matching rewards and show that, by appropriate choice of weights, these policies can be used by a controller to efficiently trade-off between the rate of reward accumulation and waiting time experienced by the customer
MAP/PH/1 systems with group service: performance analysis under diïŹerent admission strategies
2015 - 2016Recent advances in wireless communication networks led to possibility of multi-rate transmission of information. The queueing theory represents a valid tool to study how the performances of such communication systems can be improved, and to give proper solutions. Modeling a multi-rate transmission system, in terms of queueing theory, means that a particular discipline has to be considered: a group of requests from users can be processed simultaneously in parallel and processing of the whole group is supposed ïŹnished if processing of all individual requests belonging to this group is over. In order to model this typology of telecommunication systems, some particular assumption can be made on arrivals, which occur by a Markovian arrival process, and on service time and length of admission period, which are regulated by phase type distributions. Thus, in this thesis MAP/PH/1 queueing systems have been considered, with and without retrial to take into account all possible behaviours of the customers. The main goal of the research activity presented in this work is to introduce novel admission strategies for the described systems, in order to give a major contribute to the current performance analysys, in particular as regard the choice of the optimal length of admission period and optimal size of the groups. Dynamics of such systems are described by multidimensional Markov chains. Ergodicity condition for these Markov chains have been derived, stationary probability distribution of the states have been computed, formulas for the main performance measures of the system have been attained. Essential advantages of the proposed customerâs service disciplines have been numerically illustrated. [edited by author]I recenti progressi ottenuti per le reti di comunicazione wireless, permettono la trasmissione multi-frequenza delle informazioni. La teoria delle code rappresenta un valido strumento per studiare come le performance di tali sistemi di comunicazione possano essere migliorate, e individuare opportune soluzioni. In termini di teoria delle code, modellare un sistema di trasmissione multi-frequenza signiïŹca considerare una determinata disciplina: un gruppo di richieste da parte di utenti possono essere processate simultaneamente in parallelo, e il processo dellâintero gruppo risulta completato se tutte le richieste appartenenti a tale gruppo sono espletate. Al ïŹne di modellare tale tipologia di sistemi di telecomunicazione, si possono deïŹnire particolari assunzioni sugli arrivi, determinati da processi di arrivo Markoviani, e sul tempo di servizio e lunghezza del periodo di ammissione, regolati da distribuzioni di tipo a fasi. Pertanto, in tale lavoro di tesi sono stati considerati sistemi a coda di tipo MAP/PH/1, con e senza retrial per considerare tutti i possibili comportamenti degli utenti. Il principale obiettivo dellâattivita` di ricerca presentata in tale lavoro `e introdurre nuove strategie di ammissione per i sistemi descritti, al ïŹne di fornire un maggior contributo alle attuali analisi sulle performance, in particolare relativamente alla scelta della lunghezza ottimale del periodo di ammissione e la dimensione ottimale dei gruppi. Le dinamiche di tali sistemi sono descritte da catene di Markov multidimensionali. `E stata ricavata la condizione di ergodicit`a per tali catene di Markov, `e stata calcolata la distribuzione delle probabilita` stazionarie degli stati, e sono state ottenute le formule per le misure dei principali parametri prestazionali del sistema. I principali vantaggi delle discipline di servizio proposte sono state illustrate numericamente. [a cura dell'autore]XXIX n.s
Quality of service modeling and analysis for carrier ethernet
Today, Ethernet is moving into the mainstream evolving into a carrier grade technology. Termed as Carrier Ethernet it is expected to overcome most of the\ud
shortcomings of native Ethernet. It is envisioned to carry services end-to-end serving corporate data networking and broadband access demands as well as backhauling wireless traffic. As the penetration of Ethernet increases, the offered Quality of Service (QoS) will become increasingly important and a distinguishing factor between different service providers. The challenge is to meet the QoS requirements of end applications such as response times, throughput, delay and jitter by managing the network resources at hand. Since Ethernet was not designed to operate in large public networks it does not possess functionalities to address this issue. In this thesis we propose and analyze mechanisms which improve the QoS performance of Ethernet enabling it to meet the demands of the current and next generation services and applications.\u
- âŠ