Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/369483
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.coverage.spatial | ||
dc.date.accessioned | 2022-03-23T06:05:09Z | - |
dc.date.available | 2022-03-23T06:05:09Z | - |
dc.identifier.uri | http://hdl.handle.net/10603/369483 | - |
dc.description.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. | |
dc.format.extent | Page, All | |
dc.language | English | |
dc.relation | ||
dc.rights | university | |
dc.title | Reliability Evaluation and Topological Design of Communication Networks | |
dc.title.alternative | ||
dc.creator.researcher | Saifi, Mohd. Ashraf | |
dc.subject.keyword | Computer Science | |
dc.subject.keyword | Computer Science Theory and Methods | |
dc.subject.keyword | Engineering and Technology | |
dc.description.note | ||
dc.contributor.guide | Mishra, Rajesh | |
dc.publisher.place | Greater Noida | |
dc.publisher.university | Gautam Buddha University | |
dc.publisher.institution | Department of Computer Science Engineering | |
dc.date.registered | ||
dc.date.completed | 2014 | |
dc.date.awarded | ||
dc.format.dimensions | ||
dc.format.accompanyingmaterial | None | |
dc.source.university | University | |
dc.type.degree | Ph.D. | |
Appears in Departments: | Department of Computer Science Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 344.37 kB | Adobe PDF | View/Open |
02_certificate.pdf | 391.21 kB | Adobe PDF | View/Open | |
03_self_declaration.pdf | 201.25 kB | Adobe PDF | View/Open | |
04_aknowledgement.pdf | 101.69 kB | Adobe PDF | View/Open | |
05_abstract.pdf | 92.21 kB | Adobe PDF | View/Open | |
06_contents.pdf | 172.15 kB | Adobe PDF | View/Open | |
07_list_of_figures.pdf | 167.35 kB | Adobe PDF | View/Open | |
08_list_of_tables.pdf | 175.52 kB | Adobe PDF | View/Open | |
09_list_of_abbreviation.pdf | 92.25 kB | Adobe PDF | View/Open | |
10_list_of_notations.pdf | 314.84 kB | Adobe PDF | View/Open | |
11_chapter_1.pdf | 585.53 kB | Adobe PDF | View/Open | |
12_chapter_2.pdf | 1.17 MB | Adobe PDF | View/Open | |
13_chapter_3.pdf | 1.38 MB | Adobe PDF | View/Open | |
14_chapter_4.pdf | 869.18 kB | Adobe PDF | View/Open | |
15_chapter_5.pdf | 1.05 MB | Adobe PDF | View/Open | |
16_chapter_6.pdf | 384.36 kB | Adobe PDF | View/Open | |
17_bibliography.pdf | 479.85 kB | Adobe PDF | View/Open | |
18_list_of_publications.pdf | 399.33 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 384.36 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: