相关论文: Queuing Networks with Varying Topology -- A Mean-F…
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…
The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…
This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of…
Many real-world phenomena can be modelled as dynamical processes on networks, a prominent example being the spread of infectious diseases such as COVID-19. Mean-field approximations are a widely used tool to analyse such dynamical processes…
Mobile networks are intriguing in recent years due to their practical implications. Previous routing strategies for improving transport efficiency have little attention what order should the packets be forwarded, just simply used…
In this contribution, we establish a model for multichannel cognitive radio networks (CRNs) using the theory of priority queues. This model enables us to conduct a performance analysis in the most general form by the derivation of the…
The number of observable degrees of freedom is typically limited in experiments. Here, we consider discrete Markov networks in which an observer has access to a few visible transitions and the waiting times between these transitions.…
Supermarket models with different servers become a key in modeling resource management of stochastic networks, such as, computer networks, manufacturing systems and transportation networks. While these different servers always make analysis…
In the study of large scale stochastic networks with resource management, differential equations and mean-field limits are two key techniques. Recent research shows that the expected fraction vector (that is, the tailed probability vector)…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
We study the problem of assigning $K$ identical servers to a set of $N$ parallel queues in a time-slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue…
We study structural feature and evolution of the Internet at the autonomous systems level. Extracting relevant parameters for the growth dynamics of the Internet topology, we construct a toy model for the Internet evolution, which includes…
We consider a two-node tandem queueing network in which the upstream queue is GI/GI/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. To…
A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic…
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…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to- peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and…
Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…
This paper presents a comprehensive review of stochastic processes, with a particular focus on Markov chains and jump processes. The main results related to queuing systems are analyzed. Additionally, conditions that ensure the stability,…