Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/1025
DC FieldValueLanguage
dc.contributor.authorHesham A. Al-Mansouren_US
dc.date.accessioned2019-12-09T09:26:14Z-
dc.date.available2019-12-09T09:26:14Z-
dc.date.issued2019en_US
dc.identifier.urihttp://hdl.handle.net/123456789/1025-
dc.description.abstractThe 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 pathen_US
dc.language.isoenen_US
dc.publisher Kuwait university - college of graduate studiesen_US
dc.subjectInterconnection networks, Disjoint paths, Fault-toleranceen_US
dc.titleGeneral Disjoint Paths Algorithm for Symmetric Networksen_US
dc.typethesisen_US
dc.contributor.supervisorDr. Zaid Hussainen_US
dc.contributor.universityID216129400en_US
dc.description.conclusionsThen, the destination node receives and integrates these packets to retrieve the original message. There are several topologies of interconnection networks and the disjoint paths algorithm is different for each topology. This thesis proposes the general algorithm for discovering all node-to-node disjoint paths for any symmetric network based on the idea of mobile ad-hoc routing protocols.en_US
dc.date.semesterFallen_US
dc.description.examinationYen_US
dc.description.gpa3.5en_US
dc.description.credits31en_US
dc.description.degreeM. Sc Degree in: Computer Scienceen_US
Appears in Programs:0612 Computer Engineering
Files in This Item:
File Description SizeFormat 
Thesis.pdf1,83 MBAdobe PDFView/Open    Request a copy
Show simple item record

Page view(s)

35
Last Week
0
Last month
2
checked on Oct 30, 2020

Download(s)

3
checked on Oct 30, 2020

Google ScholarTM

Check


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