Development of a Bi-directed Routing Model for Mobile Agents in Distributed Systems

Routing in a distributed system is a critical issue due to its complexity. Existing routing model (undirected) for mobile agent lacks provable efficient algorithm which consumes response time and bandwidth. This study planned, simulated and accessed a best migration scheme for mobile agents dynamic routing in a distributed computing environment. This was with a perspective to eradicating issues such as congestion, time consumption and packet loss connected with mobile agent framework method of handling distributed systems. The routing model was exhibited as a Bi-directed Chinese Postman Problem (BCPP). Linear Optimization was used to provide all conceivable itineraries and to calculate the optimal path for mobile agents. Backtracking algorithm was engaged to decide the availability of the link or node. Simulation of the model was carried out for a single mobile agent migration. MATLAB Simulink tools were used to simulate the formulated model. The proposed routing model performance was benchmarked with the existing Chinese Postman Problem (CPP) routing scheme using Network bandwidth, Response Time and the Network throughput as performance parameters. The simulation result showed that the proposed model optimizes network bandwidth, minimizes the network latency and throughput, thereby improved the mobility properties of mobile agents in distributed systems. It was concluded that the proposed migration scheme for mobile agents routing in a network reduced congestion, minimized time and expense of resources as compared to CPP