Analysis of a threshold priority queueing system with applications to ATM
A. Battou, Giang Linh Nguyen
Abstract
A. Battou, Giang Linh Nguyen
Abstract
A queueing model with two finite-size buffers, a single constant rate server using a serving strategy based on buffer thresholds is studied. Exact relationships for buffer size, overflow probabilities, and queueing delay are obtained. The queueing model is very general, and an application in ATM switching is described. The results are presented in-graphs that are useful in selecting a threshold pair that satisfies certain constraints on delay and cell loss.>
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A queueing model with two finite-size buffers, a single constant rate server using a serving strategy based on buffer thresholds is studied. Exact relationships for buffer size, overflow probabilities, and queueing delay are obtained. The queueing model is very general, and an application in ATM switching is described. The results are presented in-graphs that are useful in selecting a threshold pair that satisfies certain constraints on delay and cell loss.>
Key concepts: Queueing theory, Computer science, Queueing system, Layered queueing network, Computer network, Real-time computing, Algorithm