Go Back   Data Center, Colocation, Cloud Computing, Storage, Dedicated Servers Forums > Telecom Discussion Forum > Routing Algorithms



Thread Tools
Old 12-29-2009, 03:55 PM
JuliaTolmacha JuliaTolmacha is offline
Junior Member
Join Date: Dec 2009
Posts: 1
Default Introduction of Routing Algoritms

Hour 3 will focus primarily on routing algorithms. The routing algorithm is a formula that is stored in the router's memory. The routing algorithm your protocol uses is a major factor in the performance of your routing environment. The purpose of the routing algorithm is to make decisions for the router concerning the best paths for data.

Think of the routing algorithm as the traffic officer of the router. In the same way that traffic officers guide and shape the way cars drive through busy intersections, routing algorithms make decisions concerning the path data will take from one network to another.

The router uses the routing algorithm to compute the path that would best serve to transport the data from the source to the destination. However, you cannot directly choose the algorithm that your router uses. Rather, the routing protocol you choose for your network determines which algorithm you will use. For example, whereas the routing protocol RIP may use one type of routing algorithm to help the router move data, the routing protocol OSPF uses another.

You are learning about routing algorithms in this lesson as a prerequisite to future lessons on routing protocols. Knowing how routing algorithms work will give you a better understanding of routing protocols and the concepts behind why some protocols work better in certain situations. Many of the differences between particular routing protocols are directly related to differences in their routing algorithms.

Old 01-16-2010, 04:02 AM
mehboob mehboob is offline
Junior Member
Join Date: Jan 2010
Posts: 8

I just subscribed to this thread!! Hope you get into higher level of routing discussions in the future.
Old 04-02-2010, 03:40 PM
david6720 david6720 is offline
Junior Member
Join Date: Mar 2010
Posts: 4

for a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).



Piggy Banks

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump

All times are GMT. The time now is 05:37 AM.

Member Area

Data Center Industry Daily News

Cloud and Dedicated Hosting

Sponsors Managed Servers Sponsored by DedicatedNOW.
Powered by vBulletin® Version 3.8.9
Copyright ©2000 - 2021, vBulletin Solutions, Inc.