An analysis tool for predicting performance in an all-optical time division multiplexing data switch

Performance of shared memory architectures for optical switching is typically obtained by simulation, and in low packet loss regions is subject to statistical error or excessive computer run times. To obtain a reliable measure of performance, a Markov chain with a small number of states has been developed to model the switch's behavior. This reduced chain is derived from a full Markov chain which more directly models the switch. Equations to count the number of states for both Markov chains are derived. Packet loss results derived from the reduced Markov chain are compared with simulation results.

[1]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[2]  Mark J. Karol Shared-memory optical packet (ATM) switch , 1993, Optics & Photonics.

[3]  Mark J. Karol Queuing in optical packet switches , 1992, Other Conferences.

[4]  Vijay P. Kumar,et al.  On the multiple shared memory module approach to ATM switching , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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