Implement a simulator, in Java, for evaluating AntNet routing protocol

and produce different, independent outputs. The detailed description about AntNet routingalgorithm is not represented here. Reader can find it in the paper "AntNet: DistributedStigmergetic Control for Communications Networks" written by Gianni Di Caro andMarco Dorigo in 1998. Here I just talk about how to implement the AntNet in thissimulator. It also illustrates how to implement a new component in the CuRS. As describedabove, AntNet routing algorithm needs ant agents to collect and update the informationabout network condition. So each agent was defined as an Object. Here two kinds of events:LaunchForwardAnt, LaunchBackwardAnt, are added in the Event class. AntNet is anObject used to deal with routing processing.To evaluate the performance of the AntNet, SPF (Shortest Path First) routing algorithm isimplemented in this project for comparison. Which is link-state routing algorithm. Inlink-state routing algorithms, each node tries to maintain a database describing the networktopology and the link costs. Using this database, each node independently calculatesshortest paths, and uses them to decide the next hop for any destination. Each nodebroadcasts the costs of its entire outgoing links to all other nodes in the network.For better evaluate the performance of the AntNet, OSPF should also be implemented forcomparison routing algorithm.4. Experiments and ResultsWhen evaluating the routing algorithm, the most common performance measures arethroughput and average packet delay. Throughput indicates the quantity of the service thatthe network has been able to offer in a certain amount of time; While the average packetdelay is used to measure the quality of the service produced at the same time. We alreadydefined the performance monitor in the simulator. So the user just need create the networktopology with the condition set. After simulating for the specific period, then compares thedifference of the output parameters of the Performance Monitor using the different routingalgorithms. then obtains the results.In this project, I just use two network instances to evaluate the performance of the routingalgorithms. One is the example network in the Figure 4, another is the NSFNET in theFigure 5.4.1 Example Network (7 nodes, 8 links)The example network composed of 7 nodes and 8 bidirectional links. In the experimentswith example network, we initialize the random number generator using the 10 differentvalues of seed which generate 10 different sequences of events. For each sequence ofevents, we collected the measures of both routing algorithms we try to compare. The otheroption value we used in this experiment are: -perfdt 1000000 –skipt5000000 ./etc/example-net 10000000.Routing seed Time of Total network Average delay/packetAlgorithmSnapshot(ticks) throughputSPF 758596 1000162 76.77512485954551 18.397466666666666ANTNET 758596SPF 98056 1000162 76.77512485954551 18.388720000000003ANTNET 98056