Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22483
Title: The A3 fault-tolerant framework for distributed computing with multiple mobile agents over sizeable networks
Authors: Wong, AKY
Lin, WWK
Keywords: Internet
Java
Computer network reliability
Distributed programming
Fault tolerant computing
Intranets
Multi-agent systems
Security of data
Issue Date: 2001
Publisher: IEEE
Source: Proceedings : 15th International Conference on Information Networking : 31 January-2 February, 2001, Beppu City, Oita, Japan, p. 355-360 How to cite?
Journal: Proceedings : 15th International Conference on Information Networking : 31 January-2 February, 2001, Beppu City, Oita, Japan 
Abstract: We are proposing the A3 fault-tolerant framework for distributed computing with multiple mobile agents over sizeable networks. A3 fault tolerance includes three objectives, namely, access security, agent persistence, and avoidance of long queuing time. The last two objectives are achieved by agent mobility. The prototype for this framework was verified over the Internet, a typical sizeable network, with selected sites that include part of our university's intranet and other local Internet sites, as well as the stable Java-based Aglets mobile-agent platform. Results from the verification exercise with this prototype indicate unanimously that the A3 framework is indeed a fault-tolerant solution for distributed computing with multiple mobile agents over sizeable networks. Access security is achieved by formation of communes, namely, villages and public intranets. These communes protect themselves by denying accesses by non-members to the shared communal resources. The smallest commune is a village, and different villages are interconnected automatically by mediators or connectors into a larger commune known as the public intranet, which has a different connotation from the conventional one that is formed for institutional privacy and integrity. Agent mobility for achieving agent persistence and avoidance of long queuing time depends on the instantaneous values of the migration indices, which are computed from the specific sets of run-time parameters
URI: http://hdl.handle.net/10397/22483
ISBN: 0-7695-0951-7
DOI: 10.1109/ICOIN.2001.905451
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

34
Last Week
7
Last month
Checked on Apr 23, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.