PROPOSAL ALGORITHMS TO SOLVE DELAY-CONSTRAINED ROUTING PROBLEM 3200
Main Article Content
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.
Article Details
Section
How to Cite
References
A.S. Tanenbaum, (2003), Computer Networks, Third edition, Prentice-Hall,
G. Feng, (2001), Neural network and algorithmic methods for solving routing problems in high speed network, Ph.D. thesis, University of Miami, Department of Electronic and Communications,.
R. Widyono, (1994), The Design and Evaluations of Routing Algorithms for Real Time Channels, TR-94-024, University of California at Berkeley, International Computer Science Institutes, June.
W. Stallings, (1998), High-Speed Networks, TCP/IP and ATM design and principles, New Jersey: Prentice-Hall,