Abstract
AbstractAntNet was reported to exhibit an undesirable effect called “Routing Lock.” If a link is congested or down, a node can select another link easily with the ability to cancel the effect quickly. As means of canceling the effect, the decay method and the negative feedback method were proposed. However, the decay method is not effective in balancing the cancellation of the effect with the learning speed of network traffic statistics. Also the negative feedback method requires ants to move on at least one congested link so that it takes a long time to cancel the effect. In this paper, we propose an improvement algorithm, BntNetL, which cancels the effect indirectly by giving ants the ability to update routing tables bidirectionally. BntNetL shows better performance than its competitors in simulations. © 2002 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 85(9): 31–41, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.1123
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 call
