Performance analysis of a growable architecture for broadband packet (ATM) switching

Mark J. Karol, Chih lin I

Research output: Contribution to conferencePaperpeer-review

10 Scopus citations

Abstract

The authors examine a growable architecture for broadband packet (asynchronous transfer mode) switching, consisting of a memoryless, self-routing interconnect fabric and modest-size packet switch modules, proposed by K. Y. Eng et al. (1989). They focus on the cell loss probability, because the architecture attains the best possible delay-throughput performance if the packet switch modules use output queuing. They compute an upper bound on the cell loss probability for arbitrary patterns of independent cell arrivals, possibly including isochronous circuit connections, and show that both sources of cell loss can be made negligibly small. For example, to guarantee a cell loss probability of less than 10-9, this growable architecture requires packet switch modules of dimension 47 × 16, 45 × 16, 42 × 16, and 39 × 16 for 100%, 90%, 80%, and 70% traffic loads, respectively. The analytic techniques used to bound the cell loss probabilities are applicable to other output queuing architectures.

Original languageEnglish
Pages1173-1180
Number of pages8
StatePublished - 1989
EventIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) - Dallas, TX, USA
Duration: 27 Nov 198930 Nov 1989

Conference

ConferenceIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3)
CityDallas, TX, USA
Period27/11/8930/11/89

Fingerprint

Dive into the research topics of 'Performance analysis of a growable architecture for broadband packet (ATM) switching'. Together they form a unique fingerprint.

Cite this