On a multicast resequencer for ATM networks

With a multicast resequencer, multipoint-to-point connection can be realize d. However, a multicast resequencer also introduces extra delays. The aim o f this paper is to determine if an efficient multicast resequencer design i s possible. One simple model and one refined model with flow through are pr oposed to design the multicast resequencer. Simulation results indicate the designed resequencer is fast enough to meet the speed demand of ATM networ ks. Mean delay is within several mu s when the output link is fast enough, Cell loss rate can also be near zero when buffer size is a little larger th an the mean input PDU size and the input link is fast enough. The performan ce of the resequencer is sensitive to the speed of the output link. In our simulation, 20 Mbps of output link bandwidth is needed for a total input ba ndwidth of 4.8 Mbps to have a mean delay of less than 30 mu s for each cell . The paper also shows a resequencer can support the largest number of mult icasting groups with the same number of virtual paths if each group member is randomly distributed in a backbone network's two sides. The resequencer may provide a solution for establishing multipoint-to-point connections in ATM networks. (C) 1999 Elsevier Science Inc. All rights reserved.