| Brian Neil Levine and J. J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5):334-348, 1998. |
....from every receiver for every packet sent. A lost packet is detected when an ACK fails to arrive from one or more receivers. When a loss is detected, the packet is retransmitted and the sender again waits for an ACK from every receiver. Such sender initiated protocols suffer from ACK implosion [33, 34], in which a flood of acknowledgments arrives in response to each packet sent, as shown in Figure 12. Increasing amounts of network bandwidth and processing time are consumed as the number of receivers in the group increases, which limits the group size that such protocols can accommodate. ....
B.N. Levine and J.J. Garcia-Luna-Aceves, "A Comparison of Reliable Multicast Protocols," ACM Multimedia Systems J. 6 (5), 1998, pp. 334--338, <http://www.cse.ucsc.edu/research/ ccrg/publications/brian.mmsj.ps.gz>.
....queuing delay in detail and neglect feedback processing. They concluded that local recovery techniques and parity packets outperform other approaches. Our analysis is based on the delay analysis of Yamamoto et al. 7] and on the basic analytical work of Pingali et al. 10] and Levine et al. [11]. Pingali et al. have done the first comparative analysis of reliable multicast protocols. They have compared the processing requirements of flat protocol classes. Levine et al. have extended this work to the class of ring and tree based approaches. To our knowledge, our work is the first ....
....results with simulation studies. 3 Protocol Classification and Description In this section we briefly describe and classify the reliable multicast protocols analyzed and simulated in this paper. A more detailed and more general description for some of these classes can be found in [10] [11] and [9] The first considered protocol class is a receiver initiated protocol. Receiverinitiated protocols return only negative acknowledgments (NACKs) from receivers to the sender instead of positive acknowledgements (ACKs) When a receiver detects an error, e.g. by a wrong checksum, a skip in ....
[Article contains additional citation context not shown here]
Levine, B., Garcia-Luna-Aceves, J.: A comparison of reliable multicast protocols. Multimedia Systems 6 (1998) 334--348
....A main advantage that multicast based solutions have over client server solutions is their often inherent decentralized nature. This makes these solutions particularly attractive for large scale networks, except that building scalable reliable multicasting schemes is notoriously difficult [4], 5] Fortunately, matters improve when dealing with probabilistic schemes in which no hard guarantees are given concerning the delivery of a multicast message. If a multicast message is required to be only eventually delivered with a high probability to all current group members, it appears that ....
Brian Neil Levine and Jose J. Garcia-Luna-Aceves, "A comparison of reliable multicast protocols," Multimedia Systems, vol. 6, no. 5, pp. 334--348, 1998.
....communication identifies a body of research whose goal is to provide mechanisms for reliable communication among a group of possibly remote processes, and in addition to guarantee some degree of ordering and atomicity [5] of message delivery. Under this umbrella fall reliable multicast protocols [10, 11] as well as more complex systems such as Isis [2] and Horus [20] In contrast to these goals, the main purpose of contentbased publish subscribe middleware is to distribute messages (i.e. events) to all the interested parties based on their content and to do so in a scalable and e#cient way. ....
B. Levine and J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. ACM Multimedia Systems Journal, 6(5):334--348, August 1998.
....However, it also increases duplicate packets on the topology by nearly 10 . V. RELATED WORK A large number of research proposals have addressed reliable delivery for multicast data, most notably in the context of network layer multicast. A comparative survey of these protocols is given in [12] and [22] In SRM [7] receivers send NAKs to the source to indicate missing data packets. Each such NAK is multicast to the entire group and is used to suppress NAKs from other receivers that did not get the same packet. In this approach, however, a few receivers behind a lossy link can incur a ....
B. Levine and J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems Journal, 6(5), Aug. 1998.
....build a hierarchy of subgroups and localize the error recovery. Assumption 4 describes a generic scheme inside each subgroup: proxy based error recovery with multicast retransmissions. There are many other available options very well summarized in [9] analytically compared in a number of studies [22, 25, 12]. Details of feedback and congestion control are ignored here. Our performance metrics capture the total transmissions needed to deliver a packet correctly to all members. If there is no loss, there should be only one transmission per packet. If there are losses, there are extra retransmissions ....
....1 to reliably deliver a single packet to the entire group, or for the proxy of Figure 2 to reliably deliver a packet to the entire subgroup. 3. 1 The E[M] Measure E[M] is an important measure, which first appeared in [1] and ever since has been used in most analytical work on Reliable Multicast [18, 20, 19, 22, 25, 12]. n l pn pl Figure 2. Inside a subgroup E[M] is defined to be the expected number of times that a packet should be multicast (original transmission retransmissions) by the source, until all group members receive it correctly, at least once. It depends on the shape of the tree and the link ....
B.N. Levine and J.J. Garcia-Luna-Aceves, "A Comparison of Reliable Multicast Protocols", in ACM Multimedia Systems Journal, August 1998
....reliable multicast, filtered layered multicast, as well as other security concerns. 7.2. 1 Reliable Multicast Although the original model for multicasting was based on the best e#ort unreliable delivery model of UDP, there has been considerable interest in developing a reliable multicast model [100, 101, 102, 103, 104]. Reliable multicast is especially applicable for areas such as content distribution networks (CDN) Both of the proposed architectures are compatible with reliable multicasting schemes but with several caveats. First, a reliable multicast scheme implies that per group monitoring is taking place ....
B. Levine and J. J. Garcia-Luna-Aceves, "A comparison of reliable multicast protocols," Multimedia Systems, vol. 6, no. 5, pp. 334--348, 1998.
.... These protocols are proven most scalable in terms of maximum throughput and end point bandwidth since they can ensure that the sender processing time is bounded by the number of the sender s children, which remains constant in their tree hierarchy regardless of the number of receivers [13][18] A limitation of the tree based reliable multicast protocols is that their best performance can be achieved when the ACK tree is close to its corresponding multicast routing tree. In such a high quality ACK tree, the underlying network layer correlation in terms of packet loss and delay is ....
B. N. Levine and J. J. Garcia-Luna-Aceves, "A Comparison of Reliable Multicast Protocols," ACM Multimedia Systems, 6, pp. 334-348, 1998
No context found.
Brian Neil Levine and J.J. Garcia-Luna-Aceves. A Comparison of Reliable Multicast Protocols. Multimedia Systems, 6(5):334-348, August 1998.
No context found.
B.N. Levine and J.J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems Journal (ACM/Springer), 6(5), August 1998.
....nodes have public private key pairs for establishing secure channels to communicate over, and the computation of unicast paths composed of nodes authorized to participate in the active session. The reliability required of APDP is, similar to reliability required of traditional multicast services [9], the assurances that all packets from each source are delivered to each member of the session within a finite amount of time and free of errors, and that packets are safely deleted at the source within a finite time. These assurances are required so that applications using APDP know when ....
....it generates, ideally requiring only one packet on each link used to reach session members. However, the additional requirements of APDP beyond those of traditional multicast pose significant challenges. APDP must be reliable. While work has been done on reliability for traditional multicast [9] no designs have been implemented and widely deployed. APDP must be secure in two senses: security of the data itself, and control of the distribution of the data. Security of the data itself involves the authorization of senders and receivers to access group traffic, and the cryptographic ....
Brian Neil Levine and J.J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5), August 1998.
No context found.
Brian Neil Levine and J. J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5):334-348, 1998.
No context found.
B. N. Levine and J. J. G.-L.-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5):334--348, 1998.
No context found.
Levine, B. N. and Garcia-Luna-Aceves, J. 1998. A comparison of reliable multicast protocols. Multimedia Systems 6, 5, 334--348.
No context found.
B.N. Levine and J.J. Garcia-Luna-Aceves, A Comparison of Reliable Multicast Protocols, ACM Multimedia Systems, August 1998.
No context found.
B. Levine and J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems Journal, 6(5), Aug. 1998.
No context found.
Brian Neil Levine and J. J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. ACM Multimedia Systems Journal, 6(5), August 1998. brian.mmsj.ps.gz>.
No context found.
B. Levine and J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems Journal, 6(5), Aug. 1998.
No context found.
Brian N. Levine and J.J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5):334--348, 1998.
No context found.
B. Levine and J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems Journal, 6(5), Aug. 1998.
No context found.
B.N. Levine and J.J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. ACM Multimedia Systems Journal, 6(5):334--348, August 1998.
No context found.
B. N. Levine and J. J. Garcia-Luna Aceves, "A Comparison of Reliable Multicast Protocols," ACM Multimedia Systems, 6, pp. 334-348, 1998
No context found.
B. N. Levine and J. J. Garcia-Luna-Aceves, "A Comparison of Reliable Multicast Protocols," ACM Multimedia Systems, 6, pp. 334-348, 1998
No context found.
B. Levine, J. Garcia-Luna-Aceves, A comparison of reliable multicast protocols, Multimedia Systems 6 (5) (1998) 334--348.
No context found.
B. Levine and J. J. Garcia-Luna-Aceves. A Comparison of Reliable Multicast Protocols. ACM Multimedia Systems Journal, August 1998.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC