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

Tony Ballardie

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

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

Computer networks · 1 · 1 first-authorSecurity and privacy · 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 networks
2 papers
Routing and switching · 55% Internet architecture and protocols · 45%
Network and information security
1 paper
Network security · 50% Authentication and access control · 50%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
multicast
0.011995
Multicast-specific security threats and counter-measures · NDSS 1995
Authentication and access control › access control › multi-user access control
group access control
0.011995
Multicast-specific security threats and counter-measures · NDSS 1995
Network security › secure communication › secure group communication
secure multicast
0.011995
Multicast-specific security threats and counter-measures · NDSS 1995
Routing and switching › multicast routing
core-based trees
0.011993
Core Based Trees (CBT) · SIGCOMM 1993
Routing and switching
multicast routing
0.011993
Core Based Trees (CBT) · SIGCOMM 1993
Internet architecture and protocols › multicast
multicast architecture
0.011993
Core Based Trees (CBT) · SIGCOMM 1993

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

protocol design · 0.0
YearPublicationVenuePosition
1995 Multicast-specific security threats and counter-measures
abstract
Security issues in multicast communication have rarely been touched upon to date. We believe that wide-area multicast communication is at a substantially increased risk from specific security threats, compared with the same threats in unicast. This arises both from the lack of any form of effective group access control, and from the fact that multicast traffic traverses potentially many more communication links than does a single unicast communication, thereby creating more opportunity for a link attack. We discuss specific threats that are relevant to multicast, and explain why they are so. We propose security mechanisms specifically for multicast groups requiring safeguards that afford protection against some of these threats. More precisely, we propose a version of the IGMP protocol that can reliably enforce subnet-level group access control. We also describe a scalable mechanism to control multicast traffic in transit that can, for example, prevent a misbehaving source from causing undue congestion over the wide-area.>
Tony Ballardie, Jon Crowcroft
NDSS1
1993 Core Based Trees (CBT)
abstract
One of the central problems in one-to-many wide-area communications is forming the delivery tree - the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these.In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms.
Tony Ballardie, Paul Francis, Jon Crowcroft
SIGCOMM1