MAXIMUM BLOCKING PROBABILITY IN GI/GI/cc SYSTEMS WITH BURSTY ARRIVALS

DOI10.17654/AM101010053zbMath1430.90205WikidataQ128327838 ScholiaQ128327838MaRDI QIDQ5215101

Fumiaki Machihara, Taro Tokuda

Publication date: 6 February 2020

Published in: Far East Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

completely monotoneheavy tailblocking probabilityparadoxical behaviorbursty\(GI/GI/\infty\)\(GI/GI/c/c\)generalized Erlangstochastically more (less) variableasymmetric hyper-exponentialeffect of service time variation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chain models - rarity and exponentiality
• PHASE-TYPE COMPLETELY MONOTONIC ARRIVALS CAUSE PARADOXICAL BEHAVIOR
• AN INFINITELY-MANY SERVER QUEUE HAVING MARKOV RENEWAL ARRIVALS AND HYPEREXPONENTIAL SERVICE TIMES
• DOES THE MORE VARIABLE INTER-ARRIVAL TIME INCREASE THE CONGESTION IN THE INFINITELY MANY SERVERS SYSTEM AND THE LOSS SYSTEM?
• DEPARTURE PROCESSES FROM GI/GI/\infty AND GI/GI/c/c WITH SMOOTHED ARRIVALS

This page was built for publication: MAXIMUM BLOCKING PROBABILITY IN GI/GI/cc SYSTEMS WITH BURSTY ARRIVALS