[vc_empty_space][vc_empty_space]
ONOS Intent Path Forwarding using Dijkstra Algorithm
Irfan T.a, Hakimi R.a, Risdianto A.C.b, Mulyana E.a
a School of Electrical Engineering and Informatics, Bandung Institute of Technology, Bandung, Indonesia
b School of Electrical Engineering and Computer Science, Gwangju Institute of Science and Technology, South Korea
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2019 IEEE.The use of intent on computer networking is a new concept that can be used in Software-defined Networking (SDN) technology, where the purpose is to translate high-level policies into the network configuration. ONOS Intent Path Forwarding (ONOS-IPF) is the application designed to implements the concept of the use of the intent on Software-defined Networking (SDN) with an Open Network Operating System (ONOS) as its controller. With a policy to have high availability and less latency than ONOS default application packet forwarding, this ONOS-IPF application will create a packet forwarding based on bandwidth capacity and network traffic utilization rather than use hop count only. In order to achieve its goal of applying policy into a form of network configuration, the utilization of the Dijkstra shortest path algorithm as the main method is needed in this application. As a result, the end-to-end path latency created by for this application is smallest than default ONOS forwarding application when it used to deliver packet size is more than 3200 bytes. This ONOS-IPF application also a high availability with time convergence around 2 seconds and have a secondary path as a backup for the primary path.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Bandwidth capacity,Computer networking,Dijkstra algorithms,Dijkstra shortest-path algorithm,High level policies,Network configuration,Packet forwarding,Software defined networking (SDN)[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Dijkstra,Intent,ONOS[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICEEI47359.2019.8988853[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]