16,704 research outputs found
Multiserver queue with semi-Markovian batch arrivals with application to the MPEG frame sequence
We consider a queueing system consisting of multiple identical servers and a common queue. The service time follows an exponential distribution and the arrival process is governed by a semi-Markov process (SMP). The motivation to study the queueing system with SMP arrivals lies in that it can model the auto-correlatedtraffic on the high speed network generated by a real time communication, for example, the MPEG-encoded VBR video. Our analysis is based on the theory of piecewise Markov process. We first derive the distributions of the queue size andthe waiting time. The stability condition of the system is also discussed. When the sojourn time of SMP follows an exponential distribution all the unknown constants contained in the generating function of queue size can be determined through the zeros of the denominator for this generating function. Based on the result of the analysis, we propose a model to evaluate the waiting time of MPEG video trafficon an ATM network with multiple channels. Here, the SMP corresponds to the exact MPEG sequence of frames. Finally, a numerical example using a real video data is shown.Includes bibliographical reference
Cost minimization for unstable concurrent products in multi-stage production line using queueing analysis
This research and resulting contribution are results of Assumption University of Thailand. The university partially supports financially the publication.Purpose: The paper copes with the queueing theory for evaluating a muti-stage production line process with concurrent goods. The intention of this article is to evaluate the efficiency of products assembly in the production line. Design/Methodology/Approach: To elevate the efficiency of the assembly line it is required to control the performance of individual stations. The arrival process of concurrent products is piled up before flowing to each station. All experiments are based on queueing network analysis. Findings: The performance analysis for unstable concurrent sub-items in the production line is discussed. The proposed analysis is based on the improvement of the total sub-production time by lessening the queue time in each station. Practical implications: The collected data are number of workers, incoming and outgoing sub-products, throughput rate, and individual station processing time. The front loading place unpacks product items into concurrent sub-items by an operator and automatically sorts them by RFID tag or bar code identifiers. Experiments of the work based on simulation are compared and validated with results from real approximation. Originality/Value: It is an alternative improvement to increase the efficiency of the operation in each station with minimum costs.peer-reviewe
Large closed queueing networks in semi-Markov environment and its application
The paper studies closed queueing networks containing a server station and
client stations. The server station is an infinite server queueing system,
and client stations are single-server queueing systems with autonomous service,
i.e. every client station serves customers (units) only at random instants
generated by a strictly stationary and ergodic sequence of random variables.
The total number of units in the network is . The expected times between
departures in client stations are . After a service completion
in the server station, a unit is transmitted to the th client station with
probability , and being processed in the th client
station, the unit returns to the server station. The network is assumed to be
in a semi-Markov environment. A semi-Markov environment is defined by a finite
or countable infinite Markov chain and by sequences of independent and
identically distributed random variables. Then the routing probabilities
and transmission rates (which are expressed via
parameters of the network) depend on a Markov state of the environment. The
paper studies the queue-length processes in client stations of this network and
is aimed to the analysis of performance measures associated with this network.
The questions risen in this paper have immediate relation to quality control of
complex telecommunication networks, and the obtained results are expected to
lead to the solutions to many practical problems of this area of research.Comment: 35 pages, 1 figure, 12pt, accepted: Acta Appl. Mat
Computationally Efficient Simulation of Queues: The R Package queuecomputer
Large networks of queueing systems model important real-world systems such as
MapReduce clusters, web-servers, hospitals, call centers and airport passenger
terminals. To model such systems accurately, we must infer queueing parameters
from data. Unfortunately, for many queueing networks there is no clear way to
proceed with parameter inference from data. Approximate Bayesian computation
could offer a straightforward way to infer parameters for such networks if we
could simulate data quickly enough.
We present a computationally efficient method for simulating from a very
general set of queueing networks with the R package queuecomputer. Remarkable
speedups of more than 2 orders of magnitude are observed relative to the
popular DES packages simmer and simpy. We replicate output from these packages
to validate the package.
The package is modular and integrates well with the popular R package dplyr.
Complex queueing networks with tandem, parallel and fork/join topologies can
easily be built with these two packages together. We show how to use this
package with two examples: a call center and an airport terminal.Comment: Updated for queuecomputer_0.8.
Breaking the Legend: Maxmin Fairness notion is no longer effective
In this paper we analytically propose an alternative approach to achieve
better fairness in scheduling mechanisms which could provide better quality of
service particularly for real time application. Our proposal oppose the
allocation of the bandwidth which adopted by all previous scheduling mechanism.
It rather adopt the opposition approach be proposing the notion of
Maxmin-charge which fairly distribute the congestion. Furthermore, analytical
proposition of novel mechanism named as Just Queueing is been demonstrated.Comment: 8 Page
Recommended from our members
Traffic signal control using queueing theory
Traffic signal control has drawn considerable attention in the literatures thanks to its ability to improve the mobility of urban networks. Queueing models are capable of capturing performance or effectiveness of a queueing system. In this report, SOCPs (second order cone program) are proposed based on different queueing models as pre-timed signal control techniques to minimize total travel delay. Stochastic programs are developed in order to handle the uncertainties in the arrival rates. In addition, the superiority of the proposed model over Webster’s model has been validated in a microscopic traffic simulation software named CORSIM.Statistic
- …