Chakrabarty, AmitabhaSajid, Asif SadatNiloy, Syed Faysal NasirHossain, Kh. ArhamRahman, Tasfin2018-05-172018-05-1720182018-04ID 14101168ID 14101196ID 14101195ID 14301058http://hdl.handle.net/10361/10162Cataloged from PDF version of thesis.Includes bibliographical references (pages 47-49).This thesis is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2018.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.49 pagesenBRAC 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.SDN applicationsTraditional networkSPF algorithmsBottleneck bandwidthShortest pathThesis