TY - GEN

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

AU - Srinivasan, Satish M.

AU - Azadmanesh, Azad H.

PY - 2007

Y1 - 2007

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

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

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 -