• Title/Summary/Keyword: Multistage Interconnection Networks

Search Result 45, Processing Time 0.022 seconds

Design and performance analysis of fault tolerant multistage interconnection network with destination tag algorithm (목적지 태그 라우팅 알고리즘을 사용하는 결함허용 다단계 상호연결망의 설계 및 성능분석)

  • 정종인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1137-1147
    • /
    • 1997
  • I propose a RZETA network consisted of switching elements(SEs) that have regular links and alternate links. A modified Zeta nework used for the RZETA network's regular links and a MIN used for its alternate links are generated using the graph theory. The RZETA network is driven from merging the formaer and latter MINs. A necessary and sufficient condition for modified Zeta network to be a nonblocking network is also presented. This condition is a ufficient condition for RZETA network with a faulty link or a faulty SE to be nonblocked. Performance of the RZETA network is analyzed by modification of the model of 2-dilated Banyan network and its performance is compared with existing redundant path networks, when packet arrival rate of each source is 1.

  • PDF

A Study on the Simulation Algorithm of the Multistage Interconnection Networks (다단상호 접속망의 Simulation Algorithm 개발에 관한 연구)

  • Lee, Eun-Seol;Kim, Dae-Ho;Lim, Chae-Tak
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.5
    • /
    • pp.71-78
    • /
    • 1989
  • To estimate a performance of MIM's a network modeling method and a simulation algorithm are proposed, and this algorithm is programmed by C language. Especially, state variables are defined to process many concurrent requests ar inputs and a data structure, which contains network informations, is proposed to keep track of each stage. This simulation can be applied to computers which are designed for sequential processing. This method can be used to estimate a performance of MIN's instead of using complex mathematical method.

  • PDF

Fault-Tolerant Multicasting in MIN-based Multicomputers using Cube Encoding Scheme (큐브 부호화 방식을 사용하는 다단계 상호연결망 기반의 다중컴퓨터에서 고장 허영 멀티캐스팅)

  • Kim, Jin-Soo;Park, Jae-Hyung;Kim, Myung-Kyun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.99-106
    • /
    • 2001
  • In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks (MIN’s). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.

  • PDF

Performance Evaluation of Networks with Buffered Switches (버퍼를 장착한 스위치로 구성된 네트워크들의 성능분석)

  • Shin, Tae-Zi;Nam, Chang-Woo;Yang, Myung-Kook
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.203-217
    • /
    • 2007
  • In this paper, a performance evaluation model of Networks with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch networks. The characteristic of a network with crossbar switches is determined by both the connection pattern of the switches and the limitation of data flow in a each switch. In this thesis, the evaluation models of three different networks : Multistage interconnection network, Fat-tree network, and other ordinary communication network are developed. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of networks that uses the multiple buffered crossbar switches. It is shown that both the analysis and the simulation results match closely. It is also observed that the increasing rate of Normalized Throughput is reduced and the Network Delay is getting bigger as the buffer size increased.

Design of ATM Switch-based on a Priority Control Algorithm (우선순위 알고리즘을 적용한 상호연결 망 구조의 ATM 스위치 설계)

  • Cho Tae-Kyung;Cho Dong-Uook;Park Byoung-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.189-196
    • /
    • 2004
  • Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

  • PDF