A distributed dynamics for webgraph decontamination

Authors:
Vanessa C. F. Gonçalves;Priscila M. V. Lima;Nelson Maculan;Felipe M. G. França
Affiliations:
Systems Engineering and Computer Science Program, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Department of Mathematics, Instituto de Ciências Exatas, Universidade Federal Rural do Rio de Janeiro, Seropédica, RJ, Brazil;Systems Engineering and Computer Science Program, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Systems Engineering and Computer Science Program, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 10
Cited 1

Concurrency in heavily loaded neighborhood-constrained systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Recontamination does not help to search a graph

Journal of the ACM (JACM)
An introduction to distributed algorithms

An introduction to distributed algorithms
An Atlas of Edge-Reversal Dynamics

An Atlas of Edge-Reversal Dynamics
Capture of an intruder by mobile agents

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Randomized generation of acyclic orientations upon anonymous distributed systems

Journal of Parallel and Distributed Computing
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Algorithms and complexity results for pursuit-evasion problems

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Web marshals fighting curly link farms

FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Cleaning an arbitrary regular network with mobile agents

ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology

The effect of intelligent escape on distributed SER-Based search

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to increase the visibility of a target pageT, web spammers create hyperlink structures called web bubbles, or link farms. As countermeasure, special mobile agents, called web marshals, are deployed in the detection and disassembling of link farms. Interestingly, the process of minimizing the number of web marshals and the number of hops needed to dismantle a web bubble is analogous to the graph decontamination problem. A novel distributed algorithm for graph decontamination, which can be used to define the behavior of web marshals, is introduced in this work. The new algorithm is asynchronous and topology independent. Moreover, it presents equal or better performance and needs smaller numbers of web marshals when compared to recent related works targeting only circulant graphs, a typical structure of link farms.