PPT-Dynamic Routing

Distance Vector and Link State RIP OSPF Internet Routing IP implements datagram forwarding Both hosts and routers Have an IP module Forward datagrams IP forwarding is tabledriven Table known as routing table. e making routing decision It should process properties like correctness simplici ty robustness stability fairness and optimality Note optimality is always with re spect to chosen criterion Optimality principle if router is on optimal path from rout Ad-hoc . On-Demand Distance Vector . Routing. &. DSR. : The Dynamic Source Routing . Protocol for. . Multi-Hop . Wireless Ad Hoc Networks. November 2011,. Giorgos . Papadakis. & Manolis. Bounded Length Maze Routing. Contributions. Optimal Bounded Length Maze Routing . Heuristic Bounded Length Maze Routing. Parallel Multi-Threaded Collision Aware Strategy for Multi-core Platforms. Bounded Length . Natalie . EnrightJerger. Topology Overview. Definition: determines arrangement of channels and nodes in network. Analogous to road map. Often first step in network design. Routing and flow control build on properties of topology. Kazuya Sakai. , Min-. Te. Sun, Wei-Shinn Ku, . Jie. Wu, and Ten H Lai. Tokyo Metropolitan University. , National Central University, Auburn University, Temple University, The Ohio State University. Aaron Johnson. U.S. Naval Research Laboratory. DC-Area Anonymity, Privacy, and Security Seminar. Onion Routing. u. 1. 2. 3. 4. 5. d. User . u. running client. Internet destination . d. Onion routing relays. . Outline. Background. Classification of Routing Protocols. Data Centric Protocols. Flooding and Gossiping. SPIN. Directed Diffusion. Rumor Routing. Background. Sensor . nodes. Small. , wireless, battery . WIRELESS SENSOR NETWORKS: A . SURVEY. Presented By: . Abbas. . Kazerouni. EE 360 paper presentation, winter 2014,. EE Department, Stanford University. JAMAL N. AL-KARAKI. , . AHMED E. . KAMAL, 2004. GyanRANJAN Hazarika And Karan mirani. Onion Routing. Provides measures against traffic analysis.. Provides protection against eavesdropping. .. Provides bi-directional anonymous communication.. Provides anonymous socket connection through a proxy server for easy deployment.. How can we route traffic between . vlans. ?. By Default . Vlans. isolate them selves.. To Route Traffic we can use:. 1. Router. :. A Router connected with a switch. On this router we can create sub-interfaces to route traffic. Dynamic Routing Protocols. Classifying Routing Protocols. Classful. Routing Protocols. Classful. routing protocols do not send subnet mask information in their routing updates . Only RIPv1 and IGRP are . Protocols. Heng Sovannarith. heng_sovannarith@yahoo.com. Introduction. Routing protocols were created for routers. These protocols have been designed to allow the exchange of routing tables, or known networks, between routers. . Addressing routing scalability issues. NSF Ignite Project . 1. Routing protocol challenges . All Routing . P. rotocols face. S. calability issues – dependency on network size. Flooding on information changes. Ahmed Saeed. †. , Mohamed Ibrahim. †. , Khaled A. . Harras. ‡. , . Moustafa. Youssef. †. † . Egypt-Japan University for Science and Technology (E-JUST), Egypt. ‡. Carnegie Mellon Qatar, Qatar.