AntNetFA improving AntNet using faster ants
In AntNet, forward ants make use of the same queues that are used by data packets. In this way they behave like data packets and experience the same traveling time that a data packet would experience. In this sense, forward ants faithfully simulate data packets. The problem with this approach is that, in case of congestion along the path that is being followed, it will take a significantly long time to the forward ant to reach its destination. This fact will have two major consequences the...
Data structures maintained at the nodes
In any routing algorithm, the final quality of the routing policy critically depends on the characteristics of the information maintained at the network nodes. Figure 7.1 graphically summarizes the data structures used by AntNet at each node k, that are as follows Figure 7.1 Node data structures used the ant agents in AntNet for the case of a node with L neighbors and a network with N nodes. For simplicity the identifiers of the neighbors are supposed to be 1, 2, L. Both the ant-routing and...
Wireless and mobile ad hoc networks
Matsuo and Mori 2001 302 have proposed Accelerated Ants Routing, which is an extension to MANETs of the ideas of Subramanian et al. 411 . They add the rule that uniform ants do not return to an already visited node, and make these ants to hold the history about the n last visited nodes. In this way, routing information can be updated not only toward the source, but all the intermediate nodes. The algorithm heavily rely on the uniform ants, and no on-demand actions are taken. It has been...
Experimental settings and results for AntHocNet
We report in this section some preliminary experimental results for AntHocNet. As simulation software we have used Qualnet 354 , a discrete-event packet-level simulator developed by Scalable Networks Inc. as a follow-up of GloMoSim, which was a shareware simulator designed at University of California, Los Angeles. Qualnet is specifically optimized to simulate large-scale MANETs, and comes with correct implementations of the most important protocols for all the network layers and for routing in...
Experimental results for ACO routing algorithms
This chapter is devoted to the presentation of extensive experimental results concerning AntNet, AntNet-FA, and AntHocNet. The majority of the results concern AntNet and AntNet-FA and refer to the case of best-effort routing in wired IP networks. As discussed in Subsection 7.1.1, failure events are not taken into account, the focus being on the study of traffic-adaptiveness and on the effective use of multiple paths. Some preliminary results concerning AntHocNet and routing mobile ad hoc...
Summary
In this chapter four novel ACO algorithms for adaptive routing in telecommunication networks, AntNet, AntNet-FA, AntHocNet, and AntNet SELA, have been described and throughly discussed. These algorithms cover a wide range of possible network scenarios. Experimental result are be reported in the next chapter, and only for the first three of them. In addition to these algorithms, in this chapter we also introduced ACR, a high-level distributed control framework that specializes the general ACO's...
Contents
1.1 Goals and scientific 1.1.1 General goals of the 1.1.2 Theoretical and practical relevance of the 1.1.3 General scientific 1.2 Organization and published sources of the 1.3 ACO in a nutshell a preliminary and informal 1 From real ant colonies to the Ant Colony Optimization metaheuristic 21 2 Ant colonies, the biological roots of Ant Colony Optimization 23 2.1 Ants colonies can find shortest paths 2.2 Shortest paths as the result of a synergy of ingredients 27 2.3 Robustness, adaptivity, and...