By Topic

Performance analysis and simulation of multicast networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yuanyuan Yang ; Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA ; Jianchao Wang

In this paper, we look into the issue of supporting multicast in the well-known three-stage Clos network or ν(m, n, r) network. We first develop an analytical model for the blocking probability of the ν(m, n, r) multicast network, and then study the blocking behavior of the network under various routing control strategies through simulations. Our analytical and simulation results show that a ν(m, n, r) network with a small number of middle switches m, such as m=n+c or dn, where c and d are small constants, is almost nonblocking for multicast connections, although theoretically it requires m⩾Θ (nlog r/log log r) to achieve nonblocking for multicast connections. We also demonstrate that routing control strategies are effective for reducing the blocking probability of the multicast network. The best routing control strategy can provide a factor of 2 to 3 performance improvement over random routing. The results indicate that a ν(m, n, r) network with a comparable cost to a permutation network can provide cost-effective support for multicast communication

Published in:

Parallel Processing, 1997., Proceedings of the 1997 International Conference on

Date of Conference:

11-15 Aug 1997