Please use this identifier to cite or link to this item:
Title: General Disjoint Paths Algorithm for Symmetric Networks
Authors: Hesham A. Al-Mansour 
Supervisor: Dr. Zaid Hussain
Degree Awarded: M. Sc Degree in: Computer Science
Keywords: Interconnection networks, Disjoint paths, Fault-tolerance
Issue Date: 2019
Publisher:  Kuwait university - college of graduate studies
Abstract: The topology of interconnection networks plays a major role in parallel and distributed computing. Many interconnection networks were proposed such as Hypercube, Generalized Hypercube, Mesh, Torus, Gaussian, Eisenstein-Jacobi networks, and many other topologies. Disjoint Paths are useful in fault-tolerance routing, which makes the network communication reliable with the existence of certain number of faulty nodes. In addition, disjoint paths are useful in securing message distribution such that a source node divides the message into several packets where each packet propagate in the network using different path
Appears in Programs:0612 Computer Engineering

Files in This Item:
File Description SizeFormat 
Thesis.pdf1,83 MBAdobe PDFView/Open    Request a copy
Show full item record

Page view(s)

Last Week
Last month
checked on Sep 27, 2020


checked on Sep 27, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.