Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 131 views

    Experiment-7: AIM: Write A Program To Implement Link State Routing Algorithm

    Uploaded by

    Vaibhav Kumar
    The document describes an experiment to implement a link state routing algorithm. It discusses link state routing protocols, which work by having each router learn the full network topology from link state packets and then compute the shortest paths using an algorithm like Dijkstra's. The code provided implements Dijkstra's algorithm to calculate the shortest paths from a source router to all other routers, storing the results in distance and last arrays. It then prints the shortest path from the source to each router.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Experiment-7: AIM: Write A Program To Implement Link State Routing Algorithm

    Uploaded by

    Vaibhav Kumar
    131 views4 pages
    The document describes an experiment to implement a link state routing algorithm. It discusses link state routing protocols, which work by having each router learn the full network topology from link state packets and then compute the shortest paths using an algorithm like Dijkstra's. The code provided implements Dijkstra's algorithm to calculate the shortest paths from a source router to all other routers, storing the results in distance and last arrays. It then prints the shortest path from the source to each router.

    Original Title

    CNFile7

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an experiment to implement a link state routing algorithm. It discusses link state routing protocols, which work by having each router learn the full network topology from link state packets and then compute the shortest paths using an algorithm like Dijkstra's. The code provided implements Dijkstra's algorithm to calculate the shortest paths from a source router to all other routers, storing the results in distance and last arrays. It then prints the shortest path from the source to each router.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    131 views4 pages

    Experiment-7: AIM: Write A Program To Implement Link State Routing Algorithm

    Uploaded by

    Vaibhav Kumar
    The document describes an experiment to implement a link state routing algorithm. It discusses link state routing protocols, which work by having each router learn the full network topology from link state packets and then compute the shortest paths using an algorithm like Dijkstra's. The code provided implements Dijkstra's algorithm to calculate the shortest paths from a source router to all other routers, storing the results in distance and last arrays. It then prints the shortest path from the source to each router.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    Experiment-7

    AIM : Write a program to implement Link state routing algorithm.

    Description and related theory:

    Link State Routing –


    Link state routing is the second family of routing protocols. While distance vector routers use
    a distributed algorithm to compute their routing tables, link-state routing uses link-state
    routers to exchange messages that allow each router to learn the entire network topology.
    Based on this learned topology, each router is then able to compute its routing table by using
    a shortest path computation.

    Features of link state routing protocols –


     Link state packet – A small packet that contains routing information.
     Link state database – A collection information gathered from link state packet.
     Shortest path first algorithm (Dijkstra algorithm) – A calculation performed on
    the database results into shortest path
     Routing table – A list of known paths and interfaces.

    ALGORITHM:

    Calculation of shortest path –

    To find shortest path, each node need to run the famous Dijkstra algorithm. This famous
    algorithm uses the following steps:

     Step-1: The node is taken and chosen as a root node of the tree, this creates the tree
    with a single node, and now set the total cost of each node to some value based on the
    information in Link State Database
     Step-2: Now the node selects one node, among all the nodes not in the tree like
    structure, which is nearest to the root, and adds this to the tree.The shape of the tree gets
    changed .
     Step-3: After this node is added to the tree, the cost of all the nodes not in the tree
    needs to be updated because the paths may have been changed.
     Step-4: The node repeats the Step 2. and Step 3. until all the nodes are added in the
    tree

    CODE:

    1. #include <stdio.h>  
    2. #include <string.h>  
    3. int main()  
    4. {  
    5. int count,src_router,i,j,k,w,v,min;  
    6. int cost_matrix[100][100],dist[100],last[100];  
    7. int flag[100];  
    8.     printf("\n Enter the no of routers");  
    9. scanf("%d",&count);   
    10. printf("\n Enter the cost matrix values:");  
    11. for(i=0;i<count;i++)  
    12. {  
    13. for(j=0;j<count;j++)  
    14. {  
    15.             printf("\n%d->%d:",i,j);  
    16. scanf("%d",&cost_matrix[i][j]);  
    17. if(cost_matrix[i][j]<0)cost_matrix[i][j]=1000;  
    18. }  
    19. }  
    20. printf("\n Enter the source router:");  
    21. scanf("%d",&src_router);  
    22. for(v=0;v<count;v++)  
    23. {  
    24. flag[v]=0;  
    25. last[v]=src_router;  
    26. dist[v]=cost_matrix[src_router][v];  
    27. }  
    28. flag[src_router]=1;  
    29. for(i=0;i<count;i++)  
    30. {  
    31. min=1000;  
    32. for(w=0;w<count;w++)  
    33. {  
    34. if(!flag[w])  
    35. if(dist[w]<min)  
    36. {  
    37. v=w;  
    38. min=dist[w];  
    39. }  
    40. }  
    41. flag[v]=1;  
    42. for(w=0;w<count;w++)  
    43. {  
    44. if(!flag[w])  
    45. if(min+cost_matrix[v][w]<dist[w])  
    46. {  
    47. dist[w]=min+cost_matrix[v][w];  
    48. last[w]=v;  
    49. }  
    50. }  
    51. }  
    52. for(i=0;i<count;i++)  
    53. {  
    54.         printf("\n%d==>%d:Path taken:%d",src_router,i,i);  
    55. w=i;  
    56. while(w!=src_router)  
    57. {  
    58. printf("\n<--%d",last[w]);w=last[w];  
    59. }  
    60.         printf("\n Shortest path cost:%d",dist[i]);  
    61. }  
    62. }  
    OUTPUT:

    DISCUSSION:
    Link State protocols in comparison to Distance Vector protocols have:
    1. It requires large amount of memory.
    2. Shortest path computations require many CPU circles.
    3. If network use the little bandwidth ; it quickly reacts to topology changes
    4. All items in the database must be sent to neighbors to form link state packets.
    5. All neighbors must be trusted in the topology.
    6. Authentication mechanisms can be used to avoid undesired adjacency and problems.
    7. No split horizon techniques are possible in the link state routing.

    Open shortest path first (OSPF) routing protocol –

     Open Shortest Path First (OSPF) is a unicast routing protocol


    developed by working group of the Internet Engineering Task Force (IETF).
     It is a intradomain routing protocol.
     It is an open source protocol.
     It is similar to Routing Information Protocol (RIP)
     OSPF is a classless routing protocol, which means that in its updates, it
    includes the subnet of each route it knows about, thus, enabling variable-length subnet
    masks. With variable-length subnet masks, an IP network can be broken into many
    subnets of various sizes. This provides network administrators with extra network-
    configuration flexibility.These updates are multicasts at specific addresses (224.0.0.5
    and 224.0.0.6).
     OSPF is implemented as a program in the network layer using the
    services provided by the Internet Protocol
     IP datagram that carries the messages from OSPF sets the value of
    protocol field to 89
    FINDINGS AND LEARNINGS:
    We learnt about link state routing protocol and its implementation and significance in
    computer networks

    You might also like