Answers are grounded in this paper and cite their sources.
Motivated by the modeling of customer mobility and congestion in supermarkets, we study queueing networks with a single source and a single sink. We assume that walkers traverse a network according to an unbiased random walk, and we analyze how network topology affects the total mean queue size [Formula: see text], which we use to measure congestion. We examine network topologies that minimize [Formula: see text] and provide proofs of optimality for some cases and numerical evidence of optimality for others. Finally, we present greedy algorithms that add edges to and delete edges from a network to reduce [Formula: see text], and we apply these algorithms to a network that we construct using a supermarket store layout. We find that these greedy algorithms, which typically tend to add edges to the sink node, are able to significantly reduce [Formula: see text]. Our work helps improve understanding of how to design networks with low congestion and how to amend networks to reduce congestion.
No takes yet. Share an insight, caveat, or question.
Ying et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: