Search

Inthispaper,westudytheso-called N-modelwhich consists of two pools of servers. Pool 1 contains N1 servers while pool 2 consists of one server, which can be inactive time to time. The 1st pool is fed by a Poisson input of the 1st class customers. Provided all servers of pool 1 are busy and the queue size exceeds a given threshold, a class-1 customer, with a given probability, jumps to server of pool 2, if this server is active. Under exponential assumptions, the number of customers in the 1st pool is a Markov birth-death process. The periods of activity/inactivity constitute initially a transient process which converges to a stationary regime. In this research we deduce stationary distribution of this Markov process in an explicit form. Moreover, we nd conditions when the mentioned convergence of the alternating process of activity/inactivity of the server in the 2nd pool implies convergence of the birth-death process, describing the 1st pool, to stationary regime. Moreover, this convergence is demonstrated by simulation.

The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.

The work studies a general multiserver queue in which the service time of an arriving customer and the next interarrival period may depend on both the current waiting time and the server assigned to the arriving customer. Stability of the system is proved under general assumptions on the predetermined distributions describing the model. The proof exploits a combination of the Markov property of the workload process with a regenerative property of the process. The key idea leading to stability is a characterization of the limit behavior of the forward renewal process generated by regenerations. Extensions of the basic model are also studied.

We study the stability of a single-server retrial queueing system with constant retrial rate and general input and service processes. In such system the external (primary) arrivals follow a renewal input with rate $\lambda$. The system also has service times with rate $\mu$. If a new customer finds all servers busy and the buffer full, it joins an infinite-capacity virtual buffer (or \textit{orbit}). An orbital (secondary) customer attempts to rejoin the primary queue after an exponentially distributed time with rate $\mu_0$.

Vegeu el resum a l'inici del document de l'arxiu adjunt

The work studies a general multiserver queue in which the service time of an arriving customer and the next interarrival period may depend on both the current waiting time and the server assigned to the arriving customer. Stability of the system is proved under general assumptions on the predetermined distributions describing the model. The proof exploits a combination of the Markov property of the workload process with a regenerative property of the process. The key idea leading to stability is a characterization of the limit behavior of the forward renewal process generated by regenerations. Extensions of the basic model are also studied.

The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.