 
Summary: Exact topology discovery algorithm for the capacity
and delay constrained loop network
Y.J. Lee and M. Atiquzzaman
Abstract: We have developed an exact model and algorithm for the delayconstrained minimum
cost loop problem (DCMCLP) of finding broadcast loops from a source node. While the traditional
minimum cost loop problem (MCLP) deals with only the traffic capacity constraint served by a port
of source node, the DCMCLP deals with the mean network delay and traffic capacity constraints
simultaneously. The DCMCLP consists of finding a set of minimum cost loops to link enduser
nodes to a source node satisfying the traffic requirements at endnodes and the required mean
delay of the network. In the DCMCLP, the objective function is to minimise the total link cost.
We have formulated the DCMCLP and proposed an exact algorithm for its solution. The proposed
algorithm is composed of two phases: in the first phase, it generates feasible paths to satisfy the
traffic capacity constraint; in the second phase it finds the exact loop topology through matching
and allocating optimal link capacity to satisfy the mean delay constraint. In addition, we have
derived several properties including the memory and time complexity of the proposed algorithm.
Performance evaluation shows that the proposed algorithm has good efficiency for networks with
less than thirty nodes and light traffic. Our proposed algorithm can be applied to find the broadcast
loops for realtime multimedia traffic.
1 Introduction
Network topology is defined as the configuration of
