Asynchronous distributed power iteration with gossip-based normalization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4641 LNCS, Issue , 2007, Pages 514-525

  Jelasity, Márk ^a   Canright, Geoffrey ^b   Engø Monsen, Kenth ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b TELENOR RESEARCH   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; FAULT TOLERANCE; NETWORK MANAGEMENT; PARALLEL ALGORITHMS;

ASYNCHRONOUS ITERATION ALGORITHM; GOSSIP-BASED NORMALIZATION; OVERLAY NETWORKS; TRUST MANAGEMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38049176724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74466-5_55     Document Type: Conference Paper

References (18)

1. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
2. Sankaralingam, K., Sethumadhavan, S., Browne, J.C.: Distributed pagerank for p2p systems. In: Proc. HPDC-12, pp. 58-69 (2003)
3. Shi, S., Yu, J., Yang, G., Wang, D.: Distributed page ranking in structured p2p networks. In: Proc. ICPP03, pp. 179-186 (October 2003)
4. Parreira, J.X., Donato, D., Michel, S., Weikum, C.: Efficient and decentralized PageRank approximation in a peer-to-peer web search network. In: Proc. VLDB, pp. 415-426 (2006)
5. Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proc. WWW, ACM Press, New York (2003)
6. Koren, Y.: On spectral graph drawing. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 496-508. Springer, Heidelberg (2003)
7. Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: Proc. SIGCOMM 2004, ACM Press, New York (2004)
8. Lubachevsky, B., Mitra, D.: A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit radius. J. of the ACM 33(1), 130-150 (1986)
9. Burgess, M., Canright, G., Engø-Monsen, K.: Importance-ranking functions derived from the eigenvectors of directed graphs. Technical Report DELIS-TR-0325, DELIS Project (2006)
10. Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems 23(3), 219-252 (2005)
11. Jelasity, M., Guerraoui, R., Kermarrec, A.M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79-98. Springer, Heidelberg (2004)
12. PeerSim: http://peersim.sourceforge.net/
13. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. FOCS'03, pp. 482-491. IEEE Computer Society Press, Los Alamitos (2003)
14. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47-97 (2002)
15. Watts, D.J., Strogatz, S.H.: Collective dynamics of 'small-world' networks. Nature 393, 440-442 (1998)
16. Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H. (eds.): Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide, SIAM, Philadelphia (2000)
17. Albert, R., Jeong, H., Barabási, A.L.: Diameter of the world wide web. Nature 401, 130-131 (1999)
18. Frommer, A., Szyld, D.B.: On asynchronous iterations. Journal of Computational and Applied Mathematics 123(1-2), 201-216 (2000)