Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks
This thesis is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2018.
| Autores principales: | , , , |
|---|---|
| Otros Autores: | |
| Formato: | Tesis |
| Lenguaje: | English |
| Publicado: |
BRAC University
2018
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/10361/10162 |
| id |
10361-10162 |
|---|---|
| record_format |
dspace |
| spelling |
10361-101622022-01-26T10:05:01Z Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks Sajid, Asif Sadat Niloy, Syed Faysal Nasir Hossain, Kh. Arham Rahman, Tasfin Chakrabarty, Amitabha Department of Computer Science and Engineering, BRAC University SDN applications Traditional network SPF algorithms Bottleneck bandwidth Shortest path This thesis is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2018. Cataloged from PDF version of thesis. Includes bibliographical references (pages 47-49). Traditional network architectures are ill-suited to meet the necessities of the present enterprises, carriers, and end users. Hence, new emerging network architecture, Software Defined Network (SDN) can be used to solve the problems since it is more dynamic, manageable, adaptive and programmable. The control and data planes in SDN architecture are decoupled, network intelligence and state are legitimately centralized, and the basic network infrastructure is abstracted from applications. However, a network may reach a point where data flow which is controlled according to the bandwidth is limited by computer or network resources. When bandwidth is unable to accommodate large amounts of system data at designated data transfer rate speeds, it results in bottleneck. We utilized an existing algorithm that can improve network performance by detecting bottlenecks and route packets through the highest bottleneck bandwidth which has been implemented using java programming language. Moreover, although many algorithms have been proposed and used in various applications, a comprehensive evaluation and quantitative comparison of shortest path algorithms in SDN applications is missing. In this paper, we will narrow that gap giving an up-to-date survey of SPF Algorithms in SDN applications. Asif Sadat Sajid Syed Faysal Nasir Niloy Kh. Arham Hossain Tasfin Rahman B. Computer Science and Engineering 2018-05-17T04:23:34Z 2018-05-17T04:23:34Z 2018 2018-04 Thesis ID 14101168 ID 14101196 ID 14101195 ID 14301058 http://hdl.handle.net/10361/10162 en BRAC University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. 49 pages application/pdf BRAC University |
| institution |
Brac University |
| collection |
Institutional Repository |
| language |
English |
| topic |
SDN applications Traditional network SPF algorithms Bottleneck bandwidth Shortest path |
| spellingShingle |
SDN applications Traditional network SPF algorithms Bottleneck bandwidth Shortest path Sajid, Asif Sadat Niloy, Syed Faysal Nasir Hossain, Kh. Arham Rahman, Tasfin Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| description |
This thesis is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2018. |
| author2 |
Chakrabarty, Amitabha |
| author_facet |
Chakrabarty, Amitabha Sajid, Asif Sadat Niloy, Syed Faysal Nasir Hossain, Kh. Arham Rahman, Tasfin |
| format |
Thesis |
| author |
Sajid, Asif Sadat Niloy, Syed Faysal Nasir Hossain, Kh. Arham Rahman, Tasfin |
| author_sort |
Sajid, Asif Sadat |
| title |
Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| title_short |
Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| title_full |
Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| title_fullStr |
Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| title_full_unstemmed |
Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| title_sort |
comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks |
| publisher |
BRAC University |
| publishDate |
2018 |
| url |
http://hdl.handle.net/10361/10162 |
| work_keys_str_mv |
AT sajidasifsadat comprehensiveevaluationofshortestpathalgorithmsandhighestbottleneckbandwidthalgorithminsoftwaredefinednetworks AT niloysyedfaysalnasir comprehensiveevaluationofshortestpathalgorithmsandhighestbottleneckbandwidthalgorithminsoftwaredefinednetworks AT hossainkharham comprehensiveevaluationofshortestpathalgorithmsandhighestbottleneckbandwidthalgorithminsoftwaredefinednetworks AT rahmantasfin comprehensiveevaluationofshortestpathalgorithmsandhighestbottleneckbandwidthalgorithminsoftwaredefinednetworks |
| _version_ |
1814307184400400384 |