Julian Geraldes Monteiro

Idiomas

Áreas de atuação

Organização de eventos

Participação em eventos

Produções bibliográficas

• CARON, STÉPHANE ; GIROIRE, FRÉDÉRIC ; Mazauric, Dorian ; Monteiro, Julian ; PÉRENNES, STÉPHANE . P2P storage systems: Study of different placement policies. Peer-to-Peer Networking and Applications (Print) , v. 1, p. 1, 2013.

• Ferreira, Afonso ; Goldman, Alfredo ; MONTEIRO, J . Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks , v. 16, p. 627-640, 2010.

• Giroire,F ; GUPTA, S. K. ; MODRZEJEWSKI, R. ; MONTEIRO, J ; Perennes, S . Repair Time in Distributed Storage Systems. In: Data Management in Cloud, Grid and P2P Systems, 2013, Prague, República Tcheca. Lecture Notes in Computer Science, 2013. v. 8059. p. 99-110.

• Giroire,F ; ARAUJO, J. ; MONTEIRO, J . Hybrid Approaches for Distributed Storage Systems. In: Data Management in Grid and Peer-to-Peer Systems (Globe 2011), 2011, Tolouse, França. Lecture Notes in Computer Science, 2011. v. 6864. p. 1-12.

• GIROIRE, FREDERIC ; Monteiro, Julian ; PERENNES, STEPHANE . Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy. In: GLOBECOM 2010 2010 IEEE Global Communications Conference, 2010, Miami. 2010 IEEE Global Telecommunications Conference GLOBECOM 2010. p. 1.

• Caron, S. ; Giroire,F ; Mazauric, Dorian ; MONTEIRO, J ; Perennes, S . Data Life Time for Different Placement Policies in P2P Storage Systems. In: Third International Conference on Data Management in Grid and Peer-to-Peer Systems (Globe), 2010, Bilbao, Spain. LNCS - Data Management in Grid and Peer-to-Peer Systems, 2010. v. 6265. p. 75-88.

• Mazauric, Dorian ; Giroire,F ; MONTEIRO, J ; Caron, S. ; Perennes, S . P2P storage systems: Data life time for different placement policies. In: Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications, 2010, Belles Dunes. Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications, 2010.

• DALLE, O ; Giroire,F ; MONTEIRO, J ; Perennes, S . Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. In: 9th IEEE International Conference on Peer-to-Peer Computing (P2P), 2009, Seattle. 9th IEEE International Conference on Peer-to-Peer Computing (P2P), 2009. p. 184-193.

• Giroire,F ; MONTEIRO, J ; Perennes, S . P2P storage systems: How much locality can they tolerate?. In: IEEE 34th Conference on Local Computer Networks (LCN), 2009, Zurich. IEEE 34th Conference on Local Computer Networks (LCN), 2009. p. 320-323.

• MONTEIRO, J . The use of Evolving Graph Combinatorial Model in Routing Protocols for Dynamic Networks. In: CLEI 2008 - XXXIV Conferencia Latinoamericana de Informática, 2008, Santa Fé, Argentina. Conferencia Latinoamericana de Informática, 2008. p. 41-57.

• MONTEIRO, J ; LEJBMAN, A. G. V. ; FERREIRA, A. . Using Evolving Graphs Foremost Journeys to Evaluate Ad-Hoc Routing Protocols. In: 25° Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos, 2007, Belém, PA. Anais do 25° Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos, 2007. v. 1. p. 17-30.

• FERREIRA, A. ; LEJBMAN, A. G. V. ; MONTEIRO, J . On the Evaluation of Shortest Journeys in Dynamic Networks. In: 6th IEEE International Symposium on Network Computing and Applications (IEEE NCA07), 2007, Cambridge, MA. Proceedings of the 6th IEEE International Symposium on Network Computing and Applications (IEEE NCA07), 2007.

• MONTEIRO, J ; LEJBMAN, A. G. V. ; FERREIRA, A. . Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. In: 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2006, Montreal / Canadá. Proceedings of 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. Montreal / Canadá: IEEE, 2006. p. 173-180.

• Ribault,Judicael ; Peix, Fabrice ; Monteiro, Julian ; DALLE, O . OSA: an Integration Platform for Component-Based Simulation. In: International Conference On Simulation Tools And Techniques For Communications, Networks And Systems & Workshops, 2009, Rome, Italy. Proceedings of the 2nd International Conference on Simulation Tools and Techniques, 2009.

• DALLE, O ; Giroire,F ; MONTEIRO, J ; Perennes, S . Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair. In: Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications - Algotel, 2009, Carry-Le-Rouet, France. Algotel, 2009.

• MONTEIRO, J ; Perennes, S . Systèmes de stockage P2P : un guide pratique. 2010. (Apresentação de Trabalho/Simpósio).

• MONTEIRO, J ; DALLE, O . CORRAL: Stackable Copy-on-Write Versioning Device using Linux Device-Mapper. 2008. (Apresentação de Trabalho/Conferência ou palestra).

• MONTEIRO, J ; LEJBMAN, A. G. V. ; FERREIRA, A. . Using Evolving Graphs Foremost Journeys to Evaluate Ad-Hoc Routing Protocols. 2007. (Apresentação de Trabalho/Simpósio).

• MONTEIRO, J ; LEJBMAN, A. G. V. ; FERREIRA, A. . Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. 2006. (Apresentação de Trabalho/Conferência ou palestra).

Outras produções

Projetos de pesquisa

• 2007 - 2010

  SPREADS Project: Safe P2p-based REliable Architecture for Data Storage., Descrição: SPREADS is the acronym for Safe P2p-based REliable Architecture for Data Storage. It is a common research project between UbiStorage, I3S/INRIA/Mascotte, Eurecom/NSTeam, LIP6/INRIA/REGAL and LACL/SC. The project started in Dec. 2007 with a funding from the French National Research Agency (ANR) with an additional sponsorship from the SCS pole of competitivity. Many other people are working with me on this exciting project in the Mascotte team (At the time of writing, we are no less than 2 assoc. profs, 1 Research associate, 1 postdoc, 1 enginner, 3 PhD students). , Situação: Concluído; Natureza: Pesquisa. , Alunos envolvidos: Especialização: (1) / Mestrado acadêmico: (1) Doutorado: (3) . , Integrantes: Julian Geraldes Monteiro - Integrante / Stéphane Pérennes - Integrante / Olivier DALLE - Coordenador.

• 2006 - 2008

  MOBIDYN project: Combinatorial Model for Dynamic Networks, Descrição: Descrição: The highly dynamic behavior of wireless networks make them very difficult to evaluate, e.g. as far as the performance of routing algorithms is concerned. However, some of them have a predictable dynamics, as the temporal variations in the network topology are somehow deterministic. Recently, a graph theoretic model -- the \emph{evolving graphs} -- was proposed to help capture the dynamic behavior of these networks, in view of the construction of least cost routing and other algorithms. We first implemented an evolving graph based routing protocol, and then evaluated such protocol compared to other major ad-hoc protocols through simulations. Our experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive routing and stochastically predictable behavior . This proposal aims to the extend the ongoing work that has being done by the MOBIDYN project (cooperation between FAPESP and INRIA on process number 04/14303-6)... , Situação: Concluído; Natureza: Pesquisa. , Alunos envolvidos: Mestrado acadêmico: (1) Doutorado: (1) . , Integrantes: Julian Geraldes Monteiro - Integrante / Alfredo Goldman vel Lejbman - Coordenador / Afonso Ferreira - Integrante / Herve Rivano - Integrante., Financiador(es): Fundação de Amparo à Pesquisa do Estado de São Paulo - Auxílio financeiro.

• 2004 - 2006

  Combinatorial Model for Dynamic Networks, Projeto certificado pelo(a) coordenador(a) Alfredo Goldman vel Lejbman em 05/10/2013., Descrição: As technology advances in the area of wireless networks and micro-electro-mechanical, it became possible to develop enhanced wireless communication micro-processed devices, with very low-cost, low-energy consumption and extremely reduced in size. These devices, when inter-connected, create a network called Wireless Sensors Networks (WSN). There is a wide range of applications for these networks, in areas such as monitoring of environment conditions and colleting data in remote locations. These networks behavior is extremely dynamic. A key topic in this research is the routing algorithms taking into account the energy constraints. The objective of this study is to analyze a recent combinatorial model - Evolving Graphs - that can harness the complexity of evolving environments. Such modeling helps to capture the behavior of dynamic networks over time allowing the formalization and improvement of the analysis of algorithms. , Situação: Concluído; Natureza: Pesquisa. , Integrantes: Julian Geraldes Monteiro - Integrante / Alfredo Goldman vel Lejbman - Coordenador / Afonso Ferreira - Integrante., Financiador(es): Fundação de Amparo à Pesquisa do Estado de São Paulo - Auxílio financeiro.

Prêmios