Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

scholarly journals Parametric analysis of the Bass model

2016 ◽  
Vol 12 (1) ◽  
pp. 29-40
Author(s):  
Yair Orbach
Keyword(s):  
Euclidean Space ◽  
Discrete Time ◽  
Continuous Time ◽  
Parametric Analysis ◽  
Inflection Point ◽  
Bass Model ◽  
Long Run ◽  
The Common ◽  
Special Case ◽  
Q Values

In this research, the authors explore the influence of the Bass model p, q parameters values on diffusion patterns and map p, q Euclidean space regions accordingly. The boundaries of four different sub-regions are classified and defined, in the region where both p, q are positive, according to the number of inflection point and peak of the non-cumulative sales curve. The researchers extend the p, q range beyond the common positive value restriction to regions where either p or q is negative. The case of negative p, which represents barriers to initial adoption, leads us to redefine the motivation for seeding, where seeding is essential to start the market rather than just for accelerating the diffusion. The case of negative q, caused by a declining motivation to adopt as the number of adopters increases, leads us to cases where the saturation of the market is at partial coverage rather than the usual full coverage at the long run. The authors develop a solution to the special case of p + q = 0, where the Bass solution cannot be used. Some differences are highlighted between the discrete time and continuous time flavors of the Bass model and the implication on the mapping. The distortion is presented, caused by the transition between continuous and discrete time forms, as a function of p, q values in the various regions

A DISCRETE-TIME Geo/G/1 RETRIAL QUEUE WITH SERVER BREAKDOWNS

2006 ◽  
Vol 23 (02) ◽  
pp. 247-271 ◽  
Author(s):  
IVAN ATENCIA ◽  
PILAR MORENO
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Discrete Time ◽  
Continuous Time ◽  
Queueing System ◽  
Retrial Queue ◽  
System Size ◽  
Stochastic Decomposition ◽  
Recursive Procedure ◽  
Server Breakdown

This paper discusses a discrete-time Geo/G/1 retrial queue with the server subject to breakdowns and repairs. The customer just being served before server breakdown completes his remaining service when the server is fixed. The server lifetimes are assumed to be geometrical and the server repair times are arbitrarily distributed. We study the Markov chain underlying the considered queueing system and present its stability condition as well as some performance measures of the system in steady-state. Then, we derive a stochastic decomposition law and as an application we give bounds for the proximity between the steady-state distributions of our system and the corresponding system without retrials. Also, we introduce the concept of generalized service time and develop a recursive procedure to obtain the steady-state distributions of the orbit and system size. Finally, we prove the convergence to the continuous-time counterpart and show some numerical results.

A Discrete-Time Queueing Model with Service Upgrade

2014 ◽  
Vol 513-517 ◽  
pp. 806-811
Author(s):  
Ivan Atencia ◽  
Inmaculada Fortes ◽  
Sixto Sánchez
Keyword(s):  
Discrete Time ◽  
Generating Functions ◽  
Busy Period ◽  
Queueing System ◽  
Queueing Model ◽  
Numerical Examples ◽  
Extensive Analysis ◽  
Number Of Customers ◽  
Incoming Message

In this paper we analyze a discrete-time queueing system where the server decides whento upgrade the service depending on the information carried by the incoming message. We carry outan extensive analysis of the system developing recursive formulae and generating functions for thestationary distribution of the number of customers in the queue, the system, the busy period and thesojourntimeas well as some numerical examples.

scholarly journals Selective Trunk with Multiserver Reservation

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Bacel Maddah ◽  
Muhammad El-Taha
Keyword(s):  
Communication Networks ◽  
Performance Measures ◽  
Traffic Control ◽  
Queueing System ◽  
Computational Scheme ◽  
Service Rate ◽  
Queueing Model ◽  
Bed Allocation ◽  
Special Case ◽  
Joint Probabilities

We consider a queueing model that is primarily applicable to traffic control in communication networks that use the Selective Trunk Reservation technique. Specifically, consider two traffic streams competing for service at ann-server queueing system. Jobs from theprotectedstream, stream 1, are blocked only if allnservers are busy. Jobs from thebest effortstream, stream 2, are blocked ifn-r,  r≥1, servers are busy. Blocked jobs are diverted to a secondary group ofc-nservers with, possibly, a different service rate. We extend the literature that studied this system for the special case ofr=1and present an explicit computational scheme to calculate the joint probabilities of the number of primary and secondary busy servers and related performance measures. We also argue that the model can be useful for bed allocation in a hospital.

scholarly journals A discrete-time system with service control and repairs

2014 ◽  
Vol 24 (3) ◽  
pp. 471-484 ◽  
Author(s):  
Ivan Atencia
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Generating Functions ◽  
Continuous Time ◽  
Queueing System ◽  
Discrete Time System ◽  
Time System ◽  
The Third ◽  
Special Cases ◽  
Number Of Customers

Abstract This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system

Design of Programmable Wideband Low Pass Filter with Continuous-Time/Discrete-Time Hybrid Architecture

2017 ◽  
Vol E100.C (10) ◽  
pp. 858-865 ◽  
Author(s):  
Yohei MORISHITA ◽  
Koichi MIZUNO ◽  
Junji SATO ◽  
Koji TAKINAMI ◽  
Kazuaki TAKAHASHI
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Hybrid Architecture ◽  
Pass Filter ◽  
Low Pass Filter ◽  
Low Pass
Sign in / Sign up

Export Citation Format

Share Document