• Login
    • Library Home
    View Item 
    •   BracU IR
    • School of Data and Sciences (SDS)
    • Department of Computer Science and Engineering (CSE)
    • Thesis & Report, BSc (Computer Science and Engineering)
    • View Item
    •   BracU IR
    • School of Data and Sciences (SDS)
    • Department of Computer Science and Engineering (CSE)
    • Thesis & Report, BSc (Computer Science and Engineering)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Comprehensive evaluation of shortest path algorithms and highest bottleneck bandwidth algorithm in software defined networks

    Thumbnail
    View/Open
    14101168,14101196,14101195,14301558_CSE.pdf (1.166Mb)
    Date
    2018-04
    Publisher
    BRAC University
    Author
    Sajid, Asif Sadat
    Niloy, Syed Faysal Nasir
    Hossain, Kh. Arham
    Rahman, Tasfin
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/10361/10162
    Abstract
    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.
    Keywords
    SDN applications; Traditional network; SPF algorithms; Bottleneck bandwidth; Shortest path
     
    Description
    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).
    Department
    Department of Computer Science and Engineering, BRAC University
    Collections
    • Thesis & Report, BSc (Computer Science and Engineering)

    Copyright © 2008-2019 Ayesha Abed Library, Brac University 
    Contact Us | Send Feedback
     

     

    Policy Guidelines

    • BracU Policy
    • Publisher Policy

    Browse

    All of BracU Institutional RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Copyright © 2008-2019 Ayesha Abed Library, Brac University 
    Contact Us | Send Feedback