This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both clas...

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Juha-Matti Kuusinen Name of the doctoral dissertation People Flow in Buildings – Evacuation Experiments and Modelling of Elevator Passenger Traffic Publisher School of Science Unit Department of Mathematics and Systems Analysis Series Aalto University publication series DOCTORAL DISSERTATIONS 47/2015 Field of research Systems ...

We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...

We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the tran...

In this paper we develop an analytical expression for the mobile station transmit power based on a discrete time and state space. In our model we focus on the time-varying distortions found in a CDMA reverse link channel, network delays, and the uctuations in multi-access interference. Based on this description we are able to characterize the dynamic behavior of the power control loop and its r...

Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a powerful and versatile tool for system performance evaluation and prediction. Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorit...

In this paper we develop an analytical expression for the mobile station transmit power based on a discrete time and state space. In our model we focus on the timevarying distortions found in a CDMA reverse link channel, network delays, and the fluctuations in multi-access interference. Based on this description we are able to characterize the dynamic behavior of the power control loop and its ...

We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...