Riley, George F.
Fujimoto, Richard
Ammar, Mostafa
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 perhop 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
|
Keywords
routing
stateless routing
NIx-vectors
Notes
Related Papers
Bibtex
@inproceedings{riley.fujimoto.ammar_stateless00,
author = "George F. Riley and Mostafa H. Ammar and Richard Fujimoto",
title = "Stateless Routing in Network Simulations",
booktitle = "{MASCOTS}",
pages = "524-531",
year = "2000",
url = "citeseer.nj.nec.com/riley00stateless.html" }