|
Dartmouth College Computer Science Technical Report series |
CS home TR home TR search TR listserv |
| By author: | A B C D E F G H I J K L M N O P Q R S T U V W Y Z | |
| By number: | 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986 | |
Abstract:
One of the paradigms that has been suggested for allowing efficient access
to remote resources is transportable agents. A transportable agent
is a named program that can migrate from machine to machine in a
heterogeneous network. The program chooses when and where to migrate. It
can suspend its execution at an arbitrary point, transport to another machine
and resume execution on the new machine. Transportable agents have several
advantages over the traditional client/server model. Transportable agents
consume less network bandwidth and do not require a connection between
communicating machines -- this is attractive in all networks and particularly
attractive in wireless networks. Transportable agents are a convenient
paradigm for distributed computing since they hide the communication channels
but not the location of the computation. Transportable agents allow
clients and servers to program each other. However transportable agents pose
numerous challenges such as security, privacy and efficiency. Existing
transportable agent systems do not meet all of these challenges. In addition
there has been no formal characterization of the performance of transportable
agents. This thesis addresses these weakness. The thesis has two parts --
(1) formally characterize the performance of transportable agents through
mathematical analysis and network simulation and (2) implement a complete
transportable agent system.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Robert S. Gray,
"Ph.D. Thesis Proprosal: Transportable Agents."
Dartmouth Computer Science Technical Report PCS-TR95-261,
May 1995.
Want to be notified about new tech reports? Join our mailing list.
Want to search our technical reports?
Want us to mail you a paper copy of a report? Send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.