Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
 

Summary: Optimal Delay-Constrained Minimum Cost Loop Algorithm
for Local Computer Network
Yong-Jin 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 Delay-Constrained
Minimum Cost Loop Problem (DC-MCLP) of finding
several loops from a source node. The DC-MCLP
consists of finding a set of minimum cost loops to link
end-nodes to a source node satisfying the traffic
requirements at end-nodes and the required mean
delay of the network. In the DC-MCLP, the objective
function is to minimize the total link cost. This paper
proposes a dynamic programming based three phase
algorithm that solves the DC-MCLP. 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

  

Source: Atiquzzaman, Mohammed - School of Computer Science, University of Oklahoma

 

Collections: Computer Technologies and Information Sciences