In this paper, we study an input queueing asynchronous transfer mode (ATM) switch with the preemptive priority scheme. Up to now, many researchers have studied this switch, but their models do not yield accurate results. Therefore, we propose another model and analyze the performance of the switch for two different arrival processes, that is, the independent priority arrival process (IPAP) and the dependent priority arrival process (DPAP). In this paper, we model a virtual head of line (HOL) queue like the previous works, and analyze it using a three-dimensional Markov chain. As for each input queue, we model it as a two-class Geomx/Geom/1 queue with preemptive priority. By using this model, we obtain the mean queueing delay of the low priority class and the maximum throughput of the switch. In case of the IPAP, we compare our result with simulation and those of the previous works to show that our model yields more accurate results. In addition, we compare the performances of those two arrival processes to illustrate their difference.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications