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 ...

Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...

Ethernet devices running the Spanning Tree Protocol (STP) have been implemented in networks since the early 1990s. Many organizations take STP for granted and do not configure it per industry best ...

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 ...

Citations: Vohra, Rakesh. 1984. Counting Spanning Trees in a Graph of Kleitman and Golden and its Generalization. Journal of the Franklin Institute. (5)349-355.

As computer networks get bigger, it becomes increasingly hard to keep track of the flow of data over this network. How do you route data, making sure that the data is spread to all parts of the ...

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 ...