The buffered fat tree switch for ATM networks
The development of ATM (Asynchronous Transfer Mode) switches is one of the main tasks required to implement B-ISDN (Broadband Integrated Services Data Networks). This thesis proposes a general class of scalable ATM switches based on buffered tree structures. A distinguishing feature of the propos...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/8100 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-8100 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-81002018-01-05T17:34:02Z The buffered fat tree switch for ATM networks Al-Junaidi, Husam The development of ATM (Asynchronous Transfer Mode) switches is one of the main tasks required to implement B-ISDN (Broadband Integrated Services Data Networks). This thesis proposes a general class of scalable ATM switches based on buffered tree structures. A distinguishing feature of the proposed switch is that it has been designed to handle nonuniform as well as uniform traffics robustly while fully utilizing switch resources (buffers and bandwidth). The buffer-size and bandwidth of each stage of the switch are specified by parameters which can be computed to optimize the switch with respect to cost, utilization, cell loss and total delay. The thesis also develops a discrete-time approximation model for analyzing the performance of the proposed switch. In particular, the analysis determines the influence of various design parameters on optimizing the switch performance. Similar to pure output buffered switches with fully interconnected fabrics, the BFT switch can easily achieve a throughput of 100 percent at much less complexity. Analysis show that delay and cell loss probability of the switch can be greatly enhanced by applying cut-through routing. They also show that more buffers are required by the lower stages of the switch to achieve a desired cell loss probability and this reduces coupling of input traffics. Simulation was used to further study the behavior of the buffers in the switch under uniform and bursty traffics. Keywords: ATM, switch architecture, performance analysis, tree-based switches. Applied Science, Faculty of Electrical and Computer Engineering, Department of Graduate 2009-05-23T19:29:11Z 2009-05-23T19:29:11Z 1998 1998-11 Text Thesis/Dissertation http://hdl.handle.net/2429/8100 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. 3908416 bytes application/pdf |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
The development of ATM (Asynchronous Transfer Mode) switches is one of the main
tasks required to implement B-ISDN (Broadband Integrated Services Data Networks).
This thesis proposes a general class of scalable ATM switches based on buffered tree
structures. A distinguishing feature of the proposed switch is that it has been designed to
handle nonuniform as well as uniform traffics robustly while fully utilizing switch resources
(buffers and bandwidth). The buffer-size and bandwidth of each stage of the switch are
specified by parameters which can be computed to optimize the switch with respect
to cost, utilization, cell loss and total delay. The thesis also develops a discrete-time
approximation model for analyzing the performance of the proposed switch. In particular,
the analysis determines the influence of various design parameters on optimizing the
switch performance. Similar to pure output buffered switches with fully interconnected
fabrics, the BFT switch can easily achieve a throughput of 100 percent at much less
complexity. Analysis show that delay and cell loss probability of the switch can be
greatly enhanced by applying cut-through routing. They also show that more buffers are
required by the lower stages of the switch to achieve a desired cell loss probability and
this reduces coupling of input traffics. Simulation was used to further study the behavior
of the buffers in the switch under uniform and bursty traffics.
Keywords: ATM, switch architecture, performance analysis, tree-based switches. === Applied Science, Faculty of === Electrical and Computer Engineering, Department of === Graduate |
author |
Al-Junaidi, Husam |
spellingShingle |
Al-Junaidi, Husam The buffered fat tree switch for ATM networks |
author_facet |
Al-Junaidi, Husam |
author_sort |
Al-Junaidi, Husam |
title |
The buffered fat tree switch for ATM networks |
title_short |
The buffered fat tree switch for ATM networks |
title_full |
The buffered fat tree switch for ATM networks |
title_fullStr |
The buffered fat tree switch for ATM networks |
title_full_unstemmed |
The buffered fat tree switch for ATM networks |
title_sort |
buffered fat tree switch for atm networks |
publishDate |
2009 |
url |
http://hdl.handle.net/2429/8100 |
work_keys_str_mv |
AT aljunaidihusam thebufferedfattreeswitchforatmnetworks AT aljunaidihusam bufferedfattreeswitchforatmnetworks |
_version_ |
1718587866209058816 |