Antonio Carzaniga

Computer Networks and Communications · 2000–2004

A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 21 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 9 citations into it; #1,609 of 9,886 by trust here, #3,005 by citations

Whom Antonio Carzaniga trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Alexander L. Wolf
2. David S. Rosenblum
3. Alberto Medina
4. David R. Cheriton
5. Ion Stoica
6. Florin Baboescu
7. Gianpaolo Cugola
8. Anukool Lakhina

Who trusts Antonio Carzaniga overall

1. Patrick Th. Eugster
2. J. Whitehead
3. Pascal Felber
4. Peter R. Pietzuch
5. Mazeiar Salehie
6. Alexander L. Wolf
7. Matthew J. Rutherford
8. Ashwin R. Bharambe
9. Robbert van Renesse
10. Anita Sarma

Papers from Antonio Carzaniga's perspective

Ordered by how strongly the researchers Antonio Carzaniga trusts endorse each paper. Same corpus, a different order for every researcher.

1. Achieving scalability and expressiveness in an Internet-scale event notification service (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
2. Scalable packet classification (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
3. An Architecture for Content Routing Support in the Internet (USENIX Symposium on Internet Technologies and Systems)
4. Forwarding in a content-based network (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
5. Java message service
6. Filtering algorithms and implementation for very fast publish/subscribe systems (ACM SIGMOD Conference)
7. Internet indirection infrastructure (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
8. BRITE: an approach to universal topology generation (MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems)
9. A random graph model for massive graphs (Symposium on the Theory of Computing)
10. On inferring autonomous system relationships in the Internet (Global Communications Conference)

Their papers

• A routing scheme for content-based networking (2004) — 431 citations
• Forwarding in a content-based network (2003) — 400 citations
• Design and evaluation of a wide-area event notification service (2001) — 1,703 citations
• Achieving scalability and expressiveness in an Internet-scale event notification service (2000) — 452 citations