Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Stateless Routing in Network Simulations \Lambda George F. Riley
 

Summary: Stateless Routing in Network Simulations \Lambda
George F. Riley
Mostafa H. Ammar
Richard Fujimoto
College of Computing
Georgia Institute of Technology
Atlanta, GA 30332
friley,ammar,fujimotog@cc.gatech.edu
(404)894­6855, Fax: (404)894­0272
April 10, 2000
Abstract
The memory resources required by network simulations can grow quadratically with size of
the simulated network. In simulations that use routing tables at each node to perform per­
hop packet forwarding, the storage required for the routing tables is O(N 2 ), where N is the
number of simulated network nodes in the topology. Additionally, the CPU time required in
the simulation environment to compute and populate these routing tables can be excessive and
can dominate the overall simulation time.
We propose new routing technique, known as Neighbor--Index Vectors, or NIx--Vectors, which
eliminates both the storage required for the routing tables and the CPU time required to compute
them. We show experimental results using NIx--Vector routing in the popular network simulator

  

Source: Ammar, Mostafa - College of Computing, Georgia Institute of Technology
Riley, George - College of Computing, Georgia Institute of Technology

 

Collections: Computer Technologies and Information Sciences