Lin, J.C.a.P.S. RMTP: A reliable multicast protocol. in Proceedings of IEEE INFOCOM'96. 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....routing graph has several significant impacts both on the protocol performance and network utilization. In multicast packing problem the choice of routing graph is more important since network resources need to be shared. There are two proposals for multicast routing backbone: i) tree based [8, 22, 23, 9, 17], and (ii) ring based [5, 19, 1] However, a combinatorial comparison of the optimal multicast tree and ring topology reports that closing the cycle may require as many as 25 more links [24] Thus, in this work we focus on the packing of multicast trees. The underlying problem for the optimum ....

J. C. Lin and S. Paul. Rmtp: A reliable multicast protocol. Proc. IEEE INFOCOM'96, pages 1414--1425, March 1996.

....This work was supported in part by the Office of Naval Research under Grant N00014 96 1 0825. it. If a multicast protocol is designed for a ring subgraph (see [4, 16, 1] then the propagation delay will be linear in the size of the ring. In contrast, if a tree topology is chosen (e.g. [6, 7, 13]) then the propagation delay will be logarithmic instead of linear. However, a ring provides a total order for message delivery naturally (since each node has one inand one out going link) whereas extra care must be taken in a tree to ensure total order. Second, it affects utilization of network ....

J. C. Lin and S. Paul. Rmtp: A reliable multicast protocol. Proc. IEEE INFOCOM'96, pages 1414--1425, March 1996.

No context found.

Lin, J.C.a.P.S. RMTP: A reliable multicast protocol. in Proceedings of IEEE INFOCOM'96. 1996.

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