PPT-Introduction to IP Routing

Geoff Huston Routing How do packets get from A to B in the Internet A B Internet Connectionless Forwarding Each router switch makes a LOCAL decision to forward the packet towards B A B R1. 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. EETS 8316 wireless networks. . SUBMITTED BY. . ONKAR BIWALKAR SMU ID : 39603152. 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 . Xilinx Training. After completing this module, you will be able to:. Explain the causes of routing congestion problems. Use design techniques that optimize routing before a routing congestion problem develops. 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. Yehdhih. . Ould. Mohammed Moctar. 1. . Guy G.F. Lemieux. 2. . Philip Brisk. 1. 1. University of California Riverside . 2. University of British Columbia. 22. nd. International Conference on Field Programmable Logic and Applications. Outline. Background. Motivation. Topology description. Routing. Minimal Routing. Valiant Routing. UGAL/G Adaptive Routing. Indirect Adaptive Routing. Credit Round Trip. Reservation. Piggyback. Progressive. . Outline. Background. Classification of Routing Protocols. Data Centric Protocols. Flooding and Gossiping. SPIN. Directed Diffusion. Rumor Routing. Background. Sensor . nodes. Small. , wireless, battery . Ran Manevich, Israel Cidon, Avinoam Kolodny, . Isask. ’. har. (Zigi) Walter and Shmuel Wimer. Technion. . –. Israel Institute of Technology. Group. Research. QNoC. Global traffic information is essential to make the right decision!. VANETs. SAMEERA SIDDIQUI. PhD STUDENT. UNIVERSITY OF OTTAWA. 0. Introduction . Problems in Routing Procedures. Classification Of Routing Protocols. Taxonomy of Previous Literature. Objective of the Project. 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. 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. Reading Assignment. Sections . 4.1-4.5. Alternative: relevant papers. . References provided. Overview. Separate the routing decisions from implementation. Choice of path vs. . Performance. E.g., buffering, route computation implementation. Ahmed Saeed. †. , Mohamed Ibrahim. †. , Khaled A. . Harras. ‡. , . Moustafa. Youssef. †. † . Egypt-Japan University for Science and Technology (E-JUST), Egypt. ‡. Carnegie Mellon Qatar, Qatar.