Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQueueing Systems, Volume 46
Volume 46, Number 1-2, January 2004
- Takis Konstantopoulos, Stan Zachary, Serguei Foss:
Introduction Non-conventional Queueing Models: Heavy Tails, Long-Range Dependence, and Rare Events. 5-7 - Stan Zachary:
A Note on Veraverbeke's Theorem. 9-14 - Denis Denisov
, Serguei Foss, Dima Korshunov:
Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite. 15-33 - Onno J. Boxma, Serguei Foss, Jean-Marc Lasgouttes, R. Núñez Queija:
Waiting Time Asymptotics in the Single Server Queue with Service in Random Order. 35-73 - François Baccelli, Marc Lelarge, Serguei Foss:
Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case. 75-96 - Predrag R. Jelenkovic, Petar Momcilovic, Bert Zwart:
Reduced Load Equivalence under Subexponentiality. 97-112 - Krzysztof Debicki, Michel Mandjes:
Traffic with an fBm Limit: Convergence of the Stationary Workload Process. 113-127 - Ozcan Ozturk, Ravi Mazumdar, Nikolay B. Likhanov:
Many Sources Asymptotics for Networks with Small Buffers. 129-147 - Hanspeter Schmidli:
Asymptotics of Ruin Probabilities for Risk Processes under Optimal Reinsurance and Investment Policies: The Large Claim Case. 149-157 - Rami Atar, Adam Shwartz, Paul Dupuis:
Explicit Solution for a Network Control Problem in the Large Deviation Regime. 159-176 - Masakiyo Miyazawa:
A Markov Renewal Approach to M/G/1 Type Queues with Countably Many Background States. 177-196 - Yuri M. Suhov, Utkir A. Rozikov:
A Hard-Core Model on a Cayley Tree: An Example of a Loss Network. 197-212
Volume 46, Number 3-4, March 2004
- Evsey Morozov, Richard F. Serfozo:
Introduction: Vladimir Kalashnikov 1942-2001. 223-228 - Dieter Baum:
Some Personal Words. 229-229 - Dieter Baum, Vladimir V. Kalashnikov:
Spatial No-Waiting Stations with Moving Customers. 231-247 - Søren Asmussen, Mats Pihlsgård:
Transient Properties of Many-Server Queues and Related QBDs. 249-270 - Peter W. Glynn, Hermann Thorisson:
Limit Theory for Taboo-Regenerative Processes. 271-294 - Evsey Morozov:
Weak Regeneration in Modeling of Queueing Processes. 295-315 - Dirk P. Kroese, Reuven Y. Rubinstein:
The Transform Likelihood Ratio Method for Rare Event Simulation with Heavy Tails. 317-351 - Vyacheslav M. Abramov, Robert Sh. Liptser:
On Existence of Limiting Distribution for Time-Nonhomogeneous Countable Markov Process. 353-361 - Boris L. Granovsky, Alexander I. Zeifman:
Nonstationary Queues: Estimation of the Rate of Convergence. 363-388 - Vladimir Rykov, Dimitri Efrosinin:
Optimal Control of Queueing Systems with Heterogeneous Servers. 389-407 - Takis Konstantopoulos, Günter Last, Si-Jian Lin:
On a Class of Lévy Stochastic Networks. 409-437 - Bárbara González-Arévalo:
Performance of a Leaky Bucket System with Long-Range Dependent Input Traffic. 439-459 - V. Venugopal Reddy, Vinod Sharma, M. B. Suma:
Providing QoS to TCP and Real Time Connections in the Internet. 461-480 - David L. Jagerman, Baris Balcioglu, Tayfur Altiok, Benjamin Melamed:
Mean Waiting Time Approximations in the G/G/1 Queue. 481-506 - Ward Whitt:
Heavy-Traffic Limits for Loss Proportions in Single-Server Queues. 507-536 - René Bekker, Sem C. Borst, Onno J. Boxma, Offer Kella:
Queues with Workload-Dependent Arrival and Service Rates. 537-556 - Petteri Mannersalo, Ilkka Norros, Paavo Salminen:
A Storage Process with Local Time Input. 557-577
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
