Show simple item record

dc.contributor.advisorPitsillides, Andreasen
dc.contributor.advisorΠιτσιλλίδης, Ανδρέαςel_GR
dc.contributor.authorΣτυλιανού, Μαρίνοςel_GR
dc.contributor.authorStylianou, Marinosen
dc.coverage.spatialCyprusen
dc.coverage.spatialΚύπροςel_GR
dc.date2005
dc.date.accessioned2013-09-10T08:11:23Z
dc.date.available2013-09-10T08:11:23Z
dc.date.issued2005-06
dc.identifier.urihttp://hdl.handle.net/10797/13103en
dc.descriptionThesis (Master) -- University of Cyprus, Faculty of Pure and Applied Sciences, Department of Computer Science, 2005.en
dc.description.abstractIn this thesis graph theoretic techniques are adopted for addressing the network survivability issue of disjoint paths selection. The evaluation was conducted after the implementation of a solver that produces a solution of the problem after successive application of two algorithms on any given topology, the algorithm of Louca et al [19] and Castanon’s [8]. The first algorithm transforms any networks into a trellis graph and the second exploits the special structure of the trellis graph and solves for the k-best paths using the minimum cost network flow (MCNF) algorithm. The transformation and evaluation of the K-best paths solution is illustrated for a number of topologies through the graphical user interface adapted from [37]. It is also contrasted with the k-successive approximation methods, which cannot guarantee the selection of the K-best paths, due to the successive removal of shortest paths at each iteration. Furthermore, the performance of the algorithm and its time complexity are investigated and also compared with Surballe’s Disjoint Pair Algorithm [31]. Even though the trellis transformations algorithm can find all possible disjoint paths in the vast majority of cases, pathological situations where the algorithm may fail is also identified in the thesis, analysed, and a solution is provided and evaluated.en
dc.format.extenti, 44 p. : ill ; 30 cm.en
dc.language.isoengen
dc.publisherUniversity of Cyprus, Faculty of Pure and Applied Sciencesen
dc.publisherΠανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημώνel_GR
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.source.urihttps://ktree.cs.ucy.ac.cy/action.php?kt_path_info=ktcore.actions.document.view&fDocumentId=5430en
dc.titleEvaluating the network survivability issue of k-best paths through graph theoretic techniquesen
dc.typeinfo:eu-repo/semantics/masterThesisen
dc.contributor.departmentUniversity of Cyprus, Faculty of Pure and Applied Sciences, Department of Computer Scienceen
dc.contributor.departmentΠανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών, Τμήμα Πληροφορικήςel_GR


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record