Graduate Thesis Or Dissertation

 

Fault diagnosis in a fully distributed local computer network Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/ks65hf83h

Descriptions

Attribute NameValues
Creator
Abstract
  • Local computer networks are being installed in diverse application areas. Many of the networks employ a distributed control scheme, which has advantages in performance and reliability over a centralized one. However, distribution of control increases the difficulty in locating faulty hardware elements. Consequently, advantages may not be fully realized unless measures are taken to account for the difficulties of fault diagnosis; yet, not much work has been done in this area. A hardcore is defined as a node or a part of a node which is fault-free and which can diagnose other elements in a system. Faults are diagnosed in most existing distributed local computer networks by assuming that every node, or a part of every node, is a fixed hardcore: a fixed node or a part of a fixed node is always a hardcore. Maintaining such high reliability may not be possible or cost-effective for some systems. A distributed network contains dynamically redundant elements, and it is reasonable to assume that fewer nodes are simultaneously faulty than are fault-free at any point in the life cycle of the network. A diagnostic model is proposed herein which determines binary evaluation results according to the status of the testing and tested nodes, and which leads the network to dynamically locate a fault-free node (a hardcore). This diagnostic model is, in most cases, simpler to implement and more cost-effective than the fixed hardcore. The selected hardcore can diagnose the other elements and can locate permanent faults. In a hop-by-hop test, the destination node and every intermediate node in a path test the transmitted data. This dissertation presents another method to locate an element with frequent transient faults; it checks data only at the destination, thereby, eliminating the need for a hop-by-hop test.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-07-17T17:40:54Z (GMT) No. of bitstreams: 1 KwagHyeKeun1984.pdf: 1413013 bytes, checksum: db9dbfc8aa00970fe2f5be67ff7d4a34 (MD5)
  • description.provenance : Made available in DSpace on 2013-07-18T18:32:25Z (GMT). No. of bitstreams: 1 KwagHyeKeun1984.pdf: 1413013 bytes, checksum: db9dbfc8aa00970fe2f5be67ff7d4a34 (MD5) Previous issue date: 1983-05-23
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2013-07-16T20:12:25Z No. of bitstreams: 1 KwagHyeKeun1984.pdf: 1413013 bytes, checksum: db9dbfc8aa00970fe2f5be67ff7d4a34 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-07-18T18:32:25Z (GMT) No. of bitstreams: 1 KwagHyeKeun1984.pdf: 1413013 bytes, checksum: db9dbfc8aa00970fe2f5be67ff7d4a34 (MD5)

Relationships

Parents:

This work has no parents.

Items