| P. V. Mieghem, G. Hooghiemstra, and R. van der Hofstad. On the efficiency of multicast. IEEE/ACM Transactions on Networking, 9(6):719--732, 2001. |
....distance) They provided a theoretical result which roughly obeys the Chuang Sirbu law for IP multicast scaling [10] This law asserts that multicast tree size increases as n 0.8 , where n is the group size. This was generalized in [7] for more realistic multicast tree shapes. The authors of [24] considered a stricter approximation of the link cost reduction. Their results show that the Chuang Sirbu law is not asymptotic for random graphs and k ary trees. Recently, 1] also re examined the analysis in [25] and provided precise asymptotic scaling behavior of tree size. This asymptotic term ....
P. V. Mieghem, G. Hooghiemstra, and R. van der Hofstad. On the efficiency of multicast. IEEE/ACM Transactions on Networking, 9(6):719--732, 2001.
No context found.
P. V. Mieghem, G. Hooghiemstra, and R. van der Hofstad. On the efficiency of multicast. IEEE/ACM Transactions on Networking, 9(6):719--732, 2001.
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