Implementation and evaluation of Shufflenet, Gemnet and De Bruijn graph logical network topologies

TEKINER, F., GHASSEMLOOY, Z., AL-KHAYATT, S. and THOMPSON, M. (2004). Implementation and evaluation of Shufflenet, Gemnet and De Bruijn graph logical network topologies. In: HAMZA, M. H., (ed.) Proceedings of the IASTED International Conference Parallel and Distributed Computing and Networks. Acta Press.

Full text not available from this repository.
Official URL: http://www.actapress.com/Content_Of_Proceeding.asp...

Abstract

In this paper, a generic model for implementing logical interconnection topologies in software has been proposed in order to investigate the performance of the logical topologies and their routing algorithms for packet based synchronous networks. This model is generic for synchronous transfer modes and therefore can be used in implementing any logical topology by using any programming language. Three topologies have been investigated and implemented namely: Shufflenet, De Bruijn graph and Gemnet. Results for the average packet delay show that the De Bruijn graph performed the worst. Also, it is observed that the De Bruijn graph makes use of buffering more efficiently compared to the other algorithms.

Item Type: Book Section
Additional Information: IASTED International Conference on Parallel and Distributed Computing and Networks, FEB 17-19, 2004, Innsbruck, AUSTRIA
Research Institute, Centre or Group: Cultural Communication and Computing Research Institute > Communication and Computing Research Centre
Depositing User: Ann Betterton
Date Deposited: 13 Dec 2010 14:14
Last Modified: 13 Dec 2010 14:14
URI: http://shura.shu.ac.uk/id/eprint/2678

Actions (login required)

View Item

Downloads

Downloads per month over past year

View more statistics