- 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
Proposal Algorithms to Solve Delay -Constrained Routing Problem | ||
| Journal of Engineering | ||
| Article 1, Volume 11, Issue 4, 2005, Pages 621-631 | ||
| Author | ||
| Deya J. Kadhim | ||
| Abstract | ||
| One of the Quality of Service (QoS) routing problems is link-constrained, path constrained routing, and example of such problem is delay and bandwidth-constrained routing. Here, the proposed solution is presented through our proposal routing algorithms DCUR-AB (Delay Constraint Unicast Routing at Available Bandwidth) and ADCUR-AB (Adaptive Delay Constraint Unicast Routing at Available Bandwidth). DCUR-AB and ADCUR-AB routing algorithms are proposed to solve the most popular QoS problem (Delay-constrained routing problem). Our proposed algorithms solve this problem in addition to take into account one of the important network resource (bandwidth). From experimental results for DCUR-AB it is found that this algorithm has a limitation searching to find the optimal path with taking into account the bandwidth constrained, therefore; it is proposed here another routing algorithm called ADCUR-AB that has a wide search to find the optimal path, then a practical comparison between the two proposed algorithms results is applied and it is found that the second algorithm is better than the first one. | ||
| Keywords | ||
| Routing Algorithms; QoS Routing; QoS constraints; link; constrained and path constrained routing problem | ||
|
Statistics Article View: 188 PDF Download: 169 |
||