Some effects of nonstationarity on multiserver Markovian queueing systems
Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Mt/G/∞ queues with sinusoidal arrival rates
Management Science
The physics of the Mt/G/ ∞ symbol Queue
Operations Research
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
| Hi-index | 0.00 |
We present a cost model for splitting Internet dial-up traffic (which varies by time-of-day) between two large modem banks. One of the modem banks charges by the hour, the other charges for the peak number-in-system during the day. To study if the possible savings are enough to make the effort worthwhile, we formulate a clairvoyant ("perfect information") Integer Program that is equivalent to a network flow problem. This leads us to use a ceiling policy. In the stochastic control case, we use a Modified Offered Load (MOL) approximation to explore the properties of the system, and develop a square-root-type rule to set the ceiling in the homogeneous case. We also use simulation to determine an optimal ceiling when we cannot route individual calls precisely. We propose approximations that may be computed for any call duration distribution, and compare their answers to exact differential-equation procedures for Exponential call durations.