Combinatorial Approach to Reliability Evaluation of Network with Unreliable Nodes and Unreliable Edges

✍ Scribed by Shpungin Y.

Tongue: English
Leaves: 5
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Paper. Journal of World Academy of Science, Engineering and Technology – 2005. – №12 – pp. 426-430.

Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NP-hard. In this paper we present a very efficient
combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unreliable edges. Its core is the computation of some network combinatorial invariants. These
invariants, once computed, directly provide pure and simple framework for computation of network reliability. As a specific case of this approach we obtain tight lower and upper bounds for
distributed network reliability (the so called residual connectedness reliability). We also present some simulation results.

✦ Subjects

Информатика и вычислительная техника;Сети ЭВМ

📜 SIMILAR VOLUMES

Secure Networked Inference with Unreliab

📁 Secure Networked Inference with Unreliable Data Sources

✍ Aditya Vempaty, Bhavya Kailkhura, Pramod K. Varshney 📂 Library 📅 2018 🏛 Springer Singapore 🌐 English

The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategies to ensure reliable performance for several practical network architectures.

Fault-Tolerant Search Algorithms: Reliab

📁 Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information

✍ Ferdinando Cicalese 📂 Library 📅 2013 🏛 Springer 🌐 English

Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context of search find application in the most diverse areas of computer science and discrete mathematics

Fault-tolerant search algorithms : relia

📁 Fault-tolerant search algorithms : reliable computation with unreliable information

✍ Ferdinando Cicalese 📂 Library 📅 2013 🏛 Springer 🌐 English

Social Sensing: Building Reliable System

📁 Social Sensing: Building Reliable Systems on Unreliable Data

✍ Dong Wang, Tarek Abdelzaher, Lance Kaplan 📂 Library 📅 2015 🏛 Morgan Kaufmann 🌐 English

Increasingly, human beings are sensors engaging directly with the mobile Internet. Individuals can now share real-time experiences at an unprecedented scale. Social Sensing: Building Reliable Systems on Unreliable Data looks at recent advances in the emerging field of social sensing, empha

Network reliability: measures and evalua

📁 Network reliability: measures and evaluation

✍ Chaturvedi, Sanjay K 📂 Library 📅 2016 🏛 John Wiley 🌐 English

In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal rel

Network Programming with Go: Learn to Co

📁 Network Programming with Go: Learn to Code Secure and Reliable Network Services from Scratch

✍ Adam Woodbeck 📂 Library 📅 2021 🏛 No Starch Press 🌐 English

Network Programming with Go teaches you how to write clean, secure network software with the programming language designed to make it seem easy. Go combines the best parts of many other programming languages. It’s fast, scalable, and designed for high-performance networking and multiprocessing—in