| Modeling cell departure for shared buffer ATM switch | |
| Fong S.; Singh S. | |
| 1998-12-01 | |
| Source Publication | International Conference on Communications - Proceedings |
| Volume | 3 |
| Pages | 1824-1828 |
| Abstract | The framework of the performance analysis for a buffered asynchronous transfer mode (ATM) switch usually consists of modeling the input traffic arrivals, the switching mechanism, and the cell departure process. The overall accuracy of the performance results relies on how accurately the cell departure process, especially for shared buffer switches is modelled. Unlike output buffer switches where there are at most one cell that can leave, multiple cells may depart from the shared buffer for shared buffer switches. Modeling the cell departure process is hence more complex for shared buffer switches. It is of practical interest and is challenging to find the appropriate probabilistic model to describe the cell departure process for shared buffer switches. This paper compares and verifies the accuracy of three models, including a new one called "Urn Model" proposed by the authors. These models are put under test in a performance evaluation of a shared buffer ATM switch, by using a discrete-time Markov chain. The numerical results are compared to the simulation, and they show that the Urn Model is a good compromise between accuracy and efficiency. This finding is significant because it helps to speed up running an analytical model of a large network while providing satisfactory accuracy. © 1998 IEEE. |
| DOI | 10.1109/ICC.1998.683143 |
| URL | View the original |
| Language | 英語 |
| Fulltext Access | |
| Citation statistics | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | La Trobe University |
| Recommended Citation GB/T 7714 | Fong S.,Singh S.. Modeling cell departure for shared buffer ATM switch[C],1998:1824-1828. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment