Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Machine-learning-based soft-failure localization with partial software-defined networking telemetryMayer, Kayol S. ; Soares, Jonathan A. ; Pinto, Rossano P. ; Rothenberg, Christian E. ; Arantes, Dalton S. ; Mello, Darli A. A.Journal of optical communications and networking, 2021-10, Vol.13 (10), p.E122-E131 [Periódico revisado por pares]Piscataway: Optica Publishing GroupTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Eventually Strong Failure Detector with Unknown MembershipGreve, F. ; Sens, P. ; Arantes, L. ; Simon, V.Computer journal, 2012-12, Vol.55 (12), p.1507-1524 [Periódico revisado por pares]Oxford: Oxford Publishing Limited (England)Texto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
Fair Comparison of Gossip Algorithms over Large-Scale Random TopologiesRuijing Hu ; Sopena, J. ; Arantes, L. ; Sens, P. ; Demeure, I.2012 IEEE 31st Symposium on Reliable Distributed Systems, 2012, p.331-340IEEETexto completo disponível |
4 |
Material Type: Ata de Congresso
|
![]() |
A Communication-Efficient Causal Broadcast Protocolde Araujo, João Paulo ; Arantes, Luciana ; Júnior, Elias P. Duarte ; Rodrigues, Luiz A. ; Sens, PierreProceedings of the 47th International Conference on Parallel Processing, 2018, p.1-10New York, NY, USA: ACMTexto completo disponível |
5 |
Material Type: Ata de Congresso
|
![]() |
Formalization of the Necessary and Sufficient Connectivity Conditions to the Distributed Mutual Exclusion Problem in Dynamic NetworksFloriano, P. ; Goldman, A. ; Arantes, L.2011 IEEE 10th International Symposium on Network Computing and Applications, 2011, p.203-210IEEETexto completo disponível |
6 |
Material Type: Ata de Congresso
|
![]() |
Fault Tolerant K-Mutual Exclusion Algorithm Using Failure DetectorBouillageut, M. ; Arantes, L. ; Sens, P.2008 International Symposium on Parallel and Distributed Computing, 2008, p.343-350IEEETexto completo disponível |