Skip to main content
UploadLanguage (EN)Support
BusinessMobileSocial MediaMarketingTechnologyArt & PhotosCareerDesignEducationPresentations & Public SpeakingGovernment & NonprofitHealthcareInternetLawLeadership & ManagementAutomotiveEngineeringSoftwareRecruiting & HRRetailSalesServicesScienceSmall Business & EntrepreneurshipFoodEnvironmentEconomy & FinanceData & AnalyticsInvestor RelationsSportsSpiritualNews & PoliticsTravelSelf ImprovementReal EstateEntertainment & HumorHealth & MedicineDevices & HardwareLifestyle
Uploaded bysubhash85
2,044 views

Dynamic routing under_sec

Dynamic routing is necessary for large networks to automatically update routing tables when network changes occur. However, dynamic routing introduces security problems that need to be addressed. The document discusses static and dynamic routing, routing tables, common routing algorithms, and the need for a new secure routing algorithm that can adapt to topology changes while protecting sensitive network information from hackers.

Technology◦Business◦
DYNAMIC ROUTING UNDER  SECURITY CONSIDERATIONS By Archana
TABLE OF CONTENTS Introduction Routing Static Routing Disadvantages of Static Routing Dynamic Routing Security problems in Routing  Topology Routing Algorithms Objective Conclusion
INTRODUCTION Networking is growing rapidly Dynamic routing necessity in large networks Need to consider the security problems
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.
TOPOLOGY  
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.  
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
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.  
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.
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
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
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
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.
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.
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
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.
THANK YOU