Asynchronous distributed power iteration with gossip-based normalization

Márk Jelasity, Geoffrey Canright, Kenth Engø-Monsen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, importance ranking to support search, and virtual coordinate systems to facilitate managing network proximity. Robust and efficient asynchronous distributed algorithms are known only for the case when the dominant eigenvalue is exactly one. We present a fully distributed algorithm for a more general case: non-negative square matrices that have an arbitrary dominant eigenvalue. The basic idea is that we apply a gossip-based aggregation protocol coupled with an asynchronous iteration algorithm, where the gossip component controls the iteration component. The norm of the resulting vector is an unknown finite constant by default; however, it can optionally be set to any desired constant using a third gossip control component. Through extensive simulation results on artificially generated overlay networks and real web traces we demonstrate the correctness, the performance and the fault tolerance of the protocol.

Original languageEnglish
Title of host publicationEuro-Par 2007 Parallel Processing - 13th International Euro-Par Conference, Proceedings
Pages514-525
Number of pages12
Publication statusPublished - Dec 1 2007
Event13th International Euro-Par Conference on Parallel Processing, Euro-Par 2007 - Rennes, France
Duration: Aug 28 2007Aug 31 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4641 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Euro-Par Conference on Parallel Processing, Euro-Par 2007
CountryFrance
CityRennes
Period8/28/078/31/07

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jelasity, M., Canright, G., & Engø-Monsen, K. (2007). Asynchronous distributed power iteration with gossip-based normalization. In Euro-Par 2007 Parallel Processing - 13th International Euro-Par Conference, Proceedings (pp. 514-525). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4641 LNCS).