1 / 5

Implementing a Distance-Vector Routing Protocol with RIPRouter Class

This project involves the development of a RIPRouter class to implement the Routing Information Protocol (RIP). The core functionalities include using hop-count as a distance metric, handling implicit withdrawals, and incorporating the Split Horizon technique. Key implementation points cover route establishment, processing distance-vector updates, and determining when to send updates without incurring penalties. You'll have the freedom to design the data structures for storing routing information. Additional components include a simulator for network topology linking and a visualizer (NetVis) for monitoring packet movement.

pello
Download Presentation

Implementing a Distance-Vector Routing Protocol with RIPRouter Class

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Project 1 • Distance-vector Routing implementation • Only need to implement a class called RIPRouter • Spec based on RIP (Routing Information Protocol) • Hop-count as distance metric • Implicit Withdrawal • Split Horizon (for Poison Reverse) • 100 – max hop-count

  2. Key Implementation Pointers • Route establishment • Centered around distance-vector updates • How to process an update. • When to send new updates? (Penalty if you send too many) • What should the update look like? • Packet Forwarding • Select the next hop based on forwarding table. • Freedom to construct appropriate data structure to store routing information.

  3. Provided Code • Simulator that can link up hosts and your RIPRouters in different topologies and forward packets. • Refer to the simulator guide • A visualizer (NetVis) where you can see the topology and packets.

  4. Extra Credits (maximum 2 out of 3) • #Routing Updates • Link Weights and SmartDV • Can you be smarter about processing DV updates? • Link State implementation and analysis

  5. Logistics • GSIs: Kaifei, Radhika and Gautam • Additional OH for help with the project – will be announced on Piazza • Due October 10, 2013 at midnight. • Submit through instructional machines ‘project1’.

More Related