PhD Projects in PEERSIM Simulator related projects for research scholars. Peer to Peer system composed of millions of nodes which basically join and leave continuously to ensure a communication. We also evaluate various new protocols in development stage.
We guide and support all researchers those who are interested to do research in network area. To implement thesis we develop various approaches also for PhD scholars in network. We implement various new methods based on researcher’s interest and requirements which referred from Elsevier papers. We ensure support to develop various networks with PhD Projects in Peersim simulator.
Components in Peersim Simulator:
We use following component to implement Peersim simulator final year projects are:
We use GraphExtractor class with two methods:
Interface read graph file node list created by GraphExtractor and store information in java object.
We use following parameters are:
- Peersim EasyDJ compiler.
We also provide parallel execution by Distribute () and get () method.
Simulation Environment for Overlay Networks:
We also use two types of simulation engine in Peersim are:
- Cycle Driven Simulator:
We process this simulation by time steps called cycle which all nodes get chance to execute. It also specially designed for epidemic protocols and used to analyze various topologies on studied function. It tests up to 107 nodes.
- Event- Driven Simulator:
This engine executes only the full fledged protocols. It support various kind of transport subtracts. We also use this simulator for both epidemic and normal protocol. It runs cycle driven protocols. And also It tests up to 2.5 * 105 nodes.
We also process two operations in network topology are;
- Changing connection.
- Connection also used to send message protocols.
We also used various protocols in more than 90+ projects to describe prototype such as aggregation, super peer topology construction, load balancing, generic topology management and also Ranking.
We also implement initializer to create static regular random topology using idle protocol (protocol identifier 0). Using peak distribution initializes the aggregate value (protocol identifier 1).
Dynamics are also runtime simulation; based on environmental input we change the state system. By Dynamic networks class node are also removed from network at each cycle.
We develop graph theoretical library also to analyze graph properties such as diameter, clustering and also conductance.