Indirect rotator graph networks and their applications for ATM switch fabrics /
The objective of this dissertation is to propose the indirect rotator graph networks, to investigate possible ATM architectures based on the indirect rotator graph networks, and to analyze the performances of these systems. Also a new cache coherence protocol based on the Scalable Tree Protocol(STP...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1996.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=743273721&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | The objective of this dissertation is to propose the indirect rotator graph networks, to investigate possible ATM architectures based on the indirect rotator graph networks, and to analyze the performances of these systems. Also a new cache coherence protocol based on the Scalable Tree Protocol(STP) will be proposed. This protocol can reduce implementation cost with respect to the STP having the same order of performance. The proposed indirect rotator graph networks can be obtained by unfolding the rotator graph. Also we will study an indirect rotator graph network which consists of (2 x 2) switches and discuss how to build a fault tolerable indirect rotator graph network. Since the rotator graphs have, a smaller diameter than the star graphs have for the same number of nodes, the indirect rotator graph network would have shorter switch stages than the indirect n-star network would have. With this advantage, we will introduce multistage interconnection networks based on indirect rotator graph networks as candidates for ATM switch fabrics. Intuitively, since the indirect rotator graph network is not conflict-free for routing, the network cannot be used for an ATM switch fabric directly. Hence, we will present various indirect rotator graph networks: networks with buffers and open-loop and closed-loop networks that are multistage self- routing unbuffered structures based on output queuing. The buffered indirect rotator graph networks can perform better than the networks without buffers. The indirect rotator graph networks based on output queuing can accomplish internal speedup. The open-loop network may need a very large number of stages to get no cell loss. The closed-loop network can be constructed with a small number of switch stages by connecting output links to appropriate input links. The cells passing the switching elements of the last stage that are not routed to the output queues will be lost in the open-loop network, whereas they will be recirculated from the outlets of the last stage to the inlets of the first stage in the closed-loop network. Finally, by evaluating performance results in terms of acceptance probability, cell loss probability, average delay, and worst case delay we will conclude that the proposed networks based on the indirect rotator graph network can be good candidates for ATM switch fabrics. |
|---|---|
| Item Description: | Vita. "Major Subject: Electrical Engineering". |
| Physical Description: | xiv, 142 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilms Inc. |
| Bibliography: | Includes bibliographical references. |