Construct a topology from the NLSR log file.
代写C++作业 Using the given log file, figure out the topology of the network by looking at the Link State Adjacency announcement and present it in the ···
NLSR is a link-state routing protocol used for NDN. 代写C++作业
Using the given log file, figure out the topology of the network by looking at the Link State Adjacency announcement and present it in the following format:
Fig: Simple topology with 10ms link delay between each nodes (LD = Link Delay)
Let us consider a simple example with the above triangular topology. For this topology the corresponding output file will be as follows:
[nodes] a:
b:
c:
[links]
a:b delay=10ms
a:c delay=10ms
b:c delay=10ms
Hints:
- Nodename: In the output format use the names found in the log file instead of a,b, or c as shown above:
/<network>/<site>/%C1.Router/<node-name> = node-name
Example:
/ndn/edu/memphis/%C1.Router/titan/ = titan
- AdjacencyLSA/LSDB details (these are the wire Check the logs to see how it is actually printed):
Additional question [Attempt if you are done early with the main question]:
Verify/analyze the routing table printed in the logs and check that the calculated costs are correct by matching it with your output topology.
Language: Any, Preferred: Shell scripting or C++ or Python
Duration: 24 hours