18 August 1999 Approximate analysis of a shared-buffer ATM switch with a single hot-spot via input process aggregation and switch decomposition
Author Affiliations +
Abstract
A shared buffer ATM switch with a single hot-spot destination port, which is loaded with bursty input traffic, is modeled by a discrete-time queuing system. An approximation method to analyze the queuing system under consideration is developed. We first propose an efficient aggregation algorithm for superposing all the individual input processes to the switch. Then, the shared buffer space of the switching system is partitioned into two destination parts: an address queue dedicated to the hot-spot and remaining address queues having balanced traffic loading. By using an approximation method for estimating the number of nonempty queues in the remaining address queues at an arbitrary time slot, we can obtain the steady-state probability distribution of the queuing system. From the obtained steady-state probabilities, some performance measures such as cell loss probability in the shared buffer and that in the address queue dedicated to the hot-spot can be derived. To eliminate the starvation effect of buffer hogging, we propose two traffic management policies: priority access and cell dropping strategy. Numerical examples of the proposed method are given, which are compared with simulation results.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jisoo Kim, Chi-Hyuck Jun, "Approximate analysis of a shared-buffer ATM switch with a single hot-spot via input process aggregation and switch decomposition", Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); doi: 10.1117/12.360360; https://doi.org/10.1117/12.360360
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top