In this work, we investigate information freshness in a status update communication system consisting of source-destination link. Initially, study the properties sample path age (AoI) process at destination. We obtain general formula stationary distribution AoI, under assumption ergodicity. relate result to discrete time queueing and provide expression generating function AoI relation with peak...

Lindén, J. 2018. Synchronization Techniques in Parallel Discrete Event Simulation. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1634. 57 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0241-6. Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the pe...

Abstract Two GI/M/1 type Markov chains associated with the queue length are often used in analyzing the discrete time MAP/PH/K queue. The first Markov chain is introduced by tracking service phases for servers; a method we call TPFS. The transition probability matrix of the Markov chain can be constructed in a straightforward manner. The second Markov chain is introduced by counting servers for...

A typical wireless network consists of closely located static nodes with one stationary base station. The base station maintains the different node activity with more energy consumption. Existing Network coding-based cooperative ARQ scheme perform the multihop transmission among a set of relay nodes. However, the impact of realistic physical layer is not considered for data transmission. In add...

It is not an easy task to write a book on queuing networks when a large number of books in the topic have already been published. The authors have written a very timely book on queuing networks which can be used by people working in the area of communication networks. The basics of stochastic process have been discussed in Chapter 1 with queuing networks being introduced in Chapter 2 where the ...

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...

This paper considers a discrete-time Geo/G/1 queue with multiple adaptive vacations and variable input rate. The main purpose of this paper is to present a queuelength analysis of this system. Using a new analytic method, the late arrival system with delayed access (LAS-DA) and the early arrival system (EAS), have been examined. For both the cases, We derive the recursive solution for queue len...