Exploiting Markov Chains to reach Approximate Agreement in partially connected networks

Satish Mahade Van Srinivasan; Azad H. Azadmanesh

Exploiting Markov Chains to reach Approximate Agreement in partially connected networks

Satish Mahade Van Srinivasan, Azad H. Azadmanesh

Engineering Division (Great Valley)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

The research in reaching Approximate Agreement (AA) for fully connected networks is relatively mature. In contrast, the literature survey of the AA problem for partially connected networks is evident of considerably less work. This is due to the fact that a node may not have a complete view of the global network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. This study investigates the AA problem for partially connected networks without node failures. The properties of Markov Chains are exploited to show the approximate convergence of the values of the nodes in the network. The results show that the number of rounds of messageexchange to reach a network-convergence depends on the distribution of values held by the nodes and is bound by [m/ 2], where m is the network diameter. The intension of this research is to potentially use the approach as a stepping-stone for future investigation of the AA problem in the presence of faults.

Original language	English (US)
Title of host publication	International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07
Pages	82-89
Number of pages	8
State	Published - Dec 1 2007
Event	International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007 - San Diego, CA, United States Duration: Jul 15 2007 → Jul 18 2007

Other

Other	International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007
Country	United States
City	San Diego, CA
Period	7/15/07 → 7/18/07

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Modeling and Simulation

Access to Document

Fingerprint Dive into the research topics of 'Exploiting Markov Chains to reach Approximate Agreement in partially connected networks'. Together they form a unique fingerprint.

Cite this

Srinivasan, S. M. V., & Azadmanesh, A. H. (2007). Exploiting Markov Chains to reach Approximate Agreement in partially connected networks. In International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07 (pp. 82-89)

@inproceedings{46176ffa60ea449c8689b6ff71e4622b,

title = "Exploiting Markov Chains to reach Approximate Agreement in partially connected networks",

abstract = "The research in reaching Approximate Agreement (AA) for fully connected networks is relatively mature. In contrast, the literature survey of the AA problem for partially connected networks is evident of considerably less work. This is due to the fact that a node may not have a complete view of the global network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. This study investigates the AA problem for partially connected networks without node failures. The properties of Markov Chains are exploited to show the approximate convergence of the values of the nodes in the network. The results show that the number of rounds of messageexchange to reach a network-convergence depends on the distribution of values held by the nodes and is bound by [m/ 2], where m is the network diameter. The intension of this research is to potentially use the approach as a stepping-stone for future investigation of the AA problem in the presence of faults.",

author = "Srinivasan, {Satish Mahade Van} and Azadmanesh, {Azad H.}",

year = "2007",

month = dec,

day = "1",

language = "English (US)",

isbn = "9781622763559",

pages = "82--89",

booktitle = "International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07",

note = "International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007 ; Conference date: 15-07-2007 Through 18-07-2007",

}

Srinivasan, SMV & Azadmanesh, AH 2007, Exploiting Markov Chains to reach Approximate Agreement in partially connected networks. in International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. pp. 82-89, International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007, San Diego, CA, United States, 7/15/07.

Exploiting Markov Chains to reach Approximate Agreement in partially connected networks. / Srinivasan, Satish Mahade Van; Azadmanesh, Azad H.

International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07. 2007. p. 82-89.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Exploiting Markov Chains to reach Approximate Agreement in partially connected networks

AU - Srinivasan, Satish Mahade Van

AU - Azadmanesh, Azad H.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - The research in reaching Approximate Agreement (AA) for fully connected networks is relatively mature. In contrast, the literature survey of the AA problem for partially connected networks is evident of considerably less work. This is due to the fact that a node may not have a complete view of the global network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. This study investigates the AA problem for partially connected networks without node failures. The properties of Markov Chains are exploited to show the approximate convergence of the values of the nodes in the network. The results show that the number of rounds of messageexchange to reach a network-convergence depends on the distribution of values held by the nodes and is bound by [m/ 2], where m is the network diameter. The intension of this research is to potentially use the approach as a stepping-stone for future investigation of the AA problem in the presence of faults.

AB - The research in reaching Approximate Agreement (AA) for fully connected networks is relatively mature. In contrast, the literature survey of the AA problem for partially connected networks is evident of considerably less work. This is due to the fact that a node may not have a complete view of the global network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. This study investigates the AA problem for partially connected networks without node failures. The properties of Markov Chains are exploited to show the approximate convergence of the values of the nodes in the network. The results show that the number of rounds of messageexchange to reach a network-convergence depends on the distribution of values held by the nodes and is bound by [m/ 2], where m is the network diameter. The intension of this research is to potentially use the approach as a stepping-stone for future investigation of the AA problem in the presence of faults.

UR - http://www.scopus.com/inward/record.url?scp=84870228331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870228331&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84870228331

SN - 9781622763559

SP - 82

EP - 89

BT - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07

T2 - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007

Y2 - 15 July 2007 through 18 July 2007

ER -