 
Summary: Optimal DelayConstrained Minimum Cost Loop Algorithm
for Local Computer Network
YongJin Lee M. Atiquzzaman
Dept. of Computer Science School of Computer Science
Woosong University University of Oklahoma
yjlee@wsu.ac.kr atiq@ou.edu
Abstract
This study deals with the DelayConstrained
Minimum Cost Loop Problem (DCMCLP) of finding
several loops from a source node. The DCMCLP
consists of finding a set of minimum cost loops to link
endnodes 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 minimize the total link cost. This paper
proposes a dynamic programming based three phase
algorithm that solves the DCMCLP. In the first phase,
the algorithm generates feasible solutions to satisfy the
traffic capacity constraint. It finds the capacitated
minimum loops in the second phase, and allocates the
