Data networks
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Randomized algorithms
Routing in communications networks
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Software agents
IEEE Transactions on Software Engineering
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Tutorial: mobile software agents for dynamic routing
ACM SIGMOBILE Mobile Computing and Communications Review
Towards Multi-Swarm Problem Solving in Networks
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Towards an Active Network Architecture
DANCE '02 Proceedings of the 2002 DARPA Active Networks Conference and Exposition
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Intelligent agents: an emerging technology for next generation telecommunications?
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Mobile agents for network management
IEEE Communications Surveys & Tutorials
Neural network predication for network routing
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
An optimum strategy for dynamic and stochastic packet routing problems by chaotic neurodynamics
Integrated Computer-Aided Engineering - Artificial Neural Networks
| Hi-index | 0.00 |
In spite of the ever-increasing availability of computation and communication resources in modern networks, the overhead associated with network management protocols, such as traffic control and routing, continues to be an important aspect in the design of new methodologies. Resource efficiency of such protocols has become even more prominent with the recent developments of wireless and ad hoc networks, which are marked by much more severe resource constraints in terms of bandwidth, memory, and computational capabilities. This paper presents an agent-based approach to distance vector routing (ADVR) that addresses these resource constraints. ADVR is a resource efficient implementation of distance vector routing that is fault tolerant and scales well for large networks. ADVR draws upon some basic biologically inspired principles to facilitate coordination among the mobile agents that implement the routing task. Specifically, simulated pheromones are used to control the movement of agents within the network and to dynamically adjust the number of agents in the population. The behavior of ADVR is analyzed and compared to that of traditional distance vector routing.