A performance analysis of a parallel communications scheme for ATM networks

A parallel communications scheme for broadband networks was proposed previously. In this scheme, the traffic of a connection is split into m substreams, which are then coded into k/spl ges/m streams for delivery over k separate subchannels. This paper is an attempt toward a more careful study of the scheme. In particular, the average queueing length and mean delay time at a switch are derived analytically using a general bulk arrival source model taking into account the reduction of traffic burstiness (due to traffic splitting) and increase of traffic load (due to coding). The cell-loss probability with finite buffer are investigated by means of simulation. The relative performance of the scheme with no splitting, splitting without coding, splitting with coding at the switch are described in detail.

[1]  Soung Chang Liew,et al.  A fundamental property for traffic management in ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[2]  Soung Chang Liew,et al.  Comparison of Buffering Strategies for Asymmetric Packet Switch Modules , 1991, IEEE J. Sel. Areas Commun..

[3]  Lars Dittmann,et al.  String Mode-A New Concept for Performance Improvement of ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[4]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[5]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[6]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[7]  Soung Chang Liew,et al.  Parallel communications for ATM network control and management , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.