|
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:
Mobile agents are programs that can jump from host
to host in the network, at times and to places of
their own choosing. Many groups have developed
mobile-agent software platforms, and several
mobile-agent applications. Experiments show that
mobile agents can, among other things, lead to
faster applications, reduced bandwidth demands, or
less dependence on a reliable network
connection. There are few if any studies of the
scalability of mobile-agent servers, particularly as
the number of clients grows. We present some recent
performance and scalability experiments that compare
three mobile-agent platforms with each other and
with a traditional client/server approach. The
experiments show that mobile agents often outperform
client/server solutions, but also demonstrate the
deep interaction between environmental and
application parameters. The three mobile-agent
platforms have similar behavior but their absolute
performance varies with underlying implementation
choices.
Note:
Revised version appeared in Mobile Agents 2001.
See here.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Robert S. Gray,
David Kotz,
Ronald A. Peterson,
Peter Gerken,
Martin Hofmann,
Daria Chacon,
Greg Hill, and
Niranjan Suri,
"Mobile-Agent versus Client/Server Performance: Scalability in an Information-Retrieval Task."
Dartmouth Computer Science Technical Report TR2001-386,
January 2001.
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.