In network design, the Optimal Communication Spanning Tree (OCST) problem is to find a
spanning tree that connects the network entities and satisfies their communication …

Ethernet networks rely on the so-called spanning tree protocol (STP) in order to prevent
loops. This protocol imposes a severe penalty on the performance and scalability of Metro …

Current Ethernet networks rely on IEEE Spanning Tree Protocol (STP), which provides a
loop-free connectivity across various network nodes. STP does this task by reducing the …

During the last decades, Ethernet progressively became the most widely used local area
network (LAN) technology. It evolved from a bus topology to a micro-segmented network …

Ethernet networks rely on Spanning Tree Protocol (STP) that guarantees a loop-free tree
topology in the network. STP does this task by pruning the redundant links. This protocol …

DCMST (Degree Constraint Minimum Spanning Tree) is a special case of minimum
spanning tree problem which is concerned with finding a spanning tree of a nonnegative …

In this paper, we propose a novel approach for the optimal communication spanning tree
(OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) …

This paper deals with the Optimum Communication Spanning Tree Problem (OCST) which
is well known as an NP-hard problem. For solving the problem, we uses an evolutionary …

Communication networks have been developed based on two networking approaches:
bridging and routing. The convergence to an all-Ethernet paradigm in Personal and Local …

The Optimum Communication Spanning Tree (OCST)[2] problem is NP-hard and describes
the problem of finding a spanning tree that minimizes the cost defined by edge weights and …