A Study on IP Network Design by Memetic Algorithm
Keywords:
Memetic, OSPF, Packet-Switching Network DesignAbstract
Designing packet switch networks is a difficult and complex problem. The mathematical methods were improperly used to solve this problem. Especially the router network (or IP network) protocols that find the route by themselves, such as the OSPF protocol, may not make the traffic flow routing get together with the traffic requirement. We apply the Memetic algorithm for a worthwhile and effective network design. Then, the performance of 4–10 node networks was compared to the Simplex and MENTOR-II methods. The results of the comparison between the Memetic method and the Simplex method showed that the delay efficiency of the Memetic with crossover method is close to the Simplex method with a significance level of .05 but with less complexity.
References
Ammaruekarat, P., & Meesad, P. (2012). Optimization by Multi-Objective Chaos-Memetic Algorithm. Information Technology Journal, 8(1), 54-61. (in Thai)
Cahn, R. (1998). The design tool: Delite (software). Retrieved from http://www.mkp.com/wand.htm.
Chaimanee, A., & Supithak, W. (2018). A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows. Songklanakarin Journal of Science and Technology, 40(5). 1203-1218. (in Thai)
Charnkeitkong, P. (2007). Network analysis and design. Pathumthani: Rangsit University. (in Thai)
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation, 6(2), 182-197. doi: 10.1109/4235.996017.
Dehestani, A., & Hajipour, P. (2010). Comparative study of M/Er/1 and M/M/1 queuing delay models of the two IP-PBXs. Journal of Convergence Information Technology, 5(2), 36-42. doi:10.4156/JCIT.VOL5.ISSUE2.4
Duvedi, A., Ashraf, A., & Gairola, S. (2022). A Comparitive study on routing protocols: RIP, OSPF and EIGRP. Proceeding of International Conference on Cyber Resilience, Vol.2 (pp.519–528). Dubai UAE: Skyline University College.
Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF Weights, Proceeding of IEEE Computer and Communications Societies Vol.2 (pp.519–528). Tel Aviv: IEEE Computer Society.
Jaroenrat, K., & Samrongsub, T. (2014). OSPF network traffic engineering by branch exchange method. The Journal of King Mongkut’s University of Technology North Bangkok, 24(3), 503-511. (in Thai)
Lanthong, K., & Jaroenrat, K. (2012). OSPF weight optimization by linear programming method. Proceeding of 9th National Kasetsart University Kamphaeng Saen Conference (pp. 180-186). Nakhon Pathom: Kasetsart University. (in Thai)
Makhorin, A. (2000). GLPK (GNU linear programming kit). Retrieved from http://www.gnu.org/software/glpk.
Monsakul, A. (2015). Performance of design with MENTOR-II Algorithm for IP Backbone network of Internet Service Provider. Information Technology Journal, 11(2), 62-69. (in Thai)
Nuipian, V., & Phimpha, A. (2019). Comparison of selection and mutation in genetic algorithms for examination schedule problem. The Journal of Industrial Technology, 15(2), 112-124. (in Thai)
Sirinaovakul, B. (2008). Artificial Intelligence: Swarm Intelligence. Bangkok: Top. (in Thai)
Srikaew, A. (2002). Genetic Algorithm–Part I. Suranaree Journal of Science and Technology, 9, 69-83. (in Thai)
Wongthatsanekorn, W. (2009). Reviewing and comparisons of five evolutionary-based algorithms. The Journal of King Mongkut’s University of Technology North Bangkok, 19(2), 285-290. (in Thai)
