Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/369483
Title: Reliability Evaluation and Topological Design of Communication Networks
Researcher: Saifi, Mohd. Ashraf
Guide(s): Mishra, Rajesh
Keywords: Computer Science
Computer Science Theory and Methods
Engineering and Technology
University: Gautam Buddha University
Completed Date: 2014
Abstract: newline The performance of any communication network depends upon the probability of newlinesuccessful data transmission or in other words performance of the network is defined as newlinethe communicability of the nodes. It depends upon many factors in which reliability play newlinean important role. The reliable communication between the users is the prime concern of newlinethe modern communication scenario. However, the exact reliability evaluation of any newlinecommunication networks is important in order to find optimal topology design polices, newlineparticularly when there exist imperfect hop coverage in between two nodes, cost of the newlinelayout design, common-cause failures, and delay etc. Therefore, in this thesis two aspects newlineof the complex networks, namely, (i) evaluation of reliability indices, and (ii) optimal newlinetopological design of networks in order to maximize reliability and minimize the cost and newlinedelay are studied. newlineIn networks, the performance depends upon the probability of a specified set of nodes newlinebeing communicable. Among the several approaches of reliability evaluation, the newlinemultiple-variable-inversion sum-of-disjoint product (MVI-SDP) approach provides the newlinereliability expression in a most efficient and compact manner. However, it needs newlineefficiently enumerated inputs depending on the output requirement i.e. required reliability newlinemeasures (as input will be different for each reliability measure). Therefore, the major newlinecontribution in this work is to provide a minimal pathset or cutset based common newlineframework to evaluate network reliability measures viz., 2-, g-, and k-terminal reliability. newlineThe work proposes various efficient algorithms to enumerate spanning trees and gminimal newlinecutsets, which is a new idea, directly from the adjacency matrix representation of newlinea network. These spanning trees or g-minimal cutsets can be used in conjunction with newlineMVI-SDP approach to evaluate g-terminal reliability or global reliability. Another newlineattempt has been made in this objective to provide an answer to the question as to when newlinecutsets or pathsets are suitable for evaluating reliability measures. An exhaustive study newlinehas been conducted to provide some guidelines in this respect.
Pagination: Page, All
URI: http://hdl.handle.net/10603/369483
Appears in Departments:Department of Computer Science Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File344.37 kBAdobe PDFView/Open
02_certificate.pdf391.21 kBAdobe PDFView/Open
03_self_declaration.pdf201.25 kBAdobe PDFView/Open
04_aknowledgement.pdf101.69 kBAdobe PDFView/Open
05_abstract.pdf92.21 kBAdobe PDFView/Open
06_contents.pdf172.15 kBAdobe PDFView/Open
07_list_of_figures.pdf167.35 kBAdobe PDFView/Open
08_list_of_tables.pdf175.52 kBAdobe PDFView/Open
09_list_of_abbreviation.pdf92.25 kBAdobe PDFView/Open
10_list_of_notations.pdf314.84 kBAdobe PDFView/Open
11_chapter_1.pdf585.53 kBAdobe PDFView/Open
12_chapter_2.pdf1.17 MBAdobe PDFView/Open
13_chapter_3.pdf1.38 MBAdobe PDFView/Open
14_chapter_4.pdf869.18 kBAdobe PDFView/Open
15_chapter_5.pdf1.05 MBAdobe PDFView/Open
16_chapter_6.pdf384.36 kBAdobe PDFView/Open
17_bibliography.pdf479.85 kBAdobe PDFView/Open
18_list_of_publications.pdf399.33 kBAdobe PDFView/Open
80_recommendation.pdf384.36 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: