Effectiveness of aggregation and truncation for nonstationary arrivals

Determine whether an approach based on aggregating the infinite-server system and applying truncation can effectively approximate the blocking probability for loss queues with nonstationary arrivals.

Background

The paper analyzes Erlang loss systems with energy-constrained servers and derives blocking probabilities by interpreting the corresponding infinite-server model as a Jackson network, then applying a truncation argument. In the conclusion, the authors identify nonstationary arrivals as an extension beyond the settings treated in the paper. They specifically conjecture that the same aggregate-and-truncate methodology may remain effective for approximating blocking probabilities when arrivals are nonstationary.