Extreme Values in Closed Networks
Predrag Jelenkovic, Petar Momcilovic

TL;DR
This paper analyzes the maximum queue length in a specific closed network model, providing explicit asymptotic characterizations and novel methods for understanding global network measures.
Contribution
It introduces a new probabilistic representation and scaling approach to characterize the maximum queue length distribution in closed product-form networks.
Findings
Derived explicit asymptotic distributions for maximum queue length.
Connected maximum queue length to independent geometric variables.
Provided a novel methodology for global network measure analysis.
Abstract
For a widely used hub-and-spoke closed product-form network consisting of an infinite-server node and several single-server queues, we characterize the maximum queue-length distribution in various operational regimes by leveraging a novel probabilistic representation of the joint queue-length distribution and scaling where the number of customers grows. In these limiting regimes, we derive explicit characterizations of the maximum that are asymptotically equivalent to the maximum of independent random variables with the same geometric marginal distribution as queue lengths. In particular, when both the number of customers and queues grow, the parameters of the marginal distribution depend on the global characteristics of the network and are explicitly computed from a quadratic equation that arises from the corresponding large-deviation rate functions. Explicit computation of global…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Complex Network Analysis Techniques · Age of Information Optimization
