We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a...

In this paper we consider a Jackson type queueing network with unreliable nodes. The network consists of m ∞ nodes, each node is a queueing system of M/G/1 type. The input flow is assumed to be the Poisson process with parameter Λ(t). The routing matrix {r_ij} is given, i, j=0,1,...,m,...

We consider a queueing system that is comprised of multiple stations serving a single class of customers. Each station consists of many statistically identical servers, and has its own dedicated queue. In this paper, we propose a family of generalized load-balancing routing policies...