A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
Main Article Content
Abstract
Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
Article Details
How to Cite
Publication Dates
References
G.Feng, "Neural network and algorithmic methods for solving routing problems in high speed network", PHD Thesis, University of Miami, Department of Electronics and
Communications, 2001.
R.Sriram, "Delay Constrainted Routing in Connection-Oriented Network", Project Report, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, May 1998.
S.Chen and K.Nahrstedt, "On Finding MultiConstrained Paths", ICC'98, pp. 874-879, Atlanta, Georgia, June 1998.