Co-author(s) :

Alaverdyan Yeghisabet

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:

English

URL:

Additional Information:

psuren55@yandex.ru ; ealaverdjan@gmail.com

Affiliation:

Institute for Informatics and Automation Problems ; National Polytechnic University of Armenia

Country:

Armenia

Year:

2015

Time period:

September 28 - October 2

Conference title:

10 th International Conference on Computer Science and Information Technologies CSIT 2015

Place:

Yerevan

Participation type:

poster