We consider Kelly networks with shuffling of customers within each queue. Specifically, each arrival, departure or movement of customer from one queue to another triggers a shuffl...
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
-- We present a new class of finite queues in cyclic networks with production blocking. We show that with a threshold property related to the number of customers in the network, th...
Abstract. Consider a Markovian Petri net with race policy. The marking process has a "product form" stationary distribution if the probability of viewing a given marking ...