✦ LIBER ✦

Large Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers

✍ Scribed by J.-F. Dantzer; I. Mitrani; Ph. Robert

Book ID: 110295177
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 147 KB
Volume: 38
Category: Article
ISSN: 0257-0130
DOI: 10.1023/a:1010807811172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heavy-traffic asymptotics for the single

Heavy-traffic asymptotics for the single-server queue with random order of service

✍ Bert Zwart 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider the GI/GI/1 queue with customers served in random order, and derive the heavy-traffic limit of the waitingtime distribution. Our proof is probabilistic, requires no finite-variance assumptions, and makes the intuition provided by Kingman (Math. Oper. Res. 7 (1982) 262) rigorous.

Heavy Traffic Asymptotics for a Gated, I

Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times

✍ Tan, Xiaoming; Knessl, Charles 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 926 KB

Optimal NT policies for M/G/1 system wit

Optimal NT policies for M/G/1 system with a startup and unreliable server

✍ Jau-Chuan Ke 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Comparative analysis for theNpolicy M/G/

Comparative analysis for theNpolicy M/G/1 queueing system with a removable and unreliable server

✍ Kuo-Hsiung Wang; Li-Ping Wang; Jau-Chuan Ke; Gang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 294 KB

Parallelized Particle and Gaussian Sum P

Parallelized Particle and Gaussian Sum Particle Filters for Large-Scale Freeway Traffic Systems

✍ Mihaylova, L.; Hegyi, A.; Gning, A.; Boel, R.K. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 848 KB

Modified T vacation policy for an M/G/1

Modified T vacation policy for an M/G/1 queueing system with an unreliable server and startup

✍ Jau-Chuan Ke 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 645 KB

This paper studies the vacation policy of an M/G/1 queueing system with an unreliable server and startup. After all the customers are served in the queue exhaustively, the server deactivates and takes at most J vacations of constant time length T repeatedly until at least one customer is found waiti