| B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing multicast receivers deterministically according to packet-loss correlation," in Proc. ACM Multimedia, Bristol, U.K., Sept. 1998, pp. 201--210. |
....adds robustness by using randomcast to distribute a request randomly among receivers rather than just a single replier. Addressable Internet Multicast (AIM) 16] assigns labels to routers on a permulticast group basis, and routes requests and repairs based on these labels. OTERS [17] and Tracer [18] both employ mtrace utility to build congruent hierarchies. Finally, Active Error Recovery (AER) 19] is targeted towards an active networks environment. For further references on previous work on both end to end and router assist reliable multicast see [2] VII. CONCLUSIONS AND FUTURE WORK ....
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation," in Proceedings of the 6th ACM International Conference on Multimedia, September 1998, pp. 201--210.
....for dynamic membership. In some cases, it is indeed possible to acquire knowledge about the multicast tree. First, a receiver can use the MTRACE tool to find the multicast route and collect link loss statistics on the path towards the source. This is exactly what Tracer, a component proposed in [13] by Levine et al. does: it traces the multicast routes and collects link loss statistics. 15] also assumes a backtrack capability, that allows each receiver to track its path back to the multicast source. Second, recent work by Ratnasamy and McCanne [23] made it possible to infer the ....
B.Levine, S.Paul, J.J. Garcia-Luna-Aceves. "Organizing multicast receivers deterministically by packet-loss correlation"
....111 111 111 111 000 000 000 000 111 111 111 000 000 000 111 111 111 S Subgroup 1 Subgroup 0 link loss rate p k leaf p node n link loss rate Source Proxy link = 1 p (1 p ) n m n m m n Fig. 1. Hierarchical Reliable Multicast ponent called Tracer , was proposed in [13] exactly for this purpose. 15] also assumes such a backtrack capability, to track the path from the receiver to the source. Also, recent work in [22] and [25] made it possible to infer the topological structure and the loss probabilities based only on end to end loss prints and their ....
B. Levine, S. Paul, J.J. Garcia-Luna-Aceves. "Organizing multicast receivers deterministically by packet-loss correlation", in Proc. ACM Multimedia '98, pp.201-210, Oslo, Norway, Sept. 1998.
....by using randomcast to distribute a request randomly among receivers rather than just a single replier. Addressable Internet Multicast (AIM) 16] is a scheme that assigns labels to routers on a per multicast group basis, and routes requests and repairs based on these labels. OTERS [17] and Tracer [18] both employ mtrace utility to build congruent hierarchies. Finally, Active Error Recovery (AER) 19] is a scheme targeted towards an active networks environment. For further references on previous work on both end to end and router assist reliable multicast see [2] VII. CONCLUSIONS AND FUTURE ....
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation," in Proceedings of the 6th ACM International Conference on Multimedia, September 1998, pp. 201--210.
....choosing node b as the servicing gateway is not a good choice, since both the original and processed stream flow through b c. A better gateway is node c. Discovering the topology of the multicast tree so that it can be coorperated into AGLP is not trivial. A possible solution is described in [43]. Each participating host performs a trace of the multicast path periodically using the multicast version of traceroute called mtrace. They then share the path information with each other so that a tree can be constructed. We plan to look into how to do this in AGLP in a scalable manner. 7.2.2 ....
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically by packet-loss correlation. In Proceedings of ACM Multimedia 1998.
....suppression methods must be deployed in order to avoid multiple retransmissions from several nodes [131. A method for constructing deterministic grouping of receivers into a logical tree structure, while maintaining packet loss correlation for local error recovery, is proposed by TRACER [27]. The protocol, based on periodic tracing as a prediction of packet loss correlation, uses MTRACE packets in IGMP to provide requester and retransmitter with the name of the last router common to both. TRACER concentrates on grouping of receivers and leaves the treatment of feedback implosion to ....
B.N. Levine, S. Paul, and J.J. Garcia-Luna-Aceves, Organizing Multicast Receivers Deterministically by Packet-Loss Correlation, Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September 1998.
....Our proposed STA network has this property, at the expense of limited adaptability (when compared to schemes based on transcoding) Critical to the operation of active services is the placement of the active elements within the network. This has received considerable attention in the literature [18, 12, 5], particularly when related to reliable multicast, leading to recent standards work in the IETF [9] We do not seek to design new tree building mechanisms at present, rather we rely on existing work. Our proposal seeks to leverage existing work in the field of active services: the concept of ....
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically by packet loss correlation. In Proc. ACM Multimedia '98, Bristol, UK, September 1998.
....between a parent and children nodes at transport layer. For this, tree based protocols should allow ACK trees close to the corresponding routing trees in the presence of dynamic group membership and route changes. This issue for one to many session has been well addressed in the previous works [8][14][22] However, when a tree based protocol supports a many tomany reliable multicast session, the ACK tree maintenance overhead required for high quality is likely to be considerably large. For example, RMTP supports a many to many session by setting up a separate ACK tree for each sender [20] so ....
....operation overhead, represented by Phi value, decreases abruptly (more than linearly) as g increases. Figure 8(b) shows the tree maintenance overhead. The maintenance cost for adaptive tree reconfiguration (feedback between a parent and a child or control packets from utilities such as mtrace [14]) increases linearly with the number of logical trees multiplied by the size of these trees. For a session of GGT(Z, g) with N members, total g trees with size N are maintained. For a session of GAM(g) which denotes GAM with g = KG = jCj,totalg inter group trees with size g and g intra group ....
[Article contains additional citation context not shown here]
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing Multicast Receivers Deterministically by Packet-Loss Correlation," ACM Multimedia '98, pp. 201-210, September 1998
....losses are spatially correlated. However, these techniques increase the expected delay and also fail to lower the worst case bounds. Tree based solutions that aggregate feedback from receivers as the feedback moves up the multicast tree can alleviate the feedback problem altogether (e.g. see [LPGLA98,LLGLA96] However, these solutions impose additional processing and state at intermediate nodes within the tree. By combining a tree based solution with proactive FEC techniques can reduce the expected amounts of processing and state that these intermediate nodes incur. Extensive simulation ....
B. N. Levine, S. Paul, and J.J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically according to packetloss correlation. In Proceedings of ACM Multimedia'98, Bristol, U.K., September 1998.
....either the voluntary action of receivers joined to the group, or examination of the routing state of all routers that form the spanning tree . Indeed, this has been identi ed as a problem for management of multicast routing [6] as well as protocols providing multicast transport services [21]. IP multicast is based on an open service model. No mechanism restricts the hosts or users from creating a multicast group, receiving data from a group, or sending data to a group. Once a host joins a group, it receives all data sent to the group address regardless of the sender s source ....
B. Levine, S. Paul, and J. Garcia-Luna-Aceves. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation. In Proc. ACM Multimedia 98, September 1998. 23
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing multicast receivers deterministically according to packet-loss correlation," in Proc. ACM Multimedia, Bristol, U.K., Sept. 1998, pp. 201--210.
No context found.
LEVINE, B. N., PAUL, S., AND GARCIA-LUNAACEVES, J. Organizing multicast receivers deterministically by packet-loss correlation. In Proceedings of ACM Multimedia '98 (Bristol, UK, Sept. 1998), ACM.
No context found.
B.N. Levine, S. Paul, and J.J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically according to packet-loss correlation. In Sixth ACM International Multimedia Conference (ACM Multimedia 98), Bristol, UK, September 1998.
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically by packet loss correlation. In Proc. ACM Multimedia '98, Bristol, UK, September 1998.
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, \Organizing multicast receivers deterministically by packet loss correlation," in Proc. ACM Multimedia '98, Bristol, UK, September 1998.
No context found.
LEVINE, B. N., PAUL, S., AND GARCIA-LUNA-ACEVES, J. Organizing multicast receivers deterministically by packet-loss correlation. In Proceedings of ACM Multimedia '98 (Bristol, UK, Sept. 1998), ACM.
No context found.
LEVINE, B., PAUL, S., AND GARCIA-LUNA-ACEVES, J. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation. Proceedings of ACM Multimedia '98 (September 1998).
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically by packet loss correlation. In Proc. ACM Multimedia '98, Bristol, UK, September 1998.
No context found.
B. N. Levine, S. Paul, and J.J. Garcia-Luna-Aceves. Organizing multicast receivers deterministically according to packet-loss correlation. In Proceedings of ACM Multimedia'98, Bristol, U.K., September 1998.
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-LunaAceves, "Organizing multicast receivers deterministically by packet-loss correlation," ACM Multimedia, pp. 210--210, 1998.
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna Aceves, "Organizing Multicast Receivers Deterministically by Packet-Loss Correlation," ACM Multimedia '98, pp. 201-210, September 1998
No context found.
B. N. Levine, S. Paul, and J. J. Garcia-Luna-Aceves, "Organizing Multicast Receivers Deterministically by Packet-Loss Correlation," ACM Multimedia '98, pp. 201-210, September 1998
No context found.
B.N. Levine, S. Paul, J.J. Garcia-Luna-Aceves, "Organizing multicast receivers deterministically according to packet-loss correlation", Preprint, University of California, Santa Cruz. 11
No context found.
B.N. Levine, S. Paul, and J.J. Garcia-Luna-Aceves, Organizing Multicast Receivers Deterministically by Packet-Loss Correlation, Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September 1998.
No context found.
B. Levine, S. Paul and J. J. Garcia-Luna-Aceves. Organizing Multicast Receivers Deterministically by Packet-Loss Correlation. Preprint, University of California, Santa Cruz.
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