By Topic

A Markov chain model for replicate-at-send multicasting in shared-memory ATM switches

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

3 Author(s)
Ho, J.D. ; Sch. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, Vic., Australia ; Singh, S. ; Sharma, N.K.

Replicate-at-send multicasting has the best performance of the multicasting schemes for shared-memory ATM switches. Specifically replicate-at-send-distinct address queue multicasting is the most adopted implementation because of its low hardware requirements. We present an analytical model for shared-memory switches with replicate-at-send-distinct address queue multicasting. Under various input traffic conditions the analytical model is shown to be accurate when compared to simulation results. We demonstrate that the model is accurate for a range of loads, with different ratios of multicast traffic and for a range of fanout sizes

Published in:

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE  (Volume:1 )

Date of Conference: