A hierarchical knockout switch for high speed information networks

Pao Yue-kong Library Electronic Theses Database

A hierarchical knockout switch for high speed information networks

 

Author: Wu, Fred Hok-choi
Title: A hierarchical knockout switch for high speed information networks
Degree: M.Sc.
Year: 1997
Subject: Information networks
Packet switching (Data transmission)
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Pages: vi, 72, [33] leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1397864
URI: http://theses.lib.polyu.edu.hk/handle/200/3330
Abstract: In 1987 October, a new, high performance packet-switching architecture, called the Knockout switch is proposed. This Knockout switch uses a fully interconnected switch fabric technology so that no switch blocking occurs where packets destined for one output interface with packets going to different outputs. Traditionally, the knockout switch is a non-blocking, higher performance switch which is suitable for broadband packet switching. It allows packet losses, but the probability of a packet loss can be kept extremely small. The main purpose for the Knockout Switch architecture has low latency, and is self-routing and non-blocking. Taking advantage of the inevitably of lost packets in a packet-switching network, the traditional design of the knockout switch uses a novel concentrator design at each output. This can reduce the number of separate buffers needed to receive simultaneously arriving packets. However, this model is very complex when the number of inputs are increased. At the same time, it introduces some additional problems both to the maintainability and fault tolerance during the modular growth. As the networks become larger and larger, the traditional knockout switch is subject to complexity and need many switch elements and buffers in order to meet the acceptable probability loss. This thesis proposes another new model - Hierarchical Knockout switch. The overall objective of the project is to enhance the knockout switch design so that it can maintain the low latency, self-routing and non-blocking feature as the traditional Knockout Switch. We will also study how to design a Hierarchical Knockout switch, which has almost the same traffic performance as the existing knockout switch but needs fewer switch elements and buffers than the existing knockout switch. The specific goals are: 1. Derive the packet loss probability for the Hierarchical Knockout Switch; 2. Optimise the design parameters so that the Hierarchical Knockout Switch can achieve minimum switching elements when the number of inputs are increasing. We have carried out a set of numerical analysis to support our conclusion. The performance will base on different design parameters (such as Input Line Number, Group Numbers and the number of output at the first stage) and will come out an analytical result on how to design the Hierarchical Knockout switch in order to achieve the optimal performance with minimum complexity. A numerical analysis program of the Knockout switch has been done to compare the loss probability for the Hierarchical model and the traditional model. The experiment result show that the complexity can be less than 90% of traditional model when the number of inputs is up to 1024 while the loss probability can still be maintained up to 10-7. Besides, the design rule for the Hierarchical model is purposed so as to simplify the multistage interconnection design. At the end of this thesis, possible future development and recommendation have been addressed.

Files in this item

Files Size Format
b13978640.pdf 3.138Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information