Object
Title: Construction of Edge Fault-Tolerant Codes for MinimalGossip Schemes
Co-author(s) :
Abstract:
The gossip problem, also the k-fault-tolerant gossiping, where at most k arbitrary faults of calls are allowed, is investigated. It is shown that for providing the stability of fault-tolerant gossip scheme, an application of some well designed error detection/correction technique is implied to address the failures specific to information dissemination. The fault-tolerant code introduced is based on edge redundancy, meanwhile the method underlying the construction of robust k-fault-tolerant gossiping exploits peculiarities of hypercube expander graphs. Efficiency of the construction is also considered.
Identifier:
oai:noad.sci.am:135993
Language:
URL:
Additional Information:
psuren55@yandex.ru ; ealaverdjan@gmail.com
Affiliation:
Institute for Informatics and Automation Problems ; National Polytechnic University of Armenia
Country:
Year:
Time period:
Conference title:
10 th International Conference on Computer Science and Information Technologies CSIT 2015
Place:
Participation type:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
Mar 3, 2021
In our library since:
Jul 28, 2020
Number of object content hits:
105
All available object's versions:
https://noad.sci.am/publication/149606
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Suren Poghosyan, Construction of Edge Fault-Tolerant Codes for MinimalGossip Schemes | Mar 3, 2021 |
