Dynamic Agent Population in Agent-Based Distance Vector Routing Metadata

Metadata describes a digital item, providing (if known) such information as creator, publisher, contents, size, relationship to other resources, and more. Metadata may also contain "preservation" components that help us to maintain the integrity of digital files over time.


  • Main Title Dynamic Agent Population in Agent-Based Distance Vector Routing


  • Author: Amin, Kaizar A.
    Creator Type: Personal
    Creator Info: University of North Texas
  • Author: Mikler, Armin R.
    Creator Type: Personal
    Creator Info: University of North Texas


  • Creation: 2002-08


  • English


  • Content Description: This paper discusses dynamic agent population in agent-based distance vector routing.
  • Physical Description: 6 p.


  • Keyword: agent-based
  • Keyword: distance vector routing
  • Keyword: agents
  • Keyword: software


  • Seminar/Webinar: Second International Workshop on Intelligent Systems Design and Application, 2002, Atlanta, Georgia, United States


  • Name: UNT Scholarly Works
    Code: UNTSW


  • Name: UNT College of Engineering
    Code: UNTCOE


  • Rights Access: public

Resource Type

  • Paper


  • Text


  • Archival Resource Key: ark:/67531/metadc132968


  • Academic Department: Computer Science and Engineering


  • Display Note: 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 its agent population. Although a lot of research has been conducted on agent-based systems, little consideration has been given to the importance of agent population in dynamic networks. A large number of constituent agents can increase the resource overhead of the system, thereby impeding the overall performance of the network. Hence, it is imperative to find the optimal number of agents in the system that would maximize the efficiency of the agent-based mechanism in the network. This optimal value cannot be determined manually, thereby emphasizing the need for an adaptive approach that manipulates the number of agents in the system based on its resource availability. This paper discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing and also describes an adaptive approach controlling the number of agents in the network using pheromones and discusses their limitations.