Hot Downloads



The forum is in read only mode.
Welcome, Guest
Username: Password: Remember me
  • Page:
  • 1

TOPIC: regarding algos of routing

regarding algos of routing 9 years 10 months ago #27398

hello there
i have just studied about the dijkastra and bellman ford algorithms from a book (author:tanambum") but i havent get good understanding about how it works and what are the relevant consideration it will take at the time of creating metrices

Re: regarding algos of routing 9 years 10 months ago #27399

  • S0lo
  • S0lo's Avatar
  • Offline
  • Moderator
  • Moderator
  • Posts: 1577
  • Karma: 3
  • Thank you received: 7
It's not easy to explain those details in plain English, you need to use visuals, But the basics are, For dijkstra, Given a graph of nodes and weighted edges, and a Starting node. The "dijkstra shortest path" algorithm finds all shortest paths from the starting node to all other nodes. Here is an online applet that will help you understand how it works, You can draw your own graph with it:


Bellman–Ford algorithm also computes the shortest paths in a weighted graph but with the advantage that some of the edge weights can be negative). Dijkstra's algorithm solves the same problem with a lower running time, but requires edge weights to be non-negative. So, Bellman–Ford is often used only when there are negative edge weights. Here is an applet for it:

Bellman–Ford (choose it from the list):
  • Page:
  • 1
Time to create page: 0.157 seconds


Cisco Routers

  • SSL WebVPN
  • Securing Routers
  • Policy Based Routing
  • Router on-a-Stick

VPN Security

  • Understand DMVPN
  • GRE/IPSec Configuration
  • Site-to-Site IPSec VPN
  • IPSec Modes

Cisco Help

  • VPN Client Windows 8
  • VPN Client Windows 7
  • CCP Display Problem
  • Cisco Support App.

Windows 2012

  • New Features
  • Licensing
  • Hyper-V / VDI
  • Install Hyper-V


  • File Permissions
  • Webmin
  • Groups - Users
  • Samba Setup