475 research outputs found
A Fixed-Point Algorithm for Closed Queueing Networks
In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and accurate in case of large numbers of nodes and large customer populations. We present the method, put it in perspective, and validate it through a large number of test scenarios. In most cases, the method provides accuracies within 5% relative error (in comparison to discrete-event simulation)
Recommended from our members
General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.
Priority based scheduling disciplines are widely used by existing
computer operating systems. However, the mathematical analysis and
modelling of these systems present great difficulties since priority
schedulling is not compatible with exact product form solutions of
queueing network models (QNM's). It is therefore, necessary to employ
credible approximate techniques for solving QNM's with priority
classes.
The principle of maximum entropy (ME) is a method of inference
for estimating a probability distribution given prior information in
the form of expected values. This principle is applied, based on
marginal utilisation, mean queue length and idle state probability
constraints, to characterise new product-form approximations for
general open and closed QNM's with priority (preemptive-resume,
non-preemtive head-of-line) and non-priority
(first-come-first-served, processor-sharing, last-come-first-served
with, or without preemtion) servers. The ME solutions are interpreted
in terms of a decomposition of the original network into individual
stable GIG11 queueing stations with assumed renewal arrival
processes. These solutions are implemented by making use of the
generalised exponential (GE) distributional model to approximate the
interarrival-time and service-time distributions in the network. As a
consequence the ME queue length distribution of the stable GE/GEzl
priority queue, subject to mean value constraints obtained via
classical queueing theory on bulk queues, is used as a 'building
block' together with corresponding universal approximate flow
formulae for the analysis of general QNM's with priorities. The
credibility of the ME method is demonstrated with illustrative
numerical examples and favourable comparisons against exact,
simulation and other approximate methods are made.Algerian governmen
Recommended from our members
General queueing network models for computer system performance analysis. A maximum entropy method of analysis and aggregation of general queueing network models with application to computer systems.
In this study the maximum entropy formalism [JAYN 57] is suggested
as an alternative theory for general queueing systems of computer
performance analysis. The motivation is to overcome some of the
problems arising in this field and to extend the scope of the results
derived in the context of Markovian queueing theory.
For the M/G/l model a unique maximum entropy solution., satisfying
locALl balance is derived independent of any assumptions about the service
time distribution. However, it is shown that this solution is identical
to the steady state solution of the underlying Marko-v process when the
service time distribution is of the generalised exponential (CE) type.
(The GE-type distribution is a mixture of an exponential term and a unit
impulse function at the origin). For the G/M/1 the maximum entropy
solution is identical in form to that of the underlying Markov process,
but a GE-type distribution still produces the maximum overall similar
distributions.
For the GIG11 model there are three main achievements:
first, the spectral methods are extended to give exaft formulae for
the average number of customers in the system for any G/G/l with rational
Laplace transform. Previously, these results are obtainable only through
simulation and approximation methods.
(ii) secondly, a maximum entropy model is developed and used to obtain
unique solutions for some types of the G/G/l. It is also discussed how
these solutions can be related to the corresponding stochastic processes.
(iii) the importance of the G/GE/l and the GE/GE/l for the analysis of
general networks is discussed and some flow processes for these systems
are characterised.
For general queueing networks it is shown that the maximum entropy
solution is a product of the maximum entropy solutions of the individual
nodes. Accordingly, existing computational algorithms are extended to
cover general networks with FCFS disciplines. Some implementations are
suggested and a flow algorithm is derived. Finally, these results are
iised to improve existing aggregation methods.
In addition, the study includes a number of examples, comparisons,
surveys, useful comments and conclusions
Queueing Networks With Blocking.
The area of classical (product form) queueing networks is briefly discussed. The principal results for classical queueing networks are summarized. The transfer, service and rejection blocking policies are defined, and their use in queueing network models are presented. An overview of the literature in the area of queueing networks with blocking is given, and the relations between the three blocking policies is discussed in general. Duality theorems for open and closed queueing networks with rejection blocking and a single job class are proved. Using a duality theorem, an exact solution is found for closed blocking networks which contain so many jobs that if one station is empty all other stations are full. Algorithms to compute performance measures, in particular throughputs, follow from the way the solution is obtained. It is then proved that for open, mixed and closed networks with rejection blocking, multiple job classes, general service time distributions and reversible routing the equilibrium state probabilities have product form. The reversed process for these networks is examined, and it is proved that it represents a network of the same type. Formulas for throughputs are derived, and algorithms to compute performance measures are outlined. Finally, closed central server models with state-dependent routing, multiple job classes and rejection blocking are investigated. The equilibrium state probabilities have a modified product form, and the reversed process is a network of the same type. Formulas for performance measures are derived for this model and algorithms to compute them are outlined
Analysis of State-Independent Importance-Sampling Measures for the Two-Node Tandem Queue
We investigate the simulation of overflow of the total population of a Markovian two-node tandem queue model during a busy cycle, using importance sampling with a state-independent change of measure. We show that the only such change of measure that may possibly result in asymptotically efficient simulation for large overflow levels is exchanging the arrival rate with the smallest service rate. For this change of measure, we classify the model's parameter space into regions of asymptotic efficiency, exponential growth of the relative error, and infinite variance, using both analytical and numerical techniques
Recommended from our members
Decomposition of general queueing network models. An investigation into the implementation of hierarchical decomposition schemes of general closed queueing network models using the principle of minimum relative entropy subject to fully decomposable constraints.
Decomposition methods based on the hierarchical partitioning of
the state space of queueing network models offer powerful evaluation
tools for the performance analysis of computer systems and
communication networks. These methods being conventionally
implemented capture the exact solution of separable queueing network
models but their credibility differs when applied to general queueing
networks. This thesis provides a universal information theoretic
framework for the implementation of hierarchical decomposition
schemes, based on the principle of minimum relative entropy given
fully decomposable subset and aggregate utilization, mean queue
length and flow-balance constraints. This principle is used, in
conjuction with asymptotic connections to infinite capacity queues,
to derive new closed form approximations for the conditional and
marginal state probabilities of general queueing network models. The
minimum relative entropy solutions are implemented iteratively at
each decomposition level involving the generalized exponential (GE)
distributional model in approximating the general service and
asymptotic flow processes in the network. It is shown that the
minimum relative entropy joint state probability, subject to mean
queue length and flow-balance constraints, is identical to the exact
product-form solution obtained as if the network was separable. An
investigation into the effect of different couplings of the resource
units on the relative accuracy of the approximation is carried out,
based on an extensive experimentation. The credibility of the method
is demonstrated with some illustrative examples involving
first-come-first-served general queueing networks with single and
multiple servers and favourable comparisons against exact solutions
and other approximations are made
Recommended from our members
Resource allocation in large-scale multi-server systems
textThe focus of this dissertation is the task of resource allocation in multi- server systems arising from two applications ā multi-channel wireless com- munication networks and large-scale content delivery networks. The unifying theme behind all the problems studied in this dissertation is the large-scale nature of the underlying networks, which necessitate the design of algorithms which are simple/greedy and therefore scalable, and yet, have good perfor- mance guarantees. For the multi-channel multi-hop wireless communication networks we consider, the goal is to design scalable routing and scheduling policies which stabilize the system and perform well from a queue-length and end-to-end delay perspective. We first focus on relay assisted downlink networks where it is well understood that the BackPressure algorithm is stabilizing, but, its delay performance can be poor. We propose an alternative algorithm - an iterative MaxWeight algorithm and show that it stabilizes the system and outperforms the BackPressure algorithm. Next, we focus on wireless networks which serve mobile users via a wide-area base-station and multiple densely deployed short- range access nodes (e.g., small cells). We show that traditional algorithms that forward each packet at most once, either to a single access node or a mobile user, do not have good delay performance and propose an algorithm (a distributed scheduler - DIST) and show that it can stabilize the system and performs well from a queue-length/delay perspective. In content delivery networks, each arriving job can only be served by servers storing the requested content piece. Motivated by this, we consider two settings. In the first setting, each job, on arrival, reveals a deadline and a subset of servers that can serve it and the goal is to maximize the fraction of jobs that are served before their deadlines. We propose an online load balanc- ing algorithm which uses correlated randomness and prove its optimality. In the second setting, we study content placement in a content delivery network where a large number of servers, serve a correspondingly large volume of con- tent requests arriving according to an unknown stochastic process. The main takeaway from our results for this setting is that separating the estimation of demands and the subsequent use of the estimations to design optimal content placement policies (learn-and-optimize approach) is suboptimal. In addition, we study two simple adaptive content replication policies and show that they outperform all learning-based static storage policies.Electrical and Computer Engineerin
Performance analysis of networks on chips
Modules on a chip (such as processors and memories) are traditionally connected through a single link, called a bus. As chips become more complex and the number of modules on a chip increases, this connection method becomes inefficient because the bus can only be used by one module at a time. Networks on chips are an emerging technology for the connection of on-chip modules. In networks on chips, switches are used to transmit data from one module to another, which entails that multiple links can be used simultaneously so that communication is more efficient. Switches consist of a number of input ports to which data arrives and output ports from which data leaves. If data at multiple input ports has to be transmitted to the same output port, only one input port may actually transmit its data, which may lead to congestion. Queueing theory deals with the analysis of congestion phenomena caused by competition for service facilities with scarce resources. Such phenomena occur, for example, in traffic intersections, manufacturing systems, and communication networks like networks on chips. These congestion phenomena are typically analysed using stochastic models, which capture the uncertain and unpredictable nature of processes leading to congestion (such as irregular car arrivals to a traffic intersection). Stochastic models are useful tools for the analysis of networks on chips as well, due to the complexity of data traffic on these networks. In this thesis, we therefore study queueing models aimed at networks on chips. The thesis is centred around two key models: A model of a switch in isolation, the so-called single-switch model, and a model of a network of switches where all traffic has the same destination, the so-called network of polling stations. For both models we are interested in the throughput (the amount of data transmitted per time unit) and the mean delay (the time it takes data to travel across the network). Single-switch models are often studied under the assumption that the number of ports tends to infinity and that traffic is uniform (i.e., on average equally many packets arrive to all buffers, and all possible destinations are equally likely). In networks on chips, however, the number of buffers is typically small. We introduce a new approximation specifically aimed at small switches with (memoryless) Bernoulli arrivals. We show that, for such switches, this approximation is more accurate than currently known approximations. As traffic in networks on chips is usually non-uniform, we also extend our approximation to non-uniform switches. The key difference between uniform and nonuniform switches is that in non-uniform switches, all queues have a different maximum throughput. We obtain a very accurate approximation of this throughput, which allows us to extend the mean delay approximation. The extended approximation is derived for Bernoulli arrivals and correlated arrival processes. Its accuracy is verified through a comparison with simulation results. The second key model is that of concentrating tree networks of polling stations (polling stations are essentially switches where all traffic has the same output port as destination). Single polling stations have been studied extensively in literature, but only few attempts have been made to analyse networks of polling stations. We establish a reduction theorem that states that networks of polling stations can be reduced to single polling stations while preserving some information on mean waiting times. This reduction theorem holds under the assumption that the last node of the network uses a so-called HoL-based service discipline, which means that the choice to transmit data from a certain buffer may only depend on which buffers are empty, but not on the amount of data in the buffers. The reduction theorem is a key tool for the analysis of networks of polling stations. In addition to this, mean waiting times in single polling stations have to be calculated, either exactly or approximately. To this end, known results can be used, but we also devise a new single-station approximation that can be used for a large subclass of HoL-based service disciplines. Finally, networks on chips typically implement flow control, which is a mechanism that limits the amount of data in the network from one source. We analyse the division of throughput over several sources in a network of polling stations with flow control. Our results indicate that the throughput in such a network is determined by an interaction between buffer sizes, flow control limits, and service disciplines. This interaction is studied in more detail by means of a numerical analysis
- ā¦