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

Rosario Aiello

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

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

Computer networks · 2 · 2 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
2 papers
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.021993
Causal Ordering in Reliable Group Communications · SIGCOMM 1993
Design of a Reliable Multicast Protocol · INFOCOM 1993
Distributed systems › group communication
reliable multicast
0.021993
Causal Ordering in Reliable Group Communications · SIGCOMM 1993
Design of a Reliable Multicast Protocol · INFOCOM 1993
Distributed systems › consistency models
causal ordering
0.011993
Causal Ordering in Reliable Group Communications · SIGCOMM 1993
Distributed systems
consensus
0.011993
Design of a Reliable Multicast Protocol · INFOCOM 1993

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

simulation · 0.0history buffers · 0.0centralized recovery · 0.0
YearPublicationVenuePosition
1993 Design of a Reliable Multicast Protocol
abstract
A multicast protocol that is independent of the subnetwork and can operate on the top of a basic datagram network is described. The protocol provides reliable communication among the members of a group nd guarantees that each message sent to a group G is delivered to all active, i.e. both correct and faulty, processes in G or to none of them, and that all the members of G consistently decide on the same progressive order to process messages. The focus is mainly on the design of the protocol. The protocol architecture to which it belongs is described, and some simulation results are given. An outline of the protocol algorithm, which uses a centralized approach based on the rotating coordinator paradigm, allows processes to asynchronously decide on a given value, and recovers processes from failures through history buffers, is also given.>
Rosario Aiello, Elena Pagani, Gian Paolo Rossi 0001
INFOCOM1
1993 Causal Ordering in Reliable Group Communications
abstract
In this paper we present a solution to the causal reliable multicast problem. User processes generate separate sequences of messages and specify the causal relation among them according to some application need; the algorithm ensures that the messages within the same sequence are delivered to all active, i.e. both correct and faulty, processes in the group, or to none of them, and are processed according to their causal order. Messages belonging to different sequences can be concurrently processed.This problem has few solutions presented in literature; in common with a part of them, the algorithm we describe has the centralized approach and the use of history buffers to recover from omission failures. The differences mainly concern the mechanism we devised to recover from crash failures, that avoids resorting to specialized protocols. As a consequence, under failure conditions, the algorithm performs better than other proposals in terms of both network load and throughput without affecting the performances under reliable conditions. Further, it allows to implement the most general interpretation of causality and it does not require any particular service to the underlying transport protocol.
Rosario Aiello, Elena Pagani, Gian Paolo Rossi 0001
SIGCOMM1