Tree-Based Routing Architecture for Irregular Networks

碩士 === 國立東華大學 === 資訊工程研究所 === 85 === Irregular networks composed of switches can provide scalable bandwidth andflexible network configuration. Networks with virtual cut-through routingachieve high-performance communication in a multiprocess...

Full description

Bibliographic Details
Main Authors: Tang, Chih-Tsung, 湯智聰
Other Authors: Chi Hsin-Chou
Format: Others
Language:zh-TW
Published: 1997
Online Access:http://ndltd.ncl.edu.tw/handle/07392782436619079343
Description
Summary:碩士 === 國立東華大學 === 資訊工程研究所 === 85 === Irregular networks composed of switches can provide scalable bandwidth andflexible network configuration. Networks with virtual cut-through routingachieve high-performance communication in a multiprocessor system. We proposea thee-based routing architecture for irregular networks (TRAIN) that uses a spanning tree for the backbone of the network. Besides the tree links, ourrouting architecture uses the other available links in the network as shortcutsto maximize network performance. The TRAIN routing scheme requires no routingtable in the routing switches, and is shown to be deadlock-free. From ourperformance simulation, TRAIN provides high throughput and low latency for both regular and irregular networks. It is a deadlock-free adaptive schemewithout virtual channels and provides fault tolerance by reconfiguration.