Write a program in a programming language of your choice to simulate routing using flooding for a network of your choice with at least ten nodes (different from the example in the lecture notes). 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, and each line can handle only one packet per time interval. Discuss your results in terms of the number of duplicate packets produced, and suggest a possible solution for reducing this problem. You will be marked based on the following:
- Well written report with clear explanation of the program.
- Description of the flooding algorithm and the network used.
- Well structured working code.
- Presentation of your results.
- Discussion of your results.
- Solution for reducing the problem of duplicate packets.