![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Reduced Load Equivalence under Subexponentiality
The stationary workload W A+B φ of a queue with capacity φ loaded by two independent processes A and B is investigated. When the probability of load deviation...
-
Article
Heavy Traffic Limits for Queues with Many Deterministic Servers
Consider a sequence of stationary GI/D/Nqueues indexed by N↑∞, with servers' utilization \(1 - \beta /\sqrt N ,\beta >0\) ...
-
Chapter and Conference Paper
DNA-Based Computation Times
Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such devices approaches physical limits, new ...
-
Article
Linear loss networks
This paper investigates theoretical properties of throughput and cost in linear loss networks. The maximum throughput of the network with exponential service times is derived and the arrival process that maxim...
-
Article
On the departure process of the linear loss network
This paper considers a \(k\) k -node linear loss network consisting of buff...
-
Article
Personalized queues: the customer view, via a fluid model of serving least-patient first
In personalized queues, information at the level of individuals—customers or servers—affects system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by ...
-
Article
Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
In this paper, we develop time-varying fluid models for tandem networks with blocking. Beyond having their own intrinsic value, these mathematical models are also limits of corresponding many-server stochastic...
-
Article
QED limits for many-server systems under a priority policy
A multi-class many-server priority system operating in the quality-and-efficiency-driven regime is considered. Both arrival processes and service times are general. The many-server heavy-traffic diffusion asym...
-
Article
Scaling regimes of growth networks
-
Article
Appointment-driven service systems with many servers