Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Roverli Pereira Ziwich

dblp:86/5600 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 46% Distributed systems · 23% Hardware reliability and fault tolerance · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › fault diagnosis › system-level diagnosis
comparison-based diagnosis
0.212016
A Nearly Optimal Comparison-Based Diagnosis Algorithm for Systems of Arbitrary Topology · IEEE Trans. Parallel Distributed Syst. 2016
Distributed systems
fault tolerance
0.212016
A Nearly Optimal Comparison-Based Diagnosis Algorithm for Systems of Arbitrary Topology · IEEE Trans. Parallel Distributed Syst. 2016
Electronic design automation › hardware verification and test › fault diagnosis
system-level diagnosis
0.212016
A Nearly Optimal Comparison-Based Diagnosis Algorithm for Systems of Arbitrary Topology · IEEE Trans. Parallel Distributed Syst. 2016
Hardware reliability and fault tolerance › system diagnosis
t-diagnosable systems
0.212016
A Nearly Optimal Comparison-Based Diagnosis Algorithm for Systems of Arbitrary Topology · IEEE Trans. Parallel Distributed Syst. 2016

Methods — techniques the papers use, named apart from their topics

simulation · 0.2comparison-based diagnosis · 0.2
YearPublicationVenuePosition
2020 Distributed mitigation of content pollution in peer-to-peer video streaming networks
abstract
Video streaming has become increasingly popular in the Internet. Frequently, video transmissions are based on peer‐to‐peer networks, in which peers running on end‐user hosts transmit data among themselves. An important security vulnerability of this strategy is that content can be easily altered by malicious users. Thus, it becomes essential to diagnose and fight content pollution in these systems. In this work, the authors present a novel strategy that relies on comparison‐based diagnosis to mitigate content pollution in live video streaming peer‐to‐peer networks. This strategy is fully distributed and effectively combats the dissemination of content pollution. In the strategy, peers independently identify and avoid polluters. The solution works on top of the scalable overlay network Fireflies. Experimental results are presented showing the effectiveness and the low overhead of the solution. In particular, the strategy was able to significantly reduce content pollution propagation in diverse network configurations.
Roverli Pereira Ziwich, Elias P. Duarte Jr., Glaucio P. Silveira
IET Commun.1
2016 A Nearly Optimal Comparison-Based Diagnosis Algorithm for Systems of Arbitrary Topology
abstract
Comparison-based diagnosis is a practical approach to detect faults in hardware, software, and parallel and distributed systems. Diagnosis is based on the comparison of task outputs returned by pairs of system units. This work introduces a novel diagnosis algorithm to identify faults in$t$-diagnosable systems of arbitrary topology under the MM* model. The complexity of the proposed algorithm is$O(t^2 \Delta N)$in the worst case for a system with$N$units, where$t$denotes the maximum number of faulty units allowed and$\Delta$corresponds to the maximum degree of a unit in the system. This complexity is nearly optimal in the sense that it is very close to that of traversing the syndrome once. Besides the algorithm specification and correctness proofs, simulations results are also presented, showing the typical performance of the algorithm for different systems.
Roverli Pereira Ziwich, Elias P. Duarte Jr.
IEEE Trans. Parallel Distributed Syst.1