00000cab a22000003a 4500 UP-99796217608682388 Buklod 20231007234634.0 m |o d | ta 090129s xx d | ||r ||||| || (iLib)UPD-00073797031 DENGII eng Rodeheffer, Thomas L. SmartBridge a scalable bridge architecture. pp. 205-216 As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs becomes an issue. Two common solutions to the forwarding problem are IP routing and spanning tree bridging. IP routing scales well, but imposes the administrative burden of managing subnets and assigning addresses. Spanning tree bridging, in contrast, requires no administration, but often does not perform well in a large network, because too much traffic must detour toward the root of the spanning tree, wasting link bandwidth. Computer systems organization. Computer communication networks. Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Routing and layout. Mathematics of computing. Discrete mathematics. Graph theory. Trees. Design. Measurement. Performance. Standardization. Theory. Computer communication review. 30, 4 (2000). FO UPD DENG-II Article