- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem | ||
| Journal of Engineering | ||
| Article 1, Volume 19, Issue 1, 2013, Pages 155-160 | ||
| Authors | ||
| Waleed A. Mahmoud; Dheyaa J. Kadhim | ||
| 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). | ||
| Keywords | ||
| Routing; Routing Algorithms; QoS; Optimization and Feasible Problem | ||
|
Statistics Article View: 130 PDF Download: 98 |
||