A novel algorithm for multi-constrained QoS routing using nonlinear function and priority metrics | |
| Author | Alangkan Siriboonpipattana |
| Subject(s) | Non-linear mechanics Algorithm |
| Note | A research study submitted in partial fulfillment of the requirements the degree of Master of Engineering in Telecommunications, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | Ensuring the performance of multi-constrained path (MCP) problem with respect to Quality of Service (QoS) requirements is very complex problem. The algorithm has to seek the complete path from source to destination satisfying more than one constraint. This report aims to improve the performance of existing proposed algorithm by assigning appropriate priority Wij to each link weight component. Our proposed algorithm is modified to solve MCP problem. We use two main concepts which are nonlinear cost function and look ahead concept in our modified algorithm. In addition, we also adapt the priority technique for proposed algorithm to increase the capability of finding more exact shortest path. In the simulation, we use 4 different networks with two link weight scenarios, which generated randomly from uniform distribution and normal distribution. Then we compare the results of success ratio and computational time as a performance of both algorithms. We found that our algorithm always gave a better SR result than H_MCOP, but less performance in terms of computational time |
| Year | 2012 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Teerapat Sanguankotchakorn; |
| Examination Committee(s) | Poompat Saengudomlert;Ahmed, Kazi M.; |
| Scholarship Donor(s) | Royal Thai Government Fellowship; |