Abstract
The Traffic matrix Estimation of IP networks has become a research topic in this later 10 years, where several methods have been used to resolve this ill posed problem. This paper deals with the later and presents a comparison study on training algorithms in Artificial Neural Networks (ANN) method, namely the BFGS Quasi-Newton; the Levenberg-Marquardt and Bayesian Regularization algorithms, which yields us accurate results as outputs, the comparison between them is made on estimating the error robustness, execution time and regression. It appears that the Levenberg-Marquardt algorithm performs the best results. We have used a real data from the American well known IP Network, called the Abilene network, to validate and evaluate our comparison, our implementation shows that the chosen algorithm has earned the challenge and ensure the smallest error in the shortest time and the estimated matrix is perfect..
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
