By Topic

Performance analysis of k-fold 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
$33 $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)
Zhenghao Zhang ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY, USA ; Yuanyuan Yang

Multicast involves transmitting information from a single source to multiple destinations, and is an important operation in high-performance networks. A k-fold multicast network was previously proposed as a cost-effective solution to provide better QoS functions in supporting multicast communication. To give a quantitative basis for network designers to determine the suitable value of system parameter k under different traffic loads, in this paper we propose an analytical model for the performance of k-fold multicast networks under Poisson traffic. We first give the stationary distribution of network states and then derive the throughput and blocking probability of the network. We also conduct simulations to validate the analytical model and the results show that the analytical model is very accurate under the assumptions we make. The analytical and simulation results reveal that by increasing the fold of the network, network throughput increases almost exponentially when the fanouts of multicast connections are relatively small compared to the network size.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002