نتایج جستجو برای: discrete time queue

تعداد نتایج: 2007033  

2003
Gang Uk Hwang Khosrow Sohraby

In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail...

Journal: :international journal of transportation engineereing 2014
amir reza mamdoohi mahmoud saffarzadeh siavash shojaat

existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. several researches have focused on capacity drop existence and also its estimation issues. this paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

Journal: :Sustainability 2021

The problem is the vaccination of a large number people in short time period, using minimum space and resources. tradeoff that this resources must guarantee good service for patients, represented by spent system queue. goal to develop digital twin which integrates physical virtual systems allows real-time mapping patient flow create sustainable dynamic center. Firstly, reach goal, discrete-even...

1996
Gérard Hébuterne Alain Dupuis

This paper revisits the classical model of ATM multiplexing. We exhibit an \exact" discrete-time model for the output queue of the switch, taking into account all peculiarities of the hardware functions, especially all synchronization-related features. The model however happens to present a complexity proportional to both the queue size and the number of inputs. A batch arrival model can be bui...

2003
Pierluigi San Pietro Zhe Dang

We propose a new infinite-state model, called the Multi-queue Discrete Timed Automaton MQDTA, which extends Timed Automata with queues, but only has integer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations ( of an MQDTA such that can reach through zero or more transitions) is effectively semilinear. We then prove the deci...

Journal: :Oper. Res. Lett. 2004
Bong Dae Choi Bara Kim Gang Uk Hwang Jae-Kyoon Kim

We analyze a multiserver queue with a discrete autoregressive process of order 1 (DAR(1)) as an input. DAR(1) is a good mathematical model for VBR-coded teleconference traffic. Based on matrix analytic methods and the theory of Markov regenerative processes, we obtain the stationary distributions of the system size and the waiting time of an arbitrary packet. Numerical examples illustrate the q...

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

Journal: :journal of electrical and computer engineering innovations 2014
shahram jamali neda alipasandi bita alipasandi

random early detection (red) is one of the most commonly used active queue management (aqm) algorithms that is recommended by ietf for deployment in the network. although red provides low average queuing delay and high throughput at the same time, but effectiveness of red is highly sensitive to the red parameters setting. as network condition varies largely, setting red's parameters with fixed ...

Journal: :Theor. Comput. Sci. 2003
Oscar H. Ibarra Zhe Dang Pierluigi San Pietro

We look at a model of a queue system that consists of the following components: 1. Two discrete timed automata W (the “writer”) and R (“the reader”). 2. One unrestricted queue that can be used to send messages from W to R. There is no bound on the length of the queue. W and R do not share a global clock and operate in a loosely synchronous way. That is, the absolute value of the difference betw...

This paper deals with bi-level control policy and queuing analysis of a machine repair problem. The model is developed by incorporating mixed standbys (cold and warm), reneging, set up and vacation time. The repair facility consists of two heterogeneous repairmen in the system. The life and repair time of the failed units and also their set up times are assumed to be exponentially distributed. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید