Tandem behavior of a telecommunication system with finite buffers and repeated calls

DOI10.1007/BF02411467zbMath0701.60089MaRDI QIDQ914266

Behnam Pourbabai

Publication date: 1990

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02411467

zbMATH Keywords

queueing network; non-renewal overflow process; telecommunication system

Mathematics Subject Classification ID

60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)

Related Items

Approximating a class of superposition processes, Tandem behavior of a telecommunication system with repeated calls. II: A general case without buffers, Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm, RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance modeling of a closed loop material handling system
• A stochastic recirculation system with random access
• A note on many-server queueing systems with ordered entry, with an application to conveyor theory
• Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
• Analysis of a G/M/K/O queueing loss system with heterogeneous servers and retrials
• Approximation of the Overflow Process from a G/M/N/K Queueing System
• Approximating the departure process from aG/G/1 loss system
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Distribution of the Interoverflow Time for the GI/G/1 Loss System
• Characterising the Finite Capacity GI/M/1 Queue with Renewal Output
• Approximate Analysis of General Queuing Networks by Decomposition