INTENT PATH FORWARDING USING DIJKSTRA ALGORITHM IN ONOS CONTROLLER
The use of intent on computer networks is a new concept in Software-defined Networking (SDN), which aims to translate policy into the network configuration. Some of the benefits of using these intents are that users can configure more dynamically and flexibly to the desired needs and make it easier...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/41810 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The use of intent on computer networks is a new concept in Software-defined Networking (SDN), which aims to translate policy into the network configuration. Some of the benefits of using these intents are that users can configure more dynamically and flexibly to the desired needs and make it easier to automate and optimize the network itself.
ONOS Intent Path Forwarding (ONOS-IPF) is an application designed to implement the concept of user intent using the Open Network Operating System (ONOS) as the Operating System (OS) on SDN. With Dijkstra's algorithm method to find the best path, forwarding policy based on available bandwidth capacity can be achieved and has better performance than the default forwarding application on ONOS.
The results obtained from the use of the Dijkstra algorithm are, the end-to-end latency value generated by the ONOS-IPF application is smaller than the default packet forwarding application on ONOS when used to send packet sizes over 3200 bytes. This ONOS-IPF application also has a convergency time of about 2 seconds and has a secondary path as an auxiliary path to the primary path when the load on the primary path exceeds the smallest bandwidth capacity available on the primary path |
|---|