Related papers: On customer flows in Jackson queuing networks
We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…
We consider general large-scale service systems with multiple customer classes and multiple server (agent) pools, mean service times depend both on the customer class and server pool. It is assumed that the allowed activities (routing…
We establish sufficient conditions for the existence of moments of the steady-state queue in polling systems operating under the binomial-exhaustive policy (BEP). We assume that the server switches between the different buffers according to…
We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g.\ time zero). There is one server, and the service times are independent and exponentially distributed. The…
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 consider a line of terminals which is connected by packet erasure channels and where random linear network coding is carried out at each node prior to transmission. In particular, we address an online approach in which each terminal has…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
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…
Filtration, flow in narrow channels and traffic flow are examples of processes subject to blocking when the channel conveying the particles becomes too crowded. If the blockage is temporary, which means that after a finite time the channel…
In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…
We introduce a model for synchronizer of marked pairs, which is a node for joining results of parallel processing in two-branch fork-join queueing network. A distribution for number of jobs in the synchronizer is obtained. Calculations are…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
Many phenomena can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this difficulty, the Poisson Hypothesis regime replaces interaction…
We prove for Gibbs-Markov maps that the number of visits to a sequence of shrinking sets with bounded cylindrical lengths converges in distribution to a Poisson law. Applying to continued fractions, this result extends Doeblin's Poisson…
Multi-class queueing networks (McQNs) extend the classical concept of Jackson network by allowing jobs of different classes to visit the same server. While such a generalization seems rather natural, from a structural perspective there is a…
Consider a first-come, first-served single server queue with an initial workload $x>0$ and customers who arrive according to an inhomogeneous Poisson process with rate function $\lambda:[0,\infty)\rightarrow[0,\lambda_h ]$ for some…
We consider a system of $N$ identical server pools and a single dispatcher where tasks arrive as a Poisson process of rate $\lambda(N)$. Arriving tasks cannot be queued, and must immediately be assigned to one of the server pools to start…
Suppose customers need to choose when to arrive to a congested queue with some desired service at the end, provided by a single server that operates only during a certain time interval. We study a model where the customers incur not only…
Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling…