The Spanning Tree Protocol, sometimes just referred to as Spanning Tree, is the Waze or MapQuest of modern Ethernet networks, directing traffic along the most efficient route based on real-time ...

Independent spanning trees, often realised as completely independent spanning trees (CISTs), form a foundational concept in network design and routing. They consist of multiple spanning trees ...

We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. It is known that the GMST problem belongs ...

Jeff Hardee introduced me to the idea of using longer Spanning Tree Protocol (STP) path length values for high-speed links. I thought this was an intriguing idea and so I started to do some informal ...

Complex networks represent interconnected systems found in fields ranging from sociology to biology and technological infrastructures. A critical aspect of analysing such networks is the study of ...

The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...

We’re using IPTV at our school and have discovered a situation that we don’t understand. The video is delivered over a group of Ethernet switches. When we investigate the individual links, we find ...

Joel is an internationally recognized expert in the areas of security, networking and messaging. Follow him on X (formerly Twitter) @joelsnyder. Building enterprise networks with routers and switches ...