Related papers: Polling systems and multitype branching processes …
For multitype branching processes with immigration evolving in a random environment and producing a final product we find the tail distribution of the size of the final product accumulated in the system for a life period. Using this result…
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling…
This paper deals with the probabilistic behaviours of distributed systems described by a process calculus considering both probabilistic internal choices and nondeterministic external choices. For this calculus we define and study a typing…
The dynamics of diffusion in complex networks are widely studied to understand how entities, such as information, diseases, or behaviors, spread in an interconnected environment. Complex networks often present community structure, and tools…
In this paper we consider a ring of $N\ge 1$ queues served by a single server in a cyclic order. After having served a queue (according to a service discipline that may vary from queue to queue), there is a switch-over period and then the…
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority…
In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…
We study a model of a polling system, that is, a collection of $d$ queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is…
We study the asymptotic behaviour of the survival probability of a multitype branching process in random environment. The class of processes we consider here corresponds, in the one-dimensional situation, to the strongly subcritical case.…
The areas under workload process and under queuing process in a single server queue over the busy period have many applications not only in queuing theory but also in risk theory or percolation theory. We focus here on the tail behaviour of…
It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…
In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and…
We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the…
In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single server cyclically travels over the circle to serve all…
We consider the critical branching processes in correlated random environment which is positively associated and study the probability of survival up to the n-th generation. Moreover, when the environment is given by fractional Brownian…
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that…
Bio-inspired paradigms are proving to be useful in analyzing propagation and dissemination of information in networks. In this paper we explore the use of multi-type branching processes to analyse viral properties of content in a social…
We consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…
In this paper, we analyze a polling system on a circle with. Random batches of customers arrive at a circle, where each customer, independently, obtains a location according to a general distribution. A single server cyclically travels over…
Motivated by the study of the time evolution of random dynamical systems arising in a vast variety of domains --- ranging from physics to ecology ---, we establish conditions for the occurrence of a non-trivial asymptotic behaviour for…