Volume 32,
Number 1-3,
1999
- Serguei Foss, Takis Konstantopoulos:
Editorial introduction.
1-3 BibTeX
- J. G. Dai, Wanyang Dai:
A heavy traffic limit theorem for a class of open queueing networks with finite buffers.
5-40 BibTeX
- Alexander I. Sakhanenko:
Approximations of open queueing networks by reflection mappings.
41-64 BibTeX
- Rong-Rong Chen, Sean P. Meyn:
Value iteration and optimization of multiclass queueing networks.
65-97 BibTeX
- Günter Last, H. Stamer:
Recurrence and transience properties of some neural networks: an approach via fluid limit models.
99-130 BibTeX
- Serguei Foss, Artyom Kovalevskii:
A stability criterion via fluid limits and its application to a polling system.
131-168 BibTeX
- Alexandr A. Borovkov, Dmitry Korshunov, Rolf Schassberger:
Ergodicity of a polling network with an infinite number of stations.
169-193 BibTeX
- François Baccelli, Thomas Bonald:
Window flow control in FIFO networks with cross traffic.
195-231 BibTeX
- Boris Tsybakov, Nicolas D. Georganas:
Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic.
233-256 BibTeX
- Vladimir V. Kalashnikov, Gurami Tsitsiashvili:
Tails of waiting times and their bounds.
257-283 BibTeX
Volume 32,
Number 4,
1999
Copyright © Sun May 17 00:17:39 2009
by Michael Ley (ley@uni-trier.de)