APPLICATION OF GRAPH ALGORITHM IN SOLVING NETWORK ROUTING PROBLEM

  • Type: Project
  • Department: Computer Science
  • Project ID: CPU2050
  • Access Fee: ₦5,000 ($14)
  • Pages: 111 Pages
  • Format: Microsoft Word
  • Views: 154
  • Report This work

For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

SOURCE CODE INCLUDED

ABSTRACT

In the fundamental operation in computer science, Graph algorithm is a great tool used to solve problems related to graph theory and this algorithms have wide applications in solving routing problems. For the purpose of this project four algorithms from the many types of graph algorithms were selected which are Dijkstra’s, Bellman-Ford, kruskal and prim’s Algorithm and it application in solving network routing problem was discussed and tested using a hypothetical scenario where results showing the shortest path between data points in a typical communication network was calculated and display using JAVA programming language to implement it on Netbeans IDE 8.2. However, bellman-ford algorithm which is an algorithm that deals with negative edges does not produce the same output as the rest algorithms due to the data used in testing them all which was a limitation in the test.

TABLE OF CONTENT

ContentPage

Title pagei

Declarationii

Approval Pageiii

Dedicationiv

Acknowledgementsv

Table of Contentsvi

List of Figuresvii

List of Tablesviii

Abstractix

CHAPTER ONE: INTRODUCTION

Background of Study1

Statement of the Problem4

Aim and Objectives of the Study5

Justification of the Study5

Scope of the Study6

Definition of Terms6

CHAPTER TWO: LITERATURE REVIEW

2.1Introduction8

2.2Graph Algorithm10

2.2.1Shortest Path Algorithms10

2.2.2Minimum Spanning Trees22

2.3Related Reviews34

CHAPTER THREE: RESEARCH METHODOLOGY

3.1Introduction39

3.2Pseudocode39

3.2.1 Dijkstra’s Algorithm39

3.2.2Bellman-Ford Algorithm40

3.2.3Kruskal’s Algorithm41

3.2.4Prim’s Algorithm42

3.3Tool Used43

3.4Approach Used43

CHAPTER FOUR: IMPLEMENTATION AND RESULT

4.1Introduction44

4.2Hypothesis45

4.3Test45

4.4Result47

4.5Conclusion52

4.6Limitation53

CHAPTER FIVE: SUMMARY, CONCLUSION AND RECOMMENDATION

5.1Summary54

5.2Conclusion54

5.3Recommendation55

5.4Limitation of Study55

REFERENCE56

APPENDIX A57






LIST OF FIGURES

FiguresPages

2.1  Undirected and Directed Graph9

2.2.1Undirected weighted Graph11

2.2.1 Undirected weighted grap with nodes and edges12

2.2.1Dijkstra’s Shortest Path Algorithm16

2.2.1Bellman-Ford Algorithm20

2.2.2Minimum Spanning Tree for Kruskal Algorithm27

2.2.2Minimum Spanning Tree for Prim’s Algorithm32

4.1Typical network graph43

4.3Typical Communication network46

4.4output window showing the shortest path from 0 to 2.48

4.4Output window showing minimum path to reach all data 

points using Kruskal’s Algorithm.50

4.4Output window showing minimum path to reach all data 

points using Prim’s Algorithm.51






LIST OF TABLES

TablesPages

3.1Pseudocode for Dijkstra’s Algorithm39

3.2Pseudocode for Bellman-Ford Algorithm39

3.3Pseudocode for Kruskal Algorithm40

3.4Pseudocode for Prim’s Algorithm41

4.1Inputs to Dijkstra’s algorithm47

4.2 Inputs given to Dijkstra’s algorithm (Distance)47

4.3Determination of the shortest path Algorithm48



APPLICATION OF GRAPH ALGORITHM IN SOLVING NETWORK ROUTING PROBLEM
For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Share This
  • Type: Project
  • Department: Computer Science
  • Project ID: CPU2050
  • Access Fee: ₦5,000 ($14)
  • Pages: 111 Pages
  • Format: Microsoft Word
  • Views: 154
Payment Instruction
Bank payment for Nigerians, Make a payment of ₦ 5,000 to

Bank GTBANK
gtbank
Account Name Obiaks Business Venture
Account Number 0211074565

Bitcoin: Make a payment of 0.0005 to

Bitcoin(Btc)

btc wallet
Copy to clipboard Copy text

500
Leave a comment...

    Details

    Type Project
    Department Computer Science
    Project ID CPU2050
    Fee ₦5,000 ($14)
    No of Pages 111 Pages
    Format Microsoft Word

    Related Works

    Credit card fraud has been a common theft process around the globe recently. This project looks into solving and minimizing the risk of credit card fraud using AI (Artificial Intelligence) models.... Continue Reading
    Credit card fraud has been a common theft process around the globe recently. This project looks into solving and minimizing the risk of credit card fraud using AI (Artificial Intelligence) models. ... Continue Reading
    ABSTRACT Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages... Continue Reading
    ABSTRACT Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages... Continue Reading
    ABSTRACT The Transmission Control Protocol (TCP) wad designed to provide reliable end-to-end delivery of data over unreliable networks. In practice most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad hoc Network can lead to TCP implementations with poor performance. In order to... Continue Reading
    ABSTRACT The Transmission Control Protocol (TCP) wad designed to provide reliable end-to-end delivery of data over unreliable networks. In practice most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad hoc Network can lead to TCP implementations with poor performance. In order to... Continue Reading
    ABSTRACT A mobile ad-hoc network (MANET) consists of wireless mobile hosts (nodes) that communicate with each other over wireless link, in the absence of a fixed infrastructure. Routes between two hosts in MANET may consists of hops through other hosts in the network, due to the limitation of broadcasting range of each host Movement of hosts... Continue Reading
    ABSTRACT A mobile ad-hoc network (MANET) consists of wireless mobile hosts (nodes) that communicate with each other over wireless link, in the absence of a fixed infrastructure. Routes between two hosts in MANET may consists of hops through other hosts in the network, due to the limitation of broadcasting range of each host Movement of hosts... Continue Reading
    ABSTRACT This project work, is a computerization it Performance evaluation of routing algorithm using NS2 of an organization. Full duplex asynchronous data transfer system based on a single-phase two-line coding. (a) Data is transmitted from a primary module PM to a secondary module SM, while data is transmitted from the secondary module SM to the... Continue Reading
    ABSTRACT This project work, is a computerization it Performance evaluation of routing algorithm using  NS2 of an organization.  Full duplex asynchronous data transfer system based on a single-phase two-line coding. (a) Data is transmitted from a primary module PM to a secondary module SM, while data is transmitted from the secondary module SM to... Continue Reading
    Call Us
    Get this work
    whatsappWhatsApp Us