Analysis of the Spanning Tree and Source Routing LAN Interconnection Schemes

The paper presents an analysis of the performances of local area networks interconnected according to the Spanning Tree and Source Routing techniques proposed in the framework of the IEEE 802 committee. The study is mainly based on simulation models; some approximated analytical results are also presented.

[1]  Mario Gerla,et al.  LAN interconnection: a transparent, shortest-path approach , 1991, ICC 91 International Conference on Communications Conference Record.

[2]  G. S. Fishman.  Principles of Discrete Event Simulation , 1978 .

[3]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[4]  S. C. Bruell,et al.  Mean value analysis of mixed, multiple class BCMP networks with load dependent service stations , 1984, Perform. Evaluation.

[5]  Fouad A. Tobagi,et al.  Advances in Local Area Networks , 1987 .

[6]  O. J. Dahl,et al.  Simula Begin , 1979 .

[7]  Daniel A. Pitt,et al.  Table-Free Bridging , 1987, IEEE J. Sel. Areas Commun..

[8]  San-qi Li,et al.  A Study of Slot Reuse in Dual Bus Multiple Access Networks , 1991, IEEE J. Sel. Areas Commun..

[9]  R. Perlman,et al.  Comparison of two LAN bridge approaches , 1988, IEEE Network.

[10]  Gianfranco Balbo,et al.  A Mean Value Analysis Based Package for the Solution of Product-Form Queueing Network Models , 1984 .

[11]  L. Zhang.  Comparison of two bridge routing approaches , 1988, IEEE Network.

[12]  F. Backes.  Transparent bridges for interconnection of IEEE 802 LANs , 1988, IEEE Network.

[13]  D.A. Pitt,et al.  Addressing, bridging, and source routing (LAN interconnection) , 1988, IEEE Network.

[14]  Radia Perlman,et al.  An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.

[15]  Ernst G. Ulrich.  Event manipulation for discrete simulations requiring large numbers of events , 1978, CACM.