Show simple item record

dc.contributor.advisorChakrabarty, Amitabha
dc.contributor.authorSajid, Asif Sadat
dc.contributor.authorNiloy, Syed Faysal Nasir
dc.contributor.authorHossain, Kh. Arham
dc.contributor.authorRahman, Tasfin
dc.date.accessioned2018-05-17T04:23:34Z
dc.date.available2018-05-17T04:23:34Z
dc.date.copyright2018
dc.date.issued2018-04
dc.identifier.otherID 14101168
dc.identifier.otherID 14101196
dc.identifier.otherID 14101195
dc.identifier.otherID 14301058
dc.identifier.urihttp://hdl.handle.net/10361/10162
dc.descriptionThis thesis is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2018.en_US
dc.descriptionCataloged from PDF version of thesis.
dc.descriptionIncludes bibliographical references (pages 47-49).
dc.description.abstractTraditional 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.en_US
dc.description.statementofresponsibilityAsif Sadat Sajid
dc.description.statementofresponsibilitySyed Faysal Nasir Niloy
dc.description.statementofresponsibilityKh. Arham Hossain
dc.description.statementofresponsibilityTasfin Rahman
dc.format.extent49 pages
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.rightsBRAC 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.
dc.subjectSDN applicationsen_US
dc.subjectTraditional networken_US
dc.subjectSPF algorithmsen_US
dc.subjectBottleneck bandwidthen_US
dc.subjectShortest pathen_US
dc.titleComprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networksen_US
dc.typeThesisen_US
dc.contributor.departmentDepartment of Computer Science and Engineering, BRAC University
dc.description.degreeB. Computer Science and Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record