G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Adaptive-SDR: Adaptive Swarm-based Distributed Routing - Kassabalidis El-Sharkawi.. (Correct)
....communication between ants, a phenomenon known as stigmergy. Its end effect is the manifestation of behavior far more complex than expected by such simple organisms. There already exist many successful adaptations of ant behavior to network control [1 11] with the most prominent being AntNet [2,3], and Ant based Control (ABC) 4] An overview of swarm based algorithms can be found in [12] The application of AntNet to a satellite network is discussed in [13] These and the other existing algorithms lack a number of important features, namely scalability, full utilization of the network ....
....all the neighbors of the nodes are included in the next hop list, while in the local routing table only the nodes that belong to the same colony are included as possible next hops. The probabilities of the routing tables are updated in a manner that borrows some features from the AntNet al..gorithm [2,3], while adding significant improvements. 1. At regular intervals, each node sends one local ant to every destination within the colony, and only one colony ant for each outside colony. 2. The local ants choose next hops according to the local table probabilities, while the colony ants choose ....
G. Di Caro and M. Dorigo, "AntNet: a mobile agents approach to adaptive routing," Tech. Rep. IRIDIA/97-12, Universit Libre de Bruxelles, Belgium
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
....that our Byzantine inspired routing model may lead to impractical algorithms in typical (non Byzantine) settings. However, ant inspired routing algorithms were developed and tested in real network environments by British Telecomm and NTT for both wired and wireless networks with superior results [13, 56, 18, 14, 48, 50, 11, 21]. AntNet, a particular such algorithm, was tested in routing for data communication net works [13] The algorithm performed better than OSPF, distributed Bellman Ford with various dynamic metrics, and various modifications of short est path with a dynamic cost metric [9, 48] 2 Network and ....
.... inspired routing algorithms were developed and tested in real network environments by British Telecomm and NTT for both wired and wireless networks with superior results [13, 56, 18, 14, 48, 50, 11, 21] AntNet, a particular such algorithm, was tested in routing for data communication net works [13]. The algorithm performed better than OSPF, distributed Bellman Ford with various dynamic metrics, and various modifications of short est path with a dynamic cost metric [9, 48] 2 Network and Security Model In the following section we describe both our network and security models and any ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universit Libre de Brmxelles, Belgium.
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies - Cerpa, Estrin (74 citations) (Correct)
....to local measurements of density. Nevertheless, it uses geographic information, and it is not based strictly on measurements of message loss. Self configuration based on local measured parameters takes some inspiration from biological systems, in particular the models of ant colony behavior [4]. Bulusu et al. 3] have proposed different algorithms for incremental beacon placement in sensor networks. This work share with us the same design principles, such us the use of localized algorithms, and adaptation based on locally measured parameters. While their work is oriented to solve the ....
G. Di Caro and M. Dorigo. AntNet: A Mobile Agents Approach to Adaptive Routing. Technical Report 97-12, IRIDIA, Universite' Libre de Bruxelles, 1997.
Adaptive Routing in Wireless Communication Networks using.. - Arabshahi, Gray, al. (2001) (2 citations) (Correct)
....sensors to communicate with one another by methods of power control, efficient protocols, and spectral management to achieve desired sensing goals, but also to sense and adapt to the removal and addition of different high and low rate sensors and changing activity. Swarm based routing algorithms [16 42] derive from recent understandings of basic principles underlying the operation of biological swarms, such as ants or honeybees. These swarms, often containing thousands or tens of thousands of elements, routinely perform extraordinarily complex tasks of global optimization and resource allocation ....
....in the future. As stated, these concepts are immediately applicable to adaptive scalable routing algorithms and bandwidth allocation, as well as other task resource allocation tasks. A very successful example of swarm based routing algorithms is the AntNet adaptive agent based routing algorithm [ 16 27], which has outperformed the best known routing algorithms on several packetswitched communications networks. For telephone communication networks, there also exists a very successful application of swarm intelligence via Ant Based Control (ABC) 28 30] We present an overview of the mechanics of ....
G. Di Caro and M. Dorigo, "AntNet: a mobile agents approach to adaptive routing", Tech. Rep. IRIDIA/97-12, Universitd Libre de Bruxelles, Belgium.
Dynamic Agent Population in Agent-Based Distance Vector Routing - Amin, Mikler (2002) (2 citations) (Correct)
.... mobile agents roaming the network could search for information, meet and interact with other agents that roam the network or remain bound to a particular machine. An agent manifests four distinct characteristics, namely, Intelligence, Communication, Autonomy, and Mobility [Minar et al. 1998, Di Caro Dorigo 1997] Intelligence is the ability of the agent to adapt itself and or change its environment based on the information available to it. Communication is the property of an agent whereby it coordinates with other agents residing on the same node in exchanging data, making decisions to merge itself ....
....paradigm can be applied to many intrinsically parallel network application. A large number of applications in communication networks have been identi ed that can bene t from an agentbased approach. Some examples on the system level include load balancing, network management and network routing [Di Caro Dorigo 1997, Minar et al. 1999] In this paper we apply the agent paradigm to network routing. Most of the work in agent based network routing is based on insect colonies. It relies on the principles that individual insects exhibit a simple behavior while collective communities exhibit complex problem ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo, AntNet: a mobile agents approach to adaptive routing. Tech. Report, IRIDIA/97-12, Universit Libre de Bruxelles, Belgium.
Agent-based Distance Vector Routing: A Resource Efficient and.. - Amin, Mikler (Correct)
....not least, mobility is the property that makes agents conducive for distributed systems and network applications, as it allows the agent to migrate among the constituent nodes of the environment. Most of the work in agent based network routing is biologically inspired and based on insect colonies (Di Caro and Dorigo 1997; White 1997) It relies on the principles that individual insects exhibit a simple behavior while collective communities of these insects exhibit complex problem solving capabilities. Considerable research has been conducted in mapping the foraging activities of ants to routing and network ....
....Intelligence (White 1997; White and Pagurek 1998) Such an approach exploits the concept of multiple colonies of agents coexisting and in some cases coordinating with each other working towards independent goals. AntNet applies the idea of deploying agents for routing in packet switched networks (Di Caro and Dorigo 1997). The algorithm generates mobile agents (arti cial ants) at regular intervals at di erent nodes in the network. These agents select a random destination in the network; traverse the network to reach the destination and on their way back to the source node collect routing information. Although ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo, AntNet: a mobile agents approach to adaptive routing. Tech. Report, IRIDIA/97-12, Universit Libre de Bruxelles, Belgium.
Analysis on Extended Ant Routing Algorithms for Network.. - Sum, Shen, Young, Wu (Correct)
....path (such as the shortest path) and send out the message. The basic assumption of this technique is that the network is stationary. In a faulty or mobile network, searching for the optimal path using this conventional approach will become very dicult. Ant routing (or ant like routing method) 5] [7], 32] 33] 34] 35] is a recent proposed mobile agent based network routing algorithm particular for use in these environments. The idea of ant routing algorithm mimics the path searching process of an ant. Once a request for sending a message is received from a server, the server will ....
Di Caro G. and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Swarm Intelligence for Routing in Communication Networks - Kassabalidis.. (3 citations) (Correct)
.... autonomous entities, both proactive and reactive, and have the capability to adapt, cooperate and move intelligently from one location to the other in the communication network [4] Swarm intelligence, in particular, uses stigmergy (i.e. communication through the environment) for agent interaction [5,6,7,9]. Swarm intelligence exhibits emergent behavior wherein simple interactions of autonomous agents, with simple primitives, give rise to a complex behavior that has not been specified explicitly [8] In Section II, we give an overview of existing routing algorithms, including their individual ....
.... path by utilizing other heuristics [2] Minimal routing can further be subdivided into optimal routing and shortest path routing.Intheformer,theobjective is to optimize the mean flow of the entire network; while in shortest path routing the goal is to find the minimum cost path between two nodes [1,7]. Another class of routing algorithms is one where the routing scheme guarantees specified QoS requirements pertaining to delay and bandwidth. These algorithms are usually message based, i.e. they find a feasible path satisfying the QoS constraints based on an exchange of messages between the ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo, "AntNet: a mobile agents approach to adaptive routing", Tech. Rep. IRIDIA/97-12, Universit Libre de Bruxelles, Belgium#
An Annotated Bibliography of Mobile Agents in Networks - Sriraman (2002) Self-citation (Agents) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: A Mobile Agents Approach to Adaptive Routing, 1997. G. Di Caro and M. Dorigo, AntNet: a mobile agents approach to adaptive routing, Tech. Rep. IRIDIA/97-12, Universit Libre de Bruxelles, Belgium.
Ant Algorithms for Discrete Optimization - Dorigo, Di Caro, Gambardella (1998) (64 citations) Self-citation (Di caro Dorigo) (Correct)
.... procedures (see for example [37, 50, 92] while, so far, only Michel and Middendorf [76] have used a simple one step lookahead function and there are no examples of backtracking procedures added to the basic ant capabilities, except for simple recovery procedures used by Di Caro and Dorigo [26, 28]. In the following section we will show how arti cial ants can be put to work in an algorithmic framework so that they can be applied to discrete optimization problems. In reality, some real ants have a similar behavior: they deposit more pheromone in case of richer food sources. Usually, ....
.... Schoonderwoerd, Holland, 1996 [87, 86] ABC network routing Bruten Rothkrantz White, Pagurek Oppacher 1998 [100] ASGA Di Caro Dorigo 1998 [31] AntNet FS Bonabeau, Henaux, Gu erin, 1998 [6] ABC smart ants Snyers, Kuntz Th eraulaz Connection less Di Caro Dorigo 1997 [26, 28, 32] AntNet AntNet FA network routing Subramanian, Druschel Chen 1997 [95] Regular ants Heusse, Gu erin, Snyers Kuntz 1998 [62] CAF van der Put Rothkrantz 1998 [97, 98] ABC backward algorithms for static combinatorial optimization the way ants update pheromone trails changes across ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report 97-12, IRIDIA, Universite Libre de Bruxelles, 1997.
The Ant Colony Optimization Meta-Heuristic - Dorigo, Di Caro (1999) (92 citations) Self-citation (Di caro Dorigo) (Correct)
....path then it is the rst to deposit pheromone and to bias the search of forthcoming ants. It turns out that in geographically distributed problems, network problems in our case, implicit solution evaluation based on the DPL e ect plays an important role. In fact, as it was shown for example in [12, 13] where explicit solution evaluation was switched o by setting the amount of pheromone deposited by ants to a constant value independent of the cost of the path built by the ant, it is possible to nd good solutions to network problems just exploiting the DPL e ect. Quite obviously, it has also ....
....and in general in any problem where the characteristics of the problem change in unpredictable ways during problem solution, is that there is no simple way to evaluate a solution and therefore to decide how much pheromone ants should deposit. A way out to this problem, which is used by AntNet [12, 13], is to use ants to learn online a model of the network status that can be used to evaluate how good the solutions found by ants are. Number of ants. The exact number of ants to be used is a parameter that, most of the times, must be set experimentally. Fortunately, ACO algorithms seem to be ....
[Article contains additional citation context not shown here]
G. Di Caro and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report 97-12, IRIDIA, Universite Libre de Bruxelles, 1997.
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Provably Competitive Adaptive Routing - Awerbuch, Holmer, Rubens, al. (2005) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Swarm Intelligence Routing Resilient to Byzantine Adversaries - Awerbuch, Holmer, Rubens (2004) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium.
A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc.. - Baras, Mehta (2003) (2 citations) (Correct)
No context found.
G. DiCaro and M. Dorigo, "AntNet: A Mobile Agents Approach to Adaptive Routing", Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Directed Diffusion for Wireless Sensor Networking - Intanagonwiwat, Govindan.. (2003) (26 citations) (Correct)
No context found.
Gianni Di Caro and Marco Dorigo. AntNet: A Mobile Agents Approach to Adaptive Routing. Technical Report 97-12, IRIDIA, Universite' Libre de Bruxelles, 1997.
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Traffic Aware Policy-based Internet Routing - Lorensen (2003) (Correct)
No context found.
Gianni Di Caro and Marco Dorigo. Antnet: A mobile agents approach to adaptive routing. Technical Report 12, Universite Libre de Bruxelles, IRIDIA, 1997.
Swarm Intelligence Routing Resilient to Byzantine Adversaries - Awerbuch, Holmer, Rubens (2004) (Correct)
No context found.
G. Di Caro and M. Dorigo. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium.
A Pheromone-Based Coordination Mechanism Applied in P2P - Schelfthout, Holvoet (2003) (3 citations) (Correct)
No context found.
Di Caro G. and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Universit Libre de Bruxelles, Belgium, 1997.
Ad hoc Multicast Routing Algorithm with Swarm Intelligence - Chien-Chung Shen Chaiporn (Correct)
No context found.
Gianni Di Caro and Marco Dorigo. AntNet: A Mobile Agents Approach to Adaptive Routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Going the Extra Mile in Ant Colony Optimization - Experimental Evaluation Ricardom (2001) (Correct)
No context found.
Di Caro G., Dorigo M. AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, IRIDIA, Universite Libre de Bruxelles, Belgium, 1997.
A Routing Suite for Mobile Ad hoc Networks Using Swarm.. - Rajagopalan, Shen (2004) (Correct)
No context found.
Gianni Di Caro and Marco Dorigo. AntNet: A Mobile Agents Approach to Adaptive Routing. Technical Report IRIDIA/97-12, Universite Libre de Bruxelles, Belgium, 1997.
Adaptive Routing in Wireless Communication Networks using.. - Arabshahi, Gray, al. (2001) (2 citations) (Correct)
No context found.
G. Di Caro and M. Dorigo, "AntNet: A Mobile Agents Approach to Adaptive Routing in Communication Network", 9 th Dutch Conf on Artificial Intelligence (NAIC '97) Antwerpen (BE), November 12-13, 1997.
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