Show simple item record

dc.contributor.advisorChakrabarty, Amitabha
dc.contributor.authorGhosh, Soumen
dc.contributor.authorMehedi, Nayeem
dc.contributor.authorKhandoker, Sahariar
dc.contributor.authorAanwar, Sabbir
dc.date.accessioned2018-02-20T07:05:04Z
dc.date.available2018-02-20T07:05:04Z
dc.date.copyright2017
dc.date.issued2017-12-24
dc.identifier.otherID 14101157
dc.identifier.otherID 14101158
dc.identifier.otherID 14101159
dc.identifier.otherID 13201072
dc.identifier.urihttp://hdl.handle.net/10361/9531
dc.descriptionThis thesis report is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2017.en_US
dc.descriptionCataloged from PDF version of thesis report.
dc.descriptionIncludes bibliographical references (pages 45-47).
dc.description.abstractSoftware Defined Networking (SDN) is a new idea of networking where Central Server takes all the decisions and finds a path for a packet to move from source to destination whereas in traditional networking a router takes decisions and finds path for the packet. The main advantage of SDN is that it reduces the time complexity of packet transfer as routers do not have to look up routing table for a path and it can reduce the packet loss to a minimum level. In traditional network, the routers make decisions according to their routing table which most of the time cannot grasp the full network topology. However, in SDN, central server possesses the entire routing table to control the data flow of network. As a result, the percentage of packet loss becomes at a minimal level. Though making packet loss zero percent cannot be achievable due to insufficient data flow path or any other physical factors, it is still less than the traditional network. In this paper, we have implemented two algorithms, Shortest Path First (SPF) and Bandwidth Aware Routing (BAR). We have simulated the algorithms in different topology using JAVA. We have noted down the packet loss, latency, path cost and bandwidth. We have developed our thesis between the comparison of Shortest Path First (SPF) and Bandwidth Aware Routing (BAR). We have simulated network graph on the both algorithms to get results of latency, bandwidth, packet loss, path cost. We hope that this comparison will help to get a clear picture about the advantages and disadvantages of these algorithmsen_US
dc.description.statementofresponsibilitySoumen Ghosh
dc.description.statementofresponsibilityNayeem Mehedi
dc.description.statementofresponsibilitySahariar Khandoker
dc.description.statementofresponsibilitySabbir Aanwar
dc.format.extent47 pages
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.rightsBRAC University thesis reports 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.subjectSDNen_US
dc.subjectRouting algorithmen_US
dc.subjectSPFen_US
dc.subjectBARen_US
dc.titleComparative analysis between SPF and BAR algorithm in SDN unicast networken_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