Abstract
In order to increase the visibility of a target pageT, web spammers createhyperlink structures called web bubbles, or link farms. As countermeasure, special mobile agents, called web marshals, are deployed in the detection and disassembling oflink 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbosa, V.C., Gafni, E.: Concurrency in Heavily Loaded Neighborhood-Constrained Systems. ACM Transactions on Programming Languages and Systems 11(4), 562–584 (1989)
Arantes Jr., G.M., França, F.M.G., Martinhon, C.A.: Randomized generation of acyclic orientations upon anonymous distributed systems. Journal of Parallel and Distributed Computing 69, 239–246 (2009)
Barbosa, V.C.: An Introduction to Distributed Algorithms. The MIT Press, Cambridge (1996)
Barbosa, V.C.: An Atlas of Edge-Reversal Dynamics. Chapman & Hall/CRC, London (2000)
Gonçalves, V.C.F., França, F.M.G., Maculan, N., Lima, P.M.V.: SER-Based Web Graph Decontamination. In: 1st Worskhop INCT WebScience, PUC-RIO (2010)
Cassia, R.F., Alves, V.C., Bernard, F.G.-D., França, F.M.G.: Synchronous-to-asynchronous conversion of cryptographic circuits. Journal of Circuits, Systems, and Computers 18, 271–282 (2009)
Luccio, F., Pagli, L.: Web Marshals Fighting Curly Link Farm. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 240–248. Springer, Heidelberg (2007)
Flocchini, P., Nayak, A., Schulz, A.: Cleaning an arbitrary network with mobile agents. In: Chakraborty, G. (ed.) ICDCIT 2005. LNCS, vol. 3816, pp. 132–142. Springer, Heidelberg (2005)
Gyöngyi, Z., Garcia-Molina, H.: Web Spam Taxonomy. In: Proc. of AIRWeb 2005, Chiba (2005)
Donato, D., Leonardi, S., Millozzi, S., Tsaparas, P.: Mining the inner structure of the Web graph. In: 8th International Workshop on the Web and Databases (WebDB 2005), Baltimore, Maryland (2005)
Flocchini, P., Nayak, A., Schulz, A.: Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility. In: Proc. of 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007 (2007)
Becchetti, L., Castillo, C., Donato, D., Leonardi, S., BaezaYates, R.: Link-Based Characterization and Detection of Web Spam. In: Proc. AIRWeb 2006, Seattle (2006)
Du, Y., Shi, Y., Zhao, X.: Using Spam Farm to Boost Page Rank (2006) (manuscript under publication)
Lapaugh, A.: Recontamination does not help to search a graph. Journal of the ACM 40(2), 224–245 (1993)
Barrière, L., Flocchini, P., Fraignaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Canada (2002)
Luccio, F., Pagli, L., Santoro, N.: Network Decontamination with Local Immunization. In: Proc. of the 8th APDCM, pp. 110–118 (2006)
Borie, R., Tovey, C., Koenig, S.: Algorithms and Complexity Results for Pursuit-Evasion Problem. In: Proc. of the 21st International Joint Conference on Artificial Intelligence, pp. 59–66. Morgan Kaufmann Publishers, San Francisco (2008)
Lengerke, O., Carvalho, D., Lima, P.M.V., Dutra, M.S., Mora-Camino, F., França, F.M.G.: Controle distribuído de sistemas job shop usando escalonamento por reversão de arestas. In: Proc. of the XIV Latin Ibero-American Congress on Operations Research (CLAIO 2008), Cartagena de Indias (2008) (in Portuguese)
Lengerke, O., Dutra, M.S., França, F.M.G., Tavera, M.J.M.: Automated Guided Vehicles (AGV): Searching a Path in the Flexible Manufacturing Systems. Journal of Konbin 8, 113–124 (2008)
Yang, Z., França, F.M.G.: A generalised locomotion CPG architecture based on oscillatory building blocks. Biological Cybernetics 89(1), 34–42 (2003)
Braga, R.R., Yang, Z., França, F.M.G.: Implementing an Artificial Centipede CPG: Integrating appendicular and axial movements of the scolopendramorph centipede. In: Proc. of the International Conference on Bio-inspired Systems and Signal Processing (BIOSIGNALS 2008), vol. 2, pp. 58–62. INSTICC Press (2008)
Pinho, A.C., Santos, A.A., Figueiredo, D.R., França, F.M.G.: Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds.) IFIP-TC 6. LNCS, vol. 5550, pp. 919–930. Springer, Heidelberg (2009)
Arantes Jr., G. M.: Tracks, Concurrency Optimization, and Probabilistic Initialization on Systems under Edge Reversal, D.Sc. thesis, COPPE/UFRJ (2006) (in Portuguese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonçalves, V.C.F., Lima, P.M.V., Maculan, N., França, F.M.G. (2010). A Distributed Dynamics for WebGraph Decontamination. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification, and Validation. ISoLA 2010. Lecture Notes in Computer Science, vol 6415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16558-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-16558-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16557-3
Online ISBN: 978-3-642-16558-0
eBook Packages: Computer ScienceComputer Science (R0)