The Annals of Probability, Vol. 19, No. 4 (Oct., 1991), pp. 1559-1574 (16 pages) Consider the nearest neighbor graph for the integer lattice Z d in d dimensions. For a large finite piece of it, ...

An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. In a small network with one or two switches, the spanning tree protocol (STP) ...

Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 (15 pages) In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, ...

Those who had an opinion last week were split evenly: CCNA labs need either 2 or 3 switches, and CCNP labs need either 3 or 4. But why? We saw a few opinions floating around the blog last week, but ...