Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks Page: 13
The following text was automatically extracted from the image on this page using optical character recognition software:
Agent Module Output Lint
Agent 1 Agent n Routing
Fig. 6. Simulation Model for ADVR
rate of the link. The transmission rate of the link is given by 1/Tt, where Tt is
the transmission time for one packet. For our experiments we have assumed
the link capacity to be 10 Mbps, thereby giving us an average transmission
rate of approximately 2500 packets per second (pps). Hence it is clear that
a majority of the queuing would occur at the output queues due to its slow
Figure 6 shows the simulation model for ADVR. It has an additional module
for agent management which provides a runtime environment for agents. The
agent management module provides the framework for agent transmission,
reception, population control, and route maintenance functions. All agent re-
lated packets (agent code and agent data) are forwarded to the agent manage-
ment module where they are queued in the agent queue. Agents (agent code)
are activated by the agent management module from the agent queue and
receive their respective data (agent data). Depending on the data received by
the agents, they update the routing table. On completion of its task, the agent
is transmitted by this module to the next node using the migration strategy
discussed in Section 3.1. The routing process is responsible for routing incom-
ing regular data packets to the appropriate interfaces using the routing table
maintained by the agents.
Experiments were conducted on a medium sized 40 node network with an
average degree of 7. The results in this section represent the mean over mul-
tiple random experiments and different random graphs of the same type. The
analysis does not cover the performance of the network after convergence of
the routing tables, unless otherwise mentioned. The analysis of results in this
section have been conducted with reference to certain definitions.
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/13/: accessed January 23, 2019), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.