Abstract
Two routing algorithms proposed for a bridged LAN environment are examined. One is based on creating a spanning tree topology; the other takes a source routing approach. The features of the running environment and the functional requirements of bridge routing are identified, and the two approaches are compared.

This publication has 4 references indexed in Scilit: