Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks Page: 18
The following text was automatically extracted from the image on this page using optical character recognition software:
100 - 100 -
( ) V rInital Panceal Potion20 Initial Population = 20
180 Iitil Population = 150 180 Inital Population = 150
60 ~160 -
120 - * 120
5100 52 100
duce the population until it reaches a stable number. Figure 10(b) displays
the variance in agent population with Node Pheromones having reduced de-
gree of volatility (A). Low values of A significantly stabilizes the variation in
agent population. Although less volatile pheromones reduces the variance in
population, it also reduces the sensitivity of the system to react and rapidly
adapt to sudden changes in the environment.
The agent population control exhibits a flexible, fault tolerant mechanism
whereby loss of agents in the network do not impose any performance penalties
on ADVR. This is extremely important in an adaptive, self-controlling agent
based system in the absence of centralized controller. Such a control mecha-
nism gives agents the autonomy to escalate their population on detection of
link/node failures, thereby rapidly propagating the new information through-
out the network without suffering from the broadcast dilemma. Regular agents,
on detecting a link/node failure clone themselves to produce multiple Auzil
iary agents that are entrusted with the task of propagating the information
regarding link/node failure throughout the network. Although the concept of
Auxiliary agents is very interesting, its validity needs to be verified. Ongoing
research is investigating issues such as routing loops created/terminated by
these Auziliary agents.
5 Conclusion and Future sensitivity of the system to reatork
This paper describes a distance vector routing scheme based on the mobile
agent paradigm opulAgent-based Distance Vector Routing. One of the major
disadvantages of conventional implementations of distance vector routing al-
gorithms is that their corresponding resource overhead is generally unbounded.
In the proposed ADVR, the messages are replaced by a population of agents.
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/18/: accessed September 20, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.