Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Hi-index | 0.00 |
In this paper, we present an efficient and effective method to derive the worst case end-to-end delay for ATM network. Traffic and service description plays an important part in the end-to-end delay analysis. By utilizing the inverse of these arrival and service functions, we can effectively compute the worst case delay of an ATM switch. We analyze and compare the performance of an ATM switch with priority driven and FIFO scheduling policies using different workload sets and under different utilization. We also compare the performance using our proposed “integrated” method with the traditional “independent” method. From our simulation experiments, we found out that our method always produced a better estimation of cell delay within an ATM network.