Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks Page: 10
The following text was automatically extracted from the image on this page using optical character recognition software:
h oe Cloning Thre hd eminatehr sh od
Time = t 0""
Fig. 4. Population Control using Node Pheromones
related to each other. It was observed that a large agent population has a
significantly lower convergence time owing to its parallelism. Although low
convergence time is desirable, it has other side effects. A larger agent popula-
tion has a significantly larger average message overhead because a substantial
number of agents traverse the network concurrently imposing resource require-
ments on the network. For scalable systems, the average overhead should be
as low as possible. Therefore it is apparent that significantly large agent pop-
ulations, resulting in high average overhead hamper the scalability of ADVR.
On the other hand, a very small agent population will hinder the performance
of ADVR, in terms of convergence times and reactivity to the dynamic be-
havior of networks. Hence, we shall strive for an optimal agents population
for a given network that results in acceptable path-cost convergence without
producing excessive average overhead. It can be observed from Figure 3 that
for such an optimal agent population the difference in the normalized con-
vergence time and normalized average overhead would be minimum. Hence
in the given example 15 agents would result in an optimal trade-off between
convergence time and resource overhead. However, the unpredictable behavior
of dynamic networks makes it very difficult to estimate a priori, the value of
this optimal population. Thus, it is necessary that an adaptive multi-agent
system dynamically alters the agent population in response to its resource
Changing the agent population dynamically in response to its environment (re-
sources) is a non-trivial issue in the absence of a central controller. Individual
agents lacking a bird's eye view of the system are unable to make global assess-
ments regarding the environment in terms of resource availability. Therefore,
it requires a high degree of coordination among agents to analyze the global
Here’s what’s next.
This article can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Article.
Amin, Kaizar A. & Mikler, Armin R. Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks, article, March 25, 2002; [New York, New York]. (digital.library.unt.edu/ark:/67531/metadc111275/m1/10/: accessed March 19, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.