wireless mesh networks (WMNs) with the objective to reduce the network traffic incurred by mobility management and packet delivery is proposed. These schemes are per-user based, i.e., the optimal threshold of the forwarding chain length that minimizes the overall network traffic is dynamically determined for each individual mobile user, based on the user’s specific mobility and service patterns...

The letter M stands for memoryless, i.e. the Poisson process with exponential distribution. Other possibilities include D for deterministic inter-arrival times, and G denoting a general distribution of inter-arrival times. Therefore, the M/M/1 queueing system consists of customers arriving according to a Poisson process with rate λ, and one server with a service time per customer that is expone...

We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at the first queue. We first characterize the distribution of L(m,n) exactly for every m and n, under the assumption that the queues have unlimited buffers and th...

In this paper, we consider the following stability problem for a novel dynamical queue. Independent and identical tasks arrive for a queue at a deterministic rate. The server spends deterministic state-dependent times to service these tasks, where the server state is governed by its utilization history through a simple dynamical model. Inspired by empirical laws for human performance as a funct...

In this paper we consider a system consisting of a supplier with a single processing unit, a repair center, and a retailer with Poisson demand. We assume that the retailer applies one-for-one ordering policy with backorders for his inventory control. The retailer’s orders form a queue in the supplier processing unit. We also assume that a certain fraction of the products produced by the supplie...

Spectrum sharing between service providers improves the spectral efficiency, probability efficiency of sensing and reduces the call blockage. If the number of service providers is increased to share the spectrum, this may reduce the high traffic patterns of the calls. In this paper, we present an approach for channel availability and call arrival rate. The results are used to evaluate the proba...

We study the average Age of Information (AoI) and peak AoI (PAoI) a dual-queue status update system that monitors common stochastic process through two independent channels. Although double queue parallel transmission is instrumental in reducing AoI, out order data arrivals also imposes significant challenge to performance analysis. consider settings: M-M where service time servers exponentiall...

In this article, we consider deterministic ~both fluid and discrete! polling systems with N queues with infinite buffers and we show how to compute the best polling sequence ~minimizing the average total workload!+ With two queues, we show that the best polling sequence is always periodic when the system is stable and forms a regular sequence+ The fraction of time spent by the server in the fir...

A Petri net formalism is presented that allows for mixed discrete and continuous stochastic models. The continuous part of the models consists of uid places that are lled and emptied at random (normally distributed) rate. Fluid places can be used for continuous approximation of heavily loaded discrete places in order to avoid state space explosion as well as for the modelling of continuous syst...