| G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of the 31st Hawaii International Conference on System Sciences, 1998. |
....in [2] for protecting the computation results of free roaming agents. These protocols tolerate collusion between servers and un xed itineraries. They formalize and extend protocols proposed by Yee [26] Application areas of these protocols include comparison shopping, bidding and network routing [5]. Following the authors, we will use the vocabulary of comparison shopping, hence using the word shop to denote a server, and the word o er to denote the answer of a shop to an agent s request. These protocols are not concerned with the security problems raised by the use of mobile agents: ....
G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proc. of the 31st Hawaii Int. Conf. on System Sciences, 1998.
....Examples of this principle are the SETI HOME project and the prime factorization of large numbers here at CWI. Like with parallel computers, remote idle time is hardly ever used in practice, despite the obvious potential gains. We think that this will change over time, as mobile agent technology [8, 7, 3] becomes more popular. Mobile agent technology facilitates the use of remote computer time greatly. A programmer can easily make a mobile agent migrate to another computer and continue its business there. 7.2 The internet as a single intelligence Having access to all the idle time, software, and ....
Gianni Di Caro and Marco Dorigo. Mobile agents for adaptive routing. In Proceedings of the thirty-rst Hawaii International Conference on Systems, January 1998.
....# # # # # and ### # ## ### # ##### # # # # ## (The operation # on # and # on # are homomorphic and # on # and# on # are homomorphic. A scheme that allows to encrypt polynomials, based on the GoldwasserMicali encryption scheme, has been presented by Sander and Tschudin (Sander Tschudin, 1998). An encryption scheme based on Error Correcting Codes, using the McEliece public key scheme, is presented in (Loureiro Molva, 1999) We quote from (Young Yung, 1999) Little progress has been made over the last 20 years in deciding whether or not these [algebraic homomorphic encryption] ....
DI CARO,G.,&DORIGO, M. 1998 (Jan.). Mobile Agents for Adaptive Routing. In: 31st Hawaii International Conference on System Science.
....ant based algorithms are not limited to static problems. For example, based on ACO Schoonderwoerd et al. Schoonderwoerd et al. 1997a; 1997b] have developed their Ant Based Control (ABC) system for optimizing the routing tables in circuit switched networks. And similarly, Di Caro and Dorigo [Di Caro and Dorigo, 1998a; 1998b] incorporate ACO techniques into their AntNet system for the optimization of package switched network routing tables. These are both systems in which the state of the world is extremely dynamic. Related to the domain of manufacturing, in [Cicirello and Smith, 2001a] we presented an ACO inspired ....
G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of the 31st Hawaii International Conference on Systems Science, pages 74--83, January 1998.
....is to perform custom computation tasks in behalf of the user. Mobile agents have been efficiently deployed in cooperative routing schemes, where each agent performs a specific task in order to obtain partial results, which are in turn shared with other agents to achieve the general routing goal [20], 21] 22] Wave Technology. Although initially conceived several years ago, it was until recently that the WAVE platform was actually recognized as a true emerging technology, capable of addressing a number of issues inherent to open distributed systems [16] 17] WAVE is described as a set ....
G. Di Caro and M. Dorigo. "Mobile agents for adaptive routing". In Proceedings of the 31st International Conference on System Sciences (HICSS-31), volume 7, pages 74--83. IEEE Computer Society Press, 1998.
....from the path discovered by other colonies. This leads to a more even load distribution throughout the network. More examples of swarm based routing applications exist in the literature. Bonabeau et al. 24] discuss an improvement of ant based algorithms by dynamic programming. Di Caro and Dorigo [25 30] present a number of interesting variations based on ant like agents. White et al. also discuss various enhancements of routing algorithms in [31 35] A. AntNet In the AntNet al..gorithm, routing is determined by means of very complex interactions of forward and backward network exploration agents ....
G. Di Caro and M. Dorigo, "Mobile agents for adaptive routing", Proc. 31st Hawaii International Conference on System Sciences, IEEE Computer Society Press, Los Alamitos, CA, pp. 74-83, 1998.
....and its extensions are described in detail. 3.2.2 Connection less networks routing Several ACO algorithms have been developed for routing on connection less networks taking inspiration both from AS (Sec. 3.1.1.1) in general and from ABC (Sec. 3.2.1) in particular. Di Caro and Dorigo (1997) [26, 27, 28, 29, 30] developed several versions of AntNet, an ACO algorithm for distributed adaptive routing in best e ort connection less (Internetlike) data networks. The main di erences between ABC and AntNet are that (i) in AntNet real trip times experienced by ants (ants move over the same, real network as data ....
G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of the 31st International Conference on System Sciences (HICSS-31), volume 7, pages 74-83. IEEE Computer Society Press, 1998. 31
No context found.
G. Di Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of the 31st Hawaii International Conference on System Sciences, 1998.
No context found.
Di Caro, G., Dorigo, M. (1998) `Mobile agents for adaptive routing.' Proceedings: Thirty-first Hawaii International Conference on Systems, January 1998.
No context found.
G. di Caro and M. Dorigo, Mobile agents for adaptive routing, Proceedings of HICSS31, 1998.
No context found.
Di Caro, G. and Dorigo, M. "Mobile agents for adaptive routing". In Proceedings of the 31st International Conference on System Sciences (HICSS-31), volume 7, pages 74-83. IEEE Computer Society Press, 1998.
No context found.
G. Di Caro and M. Dorigo. Mobile Agents for Adaptive Routing. In 31st Hawaii International Conference on System Science, Big Island of Hawaii, 1998.
No context found.
Di Caro, G., Dorigo M., "Mobile Agents for Adaptive Routing". Proceedings of Hawaii International Conference on Systems, January 1998.
No context found.
G. Di Caro and M. Dorigo, "Mobile agents for adaptive routing", Proc. 31 s' Hawaii Intl. Conf on System Sciences, IEEE Computer Society Press, Los Alamitos, CA, pp. 74-83, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC