Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/8993
Title: AN IMPROVED ALGORITHM FOR EVALUATING NETWORK RELIABILITY USING DECOMPOSITION TECHNIQUE
Authors: Gupta, Rajiv Kumar
Keywords: ELECTRONICS AND COMPUTER ENGINEERING
ELECTRONICS AND COMPUTER ENGINEERING
ELECTRONICS AND COMPUTER ENGINEERING
ELECTRONICS AND COMPUTER ENGINEERING
Issue Date: 1985
Abstract: In modern age of automation reliability evaluation in computer communication networks is gaining more and more importance. One of the iinpurtant aspects of computer commu-nication networks development is to provide reliable infor-mation with improvement in speed and easy addition of new processing facilities. Reliability of a computer network is classically defined as the probability that it will perform satisfactorily for a specified period of time under stated condition and it depends upon the reliability of nodes and links. Many methods are available to evaluate the reliability of computer communication networks, between any pair of nodes, having one clisadvai-rtage or the other. The algorithms availa-ble were either decomposing the logic graph of the network and ganerating all the terms, then making them disjoint or generating only disjoint terms but considering the network as a whole, for evaluating the reliability of computer network. In this dissertation an algorithm is proposed to evaluate the reliability of larger computer networks by decomposing the reliability logic graph, hence reducing the complexity. Com-putation time is also reduced by generating only the disjoint terms inplace of all the terms. The proposed method has been implemented successfully on JECSYS.Cgi.i-2050, using AWOL programing language and has been explained i,:rith suitable examples.
URI: http://hdl.handle.net/123456789/8993
Other Identifiers: M.Tech
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD178477.pdf5.58 MBAdobe PDFView/Open


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