{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:34:36Z","timestamp":1777901676874,"version":"3.51.4"},"reference-count":38,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[1992,2]]},"abstract":"<jats:p>We describe the adoption of simulation techniques to test the operation of a new Self-Stabilizing Bridge Protocol [4; 24] and compare its perfonnance with that of an existing industry standard. Specifically, the experiments relate to the comparison of the IEEE 802.1 (D) Spanning Tree Algorithm [25; 26] as the industry standard, with a newly proposed Loop-Detect Packet based Self-Stabilizing Bridge Protocol. The language chosen for this work was Pascal Plus, which is an extension of Standard Pascal providing concurrent programming structures such as Processes and Monitors. The role of simulation in Cornmunications and Networks is highlighted and previous work surveyed. The problem under investigation relates to the use of devices, called Bridges, to connect two or more Local Area Networks (LANS) to form a larger interconnected system termed a Multi-LAN. Over recent years, reliability of communications systems has become an overwhelming concern to network managers. In order to increase reliability at the multi-LAN scale, it is usual to install parallel Bridges, thereby providing alternate paths between neighboring LANs. The inherent problem with such an approach is that it may lead to,more than one Bridge forwarding the same traffic to and from the adjacent LANs which they connect. This can cause duplicate packets, unnecessary traffic loading and, in some cases infinite looping of packets which severely degrade the performance of the communications channel they traverse. The IEEE 802.1 committee have defined an algorithm to address these problems, known as the Spanning Tree Algorithm. Although the underlying physical topology may be an arbitrary mesh, this scheme prunes the topology to a logical topology with no cycles. It does so by electing a single ROOT Bridge for the entire system, and subsequently electing a single Designated Bridge (active) for each LAN, with all other parallel Bridges assigned Backup status (passive). After the algorithm has converged, the Root is responsible for maintaining the logical tree, by periodically transmitting HELLO packets on all of its ports, which traverse the logical tree with the assistance of Designated Bridges. On receiving such HELLO packets, the Designated Bridges assume the logical topology is intact and forward the respective HELLO packets on their otihvard ports. However, if a Designated Bridge does not receive an HELLO packet within the defined timeout, it must assurne that the logical connectivity has been broken, and takes steps to regain status-quo. From a detailed investigation of the Spanning Tree Algorithm, several weaknesses in its design were discovered including the fact that it does not automatically make any attempt to limit the scope of maintenance traffic to those areas with cycles, and it is based on a centralized philosophy and as such, the failure of the Root forces the remaining Bridges to recornpute their slates from scratch. A new algorithm was designed by the Authors to overcome most of the problems with the existing standard. In particular, having pruned the physical tapology to a logical tree by use of special Loop Detect packets, the new algorithm places the responsibility of maintaining the logical connecfivity on the Backup (off) Bridges. The consequcence of this feature is that the Bridges concerned with maintaining the logical topology can fail, withont any dismption to the existing connectivity, as would be the case in the IEEE standard. By use of additional facilities the new algorithm also restricts the scope of maintenance traffic to those areas with cycles. Given the difficulties in using existing networks for protocol development (or any other software development for that matter), we opted for simulation in Pascal Plus as a means to test and validate the operation of our new protocol. To do this we adopted a layered approach to model conceptualization, which attempted to reflect the ISO OSI Reference Model. We present the simulation results and conclusions supporting the use of modelling techniques in the constantly evolving area of communications and networks which should assist others in assessing the practical issues involved.<\/jats:p>","DOI":"10.1177\/003754979205800205","type":"journal-article","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T11:09:15Z","timestamp":1499339355000},"page":"109-122","source":"Crossref","is-referenced-by-count":0,"title":["Layered simulation of Bridge protocols for Multi-LAN Ethernet Communication Systems"],"prefix":"10.1177","volume":"58","author":[{"given":"Gerard","family":"Parr","sequence":"first","affiliation":[{"name":"Department of Applied Computing Faculty of Informatics University of Ulster, Magee College Derry City Northern Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Bielkowicz","sequence":"additional","affiliation":[{"name":"Department of Computing and Information Systems City Polytechnic of London 100 Minories Tower Hill London, EC3N 1JY, England"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1992,2,1]]},"reference":[{"issue":"4","key":"atypb1","first-page":"66","volume":"18","author":"Almes, Guy T.","year":"1988","journal-title":"ACM Sigcomm Symposium"},{"issue":"4","key":"atypb2","first-page":"463","volume":"9","author":"Bernard, Guy","year":"1988","journal-title":"IEEE Trans. Soft. Eng."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1145\/74681.74687"},{"key":"atypb4","volume-title":"Presented at the International Conference on Systems Management","author":"Bielkowicz, Piotr"},{"key":"atypb5","volume-title":"Possibilities of Simulating Complicated Road Traffic Processes","author":"Bottger, R.","year":"1986"},{"key":"atypb6","volume-title":"Language Structures for Modular Multiprogramming\", Ph.D Thesis","author":"Bustard, David W.","year":"1980"},{"key":"atypb7","unstructured":"Bustard, David W. \"Pascal Plus In Biased Perspective\", Department of Computer Science Report, Queens University, 1984, pp. 1-18."},{"key":"atypb8","volume-title":"Concurrent Program Structures","author":"Bustard, David.","year":"1988"},{"key":"atypb9","volume-title":"Yemini, Yechiam, \"Nest: A Network Simulation and Prototyping Tool\"","author":"Dupuy, Alexander.","year":"1988"},{"issue":"4","key":"atypb10","first-page":"441","volume":"36","author":"Gonsalves, Timothy A.","year":"1988","journal-title":"Comm"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1147\/rd.292.0194"},{"key":"atypb12","volume-title":"Extending the","author":"Hart, John","year":"1988"},{"key":"atypb13","first-page":"51","author":"Heck, Elke","year":"1988","journal-title":"IEEE Trans. Comms."},{"issue":"4","key":"atypb14","first-page":"210","volume":"3","author":"Hughes, H.D.","year":"1982","journal-title":"Computer Performance"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233511"},{"key":"atypb16","unstructured":"Kirchem, M.J.G. \"Performance Analysis and Simulation of Local Area Computer Networks using CSMA Protocols\", B.Sc. Eng. Project, Durham University, June 1988, pp.1-64."},{"key":"atypb17","volume-title":"Programming Styles and Languages, General Reference","author":"Kreutzer, Wolfgang","year":"1986"},{"key":"atypb18","unstructured":"Matsumura, Hisashi , \" Simulation Study of a Local Area Network Contention Bus with Priority Channels\", M.Sc. Thesis, George Washington University, Sept. 1985, pp.1-58."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1145\/1013812.18182"},{"key":"atypb20","volume-title":"IEEE 5th UK Teletraffic Symp","author":"Nichols, S.J."},{"key":"atypb21","volume-title":"British Computer Society, Young Professional Group Conference","author":"Parr, Gerard"},{"key":"atypb22","volume":"1029","author":"Parr, Gerard","year":"1988","journal-title":"ARPANET RFC"},{"key":"atypb23","volume-title":"Support for,a Self-Stabilizing Ethernet Bridge Protocol Using Fault Tolerant Address Resolution\", DECUS Con ference","author":"Parr, Gerard","year":"1989"},{"key":"atypb24","volume-title":"A New Self-Stabilizing Bridge Protocol For Extended-Local Area Networks\", Ph.D Thesis","author":"Parr, Gerard","year":"1990"},{"key":"atypb25","volume-title":"ACM Sigcomm Symposium","author":"Perlman, Radia"},{"key":"atypb26","volume-title":"Network Layer Protocols With Byzantine Robustness","author":"Perlman, Radia","year":"1988"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52330"},{"key":"atypb28","volume-title":"MAC Bridge Project: Simulation\", M.Sc. Dissertation","author":"Plant, Chris","year":"1988"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00002.x"},{"key":"atypb30","first-page":"217","author":"Hunt, V.B.","year":"1979","journal-title":"Proc. LACN Symp."},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1982.tb04357.x"},{"key":"atypb32","author":"Mehra, S.K.","year":"1979","journal-title":"IEEE"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360253"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095390"},{"key":"atypb35","volume":"203","author":"Okinaka, A.","year":"1975","journal-title":"Proc. Natn. Comput. Conf."},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095378"},{"key":"atypb37","volume-title":"Proc. IEEE Infocom'82","author":"Tobagi, F.A."},{"key":"atypb38","volume-title":"The Ethernet, a local area network, data link layer, and physical layer specification","author":"Digital, Intel, Xerox","year":"1980"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/003754979205800205","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/003754979205800205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:07:44Z","timestamp":1777633664000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/003754979205800205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["10.1177\/003754979205800205"],"URL":"https:\/\/doi.org\/10.1177\/003754979205800205","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}