Your SlideShare is downloading. ×
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Dynamic routing under_sec
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Dynamic routing under_sec

751

Published on

Published in: Technology, Business
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
751
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
0
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide
  • Dynamic routing protocols are "languages" routers use to communicate the details and status of networks to which they are connected. Examples include  RIP ,  OSPF ,  EIGRP ,  BGP  and  IS-IS . 
  • Transcript

    • 1. DYNAMIC ROUTING UNDER  SECURITY CONSIDERATIONS By Archana
    • 2. TABLE OF CONTENTS
        • Introduction
        • Routing
        • Static Routing
        • Disadvantages of Static Routing
        • Dynamic Routing
        • Security problems in Routing 
        • Topology
        • Routing Algorithms
        • Objective
        • Conclusion
    • 3. INTRODUCTION
        • Networking is growing rapidly
        • Dynamic routing necessity in large networks
        • Need to consider the security problems
    • 4. ROUTER AND ROUTING
        • Router forwards data packets across computer networks.
      •  
        • Functionality
      •  
        • Routing Tables
      •  
      •  
        • Routing is selecting paths in a network along which to send network traffic.
    • 5. TOPOLOGY
      •  
    • 6. STATIC ROUTING
        • Manually adding routes to the routing table.
      •  
        • routes through a data network are described by fixed paths
      •  
        • usually entered into the router by the system administrator.
      •  
        • static routing table is created, maintained, and updated by a network administrator, manually.
      •  
    • 7. DISADVANTAGES OF STATIC ROUTING
        • Difficult to configure
      •  
        • Cannot adapt to addition of new links or nodes
      •  
        • Cannot adapt to link or node failures
      •  
        • Cannot easily handle multiple paths to a destination
      •  
        • Does not scale to large networks
      •  
        • Solution is to use Dynamic Routing
    • 8. DYNAMIC ROUTING
        •   Selection of the routing path by the router upon updating the routing table dynamically.
        • Follow Dynamic Routing protocol to update messages between routers
      •  
        • Automatically update routing table when topology changes
      •  
        • Determine best path to a destination.  
    • 9. DYNAMIC ROUTING PROTOCOLS
      • Function(s) of Dynamic Routing Protocols :
        • -Dynamically share information between routers.
        • -Automatically update routing table when topology changes.
        • -Determine best path to a destination.
    • 10. DYNAMIC ROUTING VS STATIC ROUTING Complexity Configuration Generally Independent of the Network size Increases with network size Required Administrator Knowledge Advanced Knowledge Required No Extra Knowledge is required Topology Changes automatically Adopts to Topology Changes Administrator intervention is required Scaling Suitable for simple and complex networks Suitable for simple networks Security Less secure More Secure Predictability Routing Depends on the current topology Routing to destination is always same
    • 11. ROUTING TABLE
      • It is a data structure in the form of a table-like object stored in a router
      • Table consists of at least three information fields:-
      • Network id
      • Cost
      • Next hop
    • 12. EXAMPLE Routing table for B Destination Cost Next Hop A 1 A C 1 C D 2 C E 2 A F 2 A G 3 A
    • 13. SECURITY PROBLEMS
      •   O rganization system needs high security for data transmission from one organization to other organizations system.
      • Hackers can steel the information from the organization if the network is not secured.
      • Security is major problem in Defence and Government network organizations.
    • 14. ROUTING ALGORITHMS
      •   Mainly two types of algorithms:
      • Link state Routing Algorithm
        • Network topology is known by all nodes
      • Distance Vector Routing Algorithm
        • Rely on exchanging info among neighbor nodes.
    • 15. OBJECTIVE
      •   To Analyze the existing Routing Algorithms
      • Propose a new Routing Algorithm which satisfies the security problems
      • Conduct simulation to verify the results
      • Show the capability of the proposed algorithm
    • 16. CONCLUSION
      •   Efficient Algorithms are needed for optimal path selection in large networks.
      • Secured algorithms are also needed for the routing.
      • Proposed Algorithm should support many routing protocols
      • Test the proposed algorithm on various networks.
    • 17. THANK YOU      

    ×