Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Enhanced Load Balancing Based On Hybrid Artificial Bee Colony With Enhanced Β-Hill Climbing In Cloud, Maha Zeedan, Gamal Attiya, Nawal El-Fishawy Jan 2023

Enhanced Load Balancing Based On Hybrid Artificial Bee Colony With Enhanced Β-Hill Climbing In Cloud, Maha Zeedan, Gamal Attiya, Nawal El-Fishawy

Mansoura Engineering Journal

This paper proposes enhanced load balancer based artificial bee colony and β-Hill climbing for improving the performance metrics such as response time, processing cost, and utilization to avoid overloaded or under loaded situations of virtual machines. In this study, the suggested load balancer is called enhanced load balancing based on hybrid artificial bee colony with enhanced β-Hill climbing (ELBABCEβHC) to improve the response time, processing cost and the resource utilization. Our proposed approach starts by ranking the task then the greedy randomized adaptive search procedure (GRASP) is used in initializing populations. Further, the binary artificial bee colony (BABC) enhanced with …


Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal Mar 2018

Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal

Theory and Applications of Graphs

Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, and then using the hop distance as a means to find the shortest paths between the ASes. A less significant drawback is restricting the shortest paths to only valley-free paths. Both approaches usually inflate the number of paths between ASes; introduce erroneous paths that do not conform to …