In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum.
Appropriate marketing tools and techniques can provide dramatic and measurable success in achieving selling objectives.
This paper presents a numerical method for the server occupancies when there are Markov Modulated Poisson arrivals of arbitrary order at a stationary queue for which the service times are given by
This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms.
A class of Markov stochastic processes xt , suitable as models for random traffic in connecting networks with blocked calls cleared, is described and analyzed.
This paper is concerned with a bivariate Markov Process {X sub t, N sub {t}; t >= 0} with a special structure.
In this paper we analyze a model of a regular tree loss network that supports two types of calls -- unicast calls that require unit capacity on a single link, and multicast calls that require unit
A hierachical view of fault-tolerant distributed computers is presented, viewing a distributed computing system as composed of interconnected, interacting, functional modules.
In packet-switched communication networks information generation is bursty, resulting in traffic at multiplexers, switches and transmission channels which fluctuates randomly, often with a high cor
Motivated by an application in wireless random-access networks, we study a class of polling systems with Markovian routing, in which the server visits the queues in an order governed by a discrete-
