A heuristic on the rearrangeability of shuffle-exchange networks

Description

The algorithms which control network routing are specific to the network because the algorithms are designed to take advantage of that network's topology. The "goodness" of a network includes such criteria as a simple routing algorithm and a simple routing algorithm would increase the use of the shuffle-exchange network.

Links & Downloads

1. https://scholarworks.lib.csusb.edu/etd-project/2521
2. https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=3538&context=etd-project

Tags

Computer networks

Computer algorithms

Data transmission systems

Digital communications

Data structures (Computer science)

Computer programming

Computer Sciences

Additional Fields

Identifer	oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-3538
Date	01 January 2004
Creators	Alston, Katherine Yvette
Publisher	CSUSB ScholarWorks
Source Sets	California State University San Bernardino
Detected Language	English
Type	text
Format	application/pdf
Source	Theses Digitization Project