Analisis Distance Vector Protocol Routing dan Link State Routing Protocol Pada Jaringan Software Defined Network

The development of computer networks, scalability, and network complexity is getting
higher. It causes problems in the conventional network, one of them is complex configuration.
The technology solutions by providing SDN in managing, designing, and building a network by
separate control plane and data plane. This makes the network devices such as switches or
routers can forward data according to what was ordered by the controller. Several technology
protocols that exist in the conventional network can also be applied in the network SDN, including
technology/routing protocols. This study conducted by means of simulation analysis by comparing
OSPF and RIPv2 routing protocol on the network that used SDN controller mininet and
RouteFlow. This study also used a parameter Round Trip Time (RTT), Delay, Packet Loss, and
Convergence Time. Scenarios and Convergence Time RTT was carried out by providing
bandwidth of 25 Mbps - 200 Mbps, with a 10ms delay constraints, while on Delay and Packet
Loss given varied background traffic at 25 Mbps - 200 Mbps. Based on the results of the study
conducted at SDN network, routing protocol OSPF is not completely better than the RIPv2.
Whereas packet loss obtained a percentage of 0% in OSPF and RIPv2 routing.