.png){kind=icon}
.png){kind=icon}
Return
Autonomous mobile agent routing for efficient server resource allocation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2008.12.029.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile agents are becoming increasingly important in the highly distributed applications frameworks seen today. Their routing/dispatching from node to node is a very important issue as we need to safeguard application efficiency, achieve better load balancing and resource utilization throughout the underlying network. Selecting the best target server for dispatching a mobile agent is, therefore, a multi-faceted problem that needs to be carefully tackled. In this paper we propose distributed, adaptive routing schemes (next node selection) for mobile agents. The proposed schemes overcome risks like load oscillations, i.e., agents simultaneously abandoning a congested node in search for other, less saturated node. We try to induce different routing decisions taken by agents to achieve load balancing and better utilization of network resources. We consider five different algorithms and evaluate them through simulations. Our findings are quite promising both from the user/application and the network/infrastructure perspective. (C) 2008 Elsevier Inc. All rights reserved.
Keywords:
Mobile agents
Bounded rationality-Santa Fe Bar Problem
Efficient resource utilization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K
Organization
No organization information available