Abstract
In this paper, we introduce an analytic modelling approach to the study of a novel class of adaptive network routing algorithm, which is inspired by the emergent problem-solving behaviours observed in biological ant colonies. This class of algorithm utilizes “ant-like” agents which traverse the network and collectively construct routing policies. Previous studies have focused exclusively on simulation experiments, which indicate that such algorithms perform well in response to real-time changes in traffic demands and network conditions. The analytic model presented in this paper permits useful insights into certain fundamental aspects of ant-based algorithms, which have not been discussed in previous ant-based routing literature. In particular, the work presented in this paper motivates our proposal of a number of modifications to the basic design of ant-based routing algorithms, which result in improved performance with respect to equilibrium performance measures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
