We examine vulnerabilities of several reliable multicast protocols. The various mechanisms employed by these protocols to provide reliability can present vulnerabilities. We show how some of these vulnerabilities can be exploited in denial-of-service attacks, and discuss potential mechanisms

multicast protocol. This approach (proposed previously as “hierarchical multicores”) has the obvious goal of scalability through state reduction (limiting growth of the amount of information to be stored with network growth). Our investigations come in several flavors that can be characterized as: graph

Reliable multicast protocols can strongly simplify the design of distributed applications. However, it is hard to sustain a high multicast throughput when groups are large and heterogeneous. In an attempt to overcome this limitation, previous work has focused on weakening reliability properties

This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears an undue portion

Abstract. The publish/subscribe (or pub/sub) paradigm is a simple and easy to use model for interconnecting applications in a distributed environment. Many existing pub/sub systems are based on pre-defined subjects, and hence are able to exploit multicast technologies to provide scalability

Abstract. Traditional reliable multicast protocols depend on assumptions about flow control and reliability mechanisms, and they suffer from a kind of interference between these mechanisms. This in turn affects the overall performance, throughput and scalability of group applications utilizing

Abstract. Reliable multicast protocols provide all-or-none delivery to participants. Traditionally, such protocols suffer from large buffering re-quirements, as receivers have to buffer messages, and buffer sizes grow with the number of participants. In this paper, we describe an opti

In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge

This Ph.D. dissertation investigates protocols for a gigabit-per-second local-area network (LAN) as the successor to the first generation of 10 Mbit/s Ethernet and Token Ring LANs, and the second and current generation of 100 Mbit/s Fast Ethernet, FDDI, DQDB-MANs and 155 Mbit/s ATM networks

Pragmatic General Multicast (PGM) is a reliable multicast transport protocol that runs over a best effort datagram service, such as IP multicast. PGM obtains scalability via hierarchy, forward error correction, NAK elimination, and NAK suppression. It employs a novel polling scheme for NAK delay