Dissertation on effective node placement in ShuffleNets

Pao Yue-kong Library Electronic Theses Database

Dissertation on effective node placement in ShuffleNets


Author: Tam, Wai-tak
Title: Dissertation on effective node placement in ShuffleNets
Degree: M.Sc.
Year: 1998
Subject: Optical communications
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Dept. of Computing
Pages: vii, 59, [19] leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1425948
URI: http://theses.lib.polyu.edu.hk/handle/200/2274
Abstract: A ShuffleNet is a typical cost effective topology and has the property of producing large connected graphs with small degree and diameter. That is, ShuffleNet can interconnect a large number of nodes with small number of transceiver per node. The effectiveness of the ShuffleNet depends on the method to assign nodes on the ShuffleNet framework. Optimization node assignment is a computational problem and it must be simple enough for real time computation and effective in various situations such as multimedia services and client-server environments. In recent years, several studies have been carried out to investigate methods for optimizing the average internodal distance and hence increase the effectiveness. Those methods include GREEDY approach, LOCAL approach, GLOBAL approach, ITERATIVE approach and Active Node Placement. This dissertation extends the Active Node Placement approach by increasing the quantization levels from binary (either active or non-active) to multi-levels (from 2 to 32) with an alternate node placement method and investigates its performance against other algorithms. Also, two quantization methods have been studied in term of their effectiveness in reducing the internodal distance. Several typical environments are selected for evaluating the performance of this effective node placement approach. They are uniformly distributed random traffic, hot-spot traffic (client-server environment)and point-to-point traffic (Multi-media environment). The evaluation of the performance of this algorithm is by mean of simulation. Their average distances between nodes for packet data transmission (average internodal distance/hop counts) are studied to measure the performance on different environments.

Files in this item

Files Size Format
b14259485.pdf 2.621Mb 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


More Information