Question: Write a program to simulate routing using flooding. Each packet should contain a counter that is decremented on each hop. When the counter gets to
Write a program to simulate routing using flooding. Each packet should contain a counter that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, with each line handling one packet per time interval. Make three versions of the program: all lines are flooded, all lines except the input line are flooded, and only the (statically chosen) best k lines are flooded. Compare flooding with deterministic routing (k = 1) in terms of both delay and the bandwidth used.
Step by Step Solution
3.40 Rating (166 Votes )
There are 3 Steps involved in it
Java Algorithm step1enter the number of nodes in network step2make matrix of network n... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
1790_60f58f34e1094_820573.pdf
180 KBs PDF File
1790_60f58f34e1094_820573.docx
120 KBs Word File
