Modeling and analysis of stochastic mobile-edge computing wireless networks
To realize the vision of the Internet of Things (IoT), mobile-edge computing (MEC) has
recently emerged as a promising paradigm to meet the computation demand from mobile …
recently emerged as a promising paradigm to meet the computation demand from mobile …
Performance of discrete-time queueing systems
H Bruneel - Computers & Operations Research, 1993 - Elsevier
In this paper, a very general discrete-time queueing model with one single server and an
infinite waiting room is studied. The number of arrivals during any discrete time-unit …
infinite waiting room is studied. The number of arrivals during any discrete time-unit …
On the application of Rouché's theorem in queueing theory
The determination of the PGF of the queue length distribution often requires the zeros on
and within the unit circle of functions of the type zs-A (z), where A (z) is a PGF. We present …
and within the unit circle of functions of the type zs-A (z), where A (z) is a PGF. We present …
Analytic computation schemes for the discrete-time bulk service queue
AJEM Janssen, JSH van Leeuwaarden - Queueing systems, 2005 - Springer
In commonly used root-finding approaches for the discrete-time bulk service queue, the
stationary queue length distribution follows from the roots inside or outside the unit circle of a …
stationary queue length distribution follows from the roots inside or outside the unit circle of a …
Analysis of discrete-time multiserver queueing models with constant service times
H Bruneel, I Wuyts - Operations Research Letters, 1994 - Elsevier
A discrete-time multiserver queueing model is analyzed. The model allows for an arbitrary
number of servers, arbitrary-length constant service times, and general independent arrivals …
number of servers, arbitrary-length constant service times, and general independent arrivals …
Discrete-time queues with generally distributed service times and renewal-type server interruptions
In this contribution, we investigate a discrete-time single-server queue subjected to server
interruptions. Server interruptions are modeled as an on/off process with geometrically …
interruptions. Server interruptions are modeled as an on/off process with geometrically …
Modeling and analysis for cache-enabled networks with dynamic traffic
Instead of assuming fully loaded cells in the analysis on cache-enabled networks with tools
of stochastic geometry, we focus on the dynamic traffic in this letter. With modeling traffic …
of stochastic geometry, we focus on the dynamic traffic in this letter. With modeling traffic …
[HTML][HTML] Discrete-time queueing systems with Markovian preemptive vacations
In this contribution we investigate discrete-time queueing systems with vacations. A
framework is constructed that allows for studying numerous different vacation systems …
framework is constructed that allows for studying numerous different vacation systems …
Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers
K Laevens, H Bruneel - European Journal of Operational Research, 1995 - Elsevier
This paper analyzes the performance of discrete-time multiserver queues, subjected to
random server interruptions. The arrival process is general independent. The numbers of …
random server interruptions. The arrival process is general independent. The numbers of …
A general treatment of discrete-time buffers with one randomly interrupted output line
H Bruneel - European Journal of Operational Research, 1986 - Elsevier
A discrete-time buffer with one single output channel, synchronous transmission of
messages and an infinite waiting room is considered, where the output line is subjected to …
messages and an infinite waiting room is considered, where the output line is subjected to …