Dynamic agent population in agent-based distance vector routing

Authors:
Kaizar A. Amin;Armin R. Mikler;Venkatesan Iyengar Prasanna
Affiliations:
University of North Texas, Department of Computer Science, Denton, TX;University of North Texas, Department of Computer Science, Denton, TX;University of North Texas, Department of Computer Science, Denton, TX
Venue:
Neural, Parallel & Scientific Computations - Special issue: Advances in intelligent systems and applications
Year:
2003

Citing 10
Cited 0

Data networks

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
Ant-like agents for load balancing in telecommunications networks

AGENTS '97 Proceedings of the first international conference on Autonomous agents
Tunnel Agents for Enhanced Internet QoS

IEEE Concurrency
An Agent-based Architecture for Advance Reservations

LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Dynamic agent population in agent-based distance vector routing

Second international workshop on Intelligent systems design and application
Towards Multi-Swarm Problem Solving in Networks

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
A Mobile Agent-Based Active Network Architecture

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Mobile agents for network management

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Intelligent Mobile Agent paradigm can be applied to a wide variety of intrinsically parallel and distributed applications. Network routing is one such application that can be mapped to an agent-based approach. The performance of any agent-based system will depend on the size of its agent population. Although a significant amount of research has been conducted on mobile agent-based systems, little consideration has been given to the importance of dynamically and autonomously adapting the size of the agent population as function of circumstances in the environment. A large number of constituent agents can consume considerable amounts of network resources, thereby impeding the overall performance of the network. Hence, it is imperative to have a control mechanism whereby the agent population can be adjusted in a distributed manner to balance the resource overhead in the network. This paper briefly discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing. It also describes a framework for an adaptive approach to control the number of agents in the network using pheromones and discusses its limitations.