Produto Funcional de Grafos: Um Modelo para Conexão de Sistemas Multiagentes
DOI:
https://doi.org/10.5540/tema.2016.017.03.0341Keywords:
Produto funcional de grafos, grafos harmônicos, sistemas multiagentesAbstract
Neste trabalho, os conceitos de produto funcional de grafos e coloração total equilibrada foram utilizados para propor um modelo de conexão entre sistemas multiagentes. Mostramos como gerar uma família de grafos regulares que admite coloração de vértice com folga Delta com Delta+1 cores, denominada grafos harmônicos. Esse resultado mostra que esses grafos dispõem de uma estrutura recursiva altamente escalável, pois a partir de uma instância básica inicial, pode-se expandir dinamicamente sua forma, mantendo-se propriedades como conexidade e regularidade. Finalizamos apresentando um modelo de conexão entre sistemas multiagentes (SMA), com a utilização dos grafos harmônicos como suporte para construção de topologias de rede overly P2P para a comunicação entre estes sistemas.
References
S. Androutsellis-Theotokis & D. Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys (CSUR), 36(4) (2004), 335–371.
J. Bondy & U. Murty. “Graph Theory with Applications”, North-Holland, New York, (1976).
F.L.G. Freitas. “Sistemas Multiagentes Cognitivos para recuperação, classificação e extração integradas de informação da WEB”. Tese de Doutorado, UFSC, Santa Catarina, SC, (2002).
C.V.P. Friedmann, A.R.G. Lozano, L. Markenzon & C.F.E.M. Waga. Total coloring of Block-cactus graphs. The journal of combinatorial mathematics and combinatorial computing, 78 (2011), 273– 283.
W. Imrich, S. Klavzar & D. Rall. “Topics in Graph Theory: Graphs and Their Cartesian Products”. AK Peters Ltd, (2008).
V.R. Lesser. Cooperative multiagent systems: A personal view of the state of the art. Knowledge and Data Engineering, IEEE Transactions on, 11(1) (1999), 133–142.
A.R.G. Lozano, C.V.P. Friedmann & S. Jurkiewicz. Coloração total equilibrada de grafos, um modelo para redes de interconexão. Pesquisa Operacional, 28 (2008), 161–171.
A.R.G. Lozano, A.S. Siqueira, S. Jurkiewicz & C.V.P. Friedmann. Produto Funcional de Grafos. Tendências em Matemática Aplicada e Computacional, 14 (2013), 221–232.
A.R.G. Lozano. “Coloração Total Equilibrada de Grafos”. Tese de Doutorado, COPPE, UFRJ, Rio de Janeiro, RJ, (2005).
W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer & T. Risch. EDUTELLA: a P2P Networking Infrastructure based on RDF. Proceedings of the 11th International Conference on World Wide Web, Hawaii, USA, (2002), 604–615.
S. Ratnasamy, P. Francis, M. Handley, R. Karp & S. Shenker. “A scalable content-addressable network”, ACM, (2001).
L.P. Reis. “Coordination in Multi-Agent Systems: Applications in University Management and Robotic Soccer”, Ph.D. Thesis, FEUP, Porto, Portugal, (2003).
A. Rowstron & P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Middleware 2001, Springer, (2001), 329–350.
S. Russel & P. Norvig. “Inteligência artificial: A Modern Approach”. Prentice Hall Series in Artificial Intelligence, New Jersey, (2004).
G. Sabidussi. Graph multiplication. Math. Z., 72 (1960), 446–457.
A.S. Siqueira. “Coloração total equilibrada em subfamílias de grafos regulares”. Tese de Doutorado, COPPE, UFRJ, Rio de Janeiro, RJ, (2011).
I. Stoica, R. Morris, D. Karger, M.F. Kaashoek & H. Balakrishnan. Chord: A scalable peer-to- peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review, 31(4) (2001), 149–160.
V.G. Vizing. The Cartesian product of graphs. Vyc. Sis., 9 (1963), 30–43.
B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph & J.D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. Selected Areas in Communications, IEEE Journal on, 22(1) (2004), 41–53.
H. Yap. “Total colorings of graphs”, Springer, Berlin, (1996).
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.
