Hybrid NDP Proxy in OpenFlow Network

The implementation of Neighbor Discovery Protocol (NDP) in OpenFlow network was handled specifically by three different methods including the learning switch, reactive proxy, and proactive mechanism. All of the specified approaches still raised problems either consuming the controller’s resources or forcing manual adjustment by the network administrator. This paper combined both reactive and proactive manner by deploying an application called Hybrid NDP proxy (HNDPP). The controller stored all information from Neighbor Solicitation (NS) request for generating OFPT_FLOW_MOD message as the guideline for the OpenFlow switch to response and craft the Neighbor Advertisement (NA) based on the defined selector and treatment. The research’s results showed the effectiveness of the HNDPP by reducing the number of NS requests that entering the controller up to 20 packets on average. In addition, the waiting time for receiving NA packet lessened approximately below 0.5 ms

Semi-reactive Switch Based Proxy ARP in SDN

In order to achieve high scalability during the network discovery process in software-defined networking (SDN), an extensive method for generating switch-based proxy is essential. This paper investigated the semi reactive solution for guiding the controller to build an OFPT_FLOW_MOD message that allowed SDN switch to reply an Address Resolution Protocol (ARP) request directly by deploying the semi-reactive switch-based proxy ARP application in northbound application programming interface (API). We conduct the experiment by using Open Networking Operating System (ONOS) an open-source SDN controller simulated in Mininet environment. As can be seen from the evaluation result, the installed application can reduce the ARP reaction time up to 95% calculated from the sender host. The final result also indicates that our approach can decrease the controller's loads significantly

Semi-reactive Switch Based Proxy ARP in SDN

In order to achieve high scalability during the network discovery process in software-defined networking (SDN), an extensive method for generating switch-based proxy is essential. This paper investigated the semi reactive solution for guiding the controller to build an OFPT_FLOW_MOD message that allowed SDN switch to reply an Address Resolution Protocol (ARP) request directly by deploying the semi-reactive switch-based proxy ARP application in northbound application programming interface (API). We conduct the experiment by using Open Networking Operating System (ONOS) an open-source SDN controller simulated in Mininet environment. As can be seen from the evaluation result, the installed application can reduce the ARP reaction time up to 95% calculated from the sender host. The final result also indicates that our approach can decrease the controller's loads significantly

SProxy ARP - efficient ARP handling in SDN

Address Resolution Protocol (ARP) traffic typically makes up a very significant amount of broadcast traffic in a wide range of networks. A common approach to reduce the network overhead of ARP in the context of Software Defined Networks (SDN) is via Proxy ARP, where the SDN controller answers ARP requests on behalf of the hosts. In this paper, we present a significant improvement of this approach, by offloading the proxy ARP functionality from the controller to OpenFlow switches. As we will show via experiments, this has the benefit of significantly reducing the controller load as well as the ARP response time. In contrast to related works, our approach does not rely on any non-standard switch extensions, and is fully OpenFlow standard compliant

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words