Communicating with virtual paths and virtual channels
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
Communications of the ACM
ATM: theory and application
ISDN and broadband ISDN with frame relay and ATM (3rd ed.)
ISDN and broadband ISDN with frame relay and ATM (3rd ed.)
Analysis of a Resequencer Model for Multicast over ATM Networks
Proceedings of the Third International Workshop on Network and Operating System Support for Digital Audio and Video
The Ordered Core Based Tree Protocol
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A model for virtual tree bandwidth allocation in ATM networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
New directions in communications (or which way to the information age?)
IEEE Communications Magazine
IP multicasting over ATM networks
IEEE Journal on Selected Areas in Communications
SMART: a many-to-many multicast protocol for ATM
IEEE Journal on Selected Areas in Communications
Performance of shared-memory switches under multicast bursty traffic
IEEE Journal on Selected Areas in Communications
Communication systems supporting multimedia multi-user applications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.07 |
With a multicast resequencer, multipoint-to-point connection can be realized. However, a multicast resequencer also introduces extra delays. The aim of this paper is to determine if an efficient multicast resequencer design is possible. One simple model and one refined model with flow through are proposed to design the multicast resequencer. Simulation results indicate the designed resequencer is fast enough to meet the speed demand of ATM networks. Mean delay is within several @ms when the output link is fast enough. Cell loss rate can also be near zero when buffer size is a little larger than the mean input PDU size and the input link is fast enough. The performance 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 bandwidth of 4.8 Mbps to have a mean delay of less than 30 @ms for each cell. The paper also shows a resequencer can support the largest number of multicasting 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.