Language Bar

Friday, November 26, 2010

CS610 Assignment 2



CS 610 Computer Networks
Assignment # 02
Fall 2010
                                                                             Total Marks = 20

Deadline  
Your assignment must be uploaded / submitted before or on Nov 26, 2010.

Upload Instructions
Please view the assignment submission process document provided to by the Virtual
University to upload the assignment.

Rules for Marking
Please note that your assignment will not be graded if:
·         It is submitted after due date
·         The file you uploaded does not open
·         The file you uploaded is copied from some one else or from internet
·         It is in some format other than .doc

Objective
The assignment has been designed to enable you develop:
  • Understanding about routing algorithms



Note: Material that is an exact copy from handouts or internet would be graded zero marks. Your solution should consist of the material found through different sources and written in your own wordings.


Assignment Statement:
Give detailed comparison of all routing algorithms with respect to the type of network. 


------------------------------------------------------------------------------------------------

Note: Solve it by yourself

 CS_610 2nd
assignment solution

Question:
Give detailed comparison of all routing algorithms with respect to the type of
network.
Solution:
Routing algorithms can be defined as a mechanism that tells the router how to
process. All these algorithms are different from others regarding their design and
efficiency and type. Routing algorithms can broadly be divided into following
categories;

 
Ø Static versus dynamic
Ø Single-path versus multipath
Ø Flat versus hierarchical
Ø Host-intelligent versus router-intelligent
Ø Interadomain versus interdomain
Ø Link-state versus distance vector
 

All these algorithms have different design, different working and different
metrics to measure the best paths for routing.


Static versus dynamic 

Static algorithms are actually the tables that are created by the network
administrator before the beginning of routing; they will not be updated till an
administrator does it manually. While the dynamic routing algorithms are updated
as they find any sort of change in routing paths.

 
Single-path versus multipath
The single path routing algorithms have a single path to the destination while
multipath algorithms allow traffic to route over multiple lines in order to get more
efficiency and load balancing.


Flat versus hierarchical 

The scenarios where flat algorithm routing protocols are implemented, the
routers are just like peers to each other while in hierarchical algorithms routers
might be differentiated into backbone and non-backbone routers and so is their
functionalities.

 
Host-intelligent versus router-intelligent
Host intelligent algorithms let the source routers work involuntarily and
mindlessly, they just send packets and leave the decision on destination routers.
In router intelligent algorithm routers define their path to destination regarding
their own routing path calculations.

 
Interadomain versus interdomain
Routing algorithms that are restricted to only work within the domain are referred
as interadomain routing algorithms and if they are not restricted only within the
domains then they are interdomain algorithms.


Link-state versus distance vector
Link state algorithms, all routers send the states updating of their linked nodes to
all other nodes in the Internetwork while distance vector algorithms are able to
send only the major changes to its neighbours.



   

Amazon

Disqus

comments powered by Disqus

CONTACT US FORM