Wayne Caro

Abstract

The purpose of this thesis is to develop, test, and simulate an algorithm that mobile software agents can use to select a server to which the agents can migrate. Software agents are autonomous software entities that perform tasks on behalf of other agents or humans, and that have some degree of intelligence. In particular, a mobile software agent is capable of migrating from one computer system (agent server) to another during the course of performing its tasks. Most current implementations of mobile software agents (simply referred to as agents) have simple forms of server selection. The algorithm discussed in this thesis proposes new ideas for dealing with the server selection process. The algorithm proposed in this thesis is intended to provide a good basis from which further work can be continued in the area of agent server selection. This algorithm was demonstrated to work as expected under a set of boundary conditions of purely abstract computer resources. Then the algorithm was used in a simulation of a print job scheduler for a cluster of printers. Some of the concepts that this algorithm uses are resource importance factors, "needed" and "wanted" resources, risk factors, server resource evaluations, and server resource availability.

Library of Congress Subject Headings

Intelligent agents (Computer software); Algorithms; Client/server computing

Publication Date

5-1-1999

Document Type

Thesis

Department, Program, or Center

Computer Engineering (KGCOE)

Advisor

Czernikowski, Roy

Advisor/Committee Member

Suits, David

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA76.76.I58 C37 1999

Campus

RIT – Main Campus

Download

Share

COinS