Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Programming Homework 4: Distance Vector Routing Extension | CMSC 417, Assignments of Computer Systems Networking and Telecommunications

University of MarylandComputer Systems Networking and Telecommunications
Prof. Samrat Bhattacharjee

Material Type: Assignment; Professor: Bhattacharjee; Class: Computer Networks; Subject: Computer Science; University: University of Maryland; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 07/29/2009

koofers-user-twx
koofers-user-twx 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMSC 417 Computer Networks Spring 2009
Programming Assignment 4 — Distance Vector Routing Extension
Assigned: Mar. 14 Due: Mar. 27, 23:59:59.
1 Extensions to Distance Vector Routing
Extend your previous assignment to handle three new mechanisms:
•Triggered update: Implement triggered update to speed up the convergence of routing tables.
•Countinguptoinfinity(fortwonodes):Implementpoisonreverse tohandle thecountingup
toinfinityproblem.
•NodeFailure: Addaheartbeatmessagetoyourprotocol. Theheartbeatmessageshould be
sentperiodically.Devise amechanism usingtheheartbeatmessages todetect when apeer
is nolonger reachable andtear-downall linkstothatpeer.YourDVimplementationshould
eventually converge and find routes to all reachable destinations.
Wewill test yourprogrambymanually stoppingspecificnodes. Theremainingnodes should
detect the set of nodes that are no longer reachable and re-configure routing tables as necessary.
Notethatyouwill havetodevise theformatoftheheartbeatmessageandneighborreachability
protocol yourself. Please justify the inclusion and length of each field in the heartbeat message;
youwill need towriteupabrief descriptionofthemechanism youuse todetect nodefailure.
2 Submission
•Please submit your code as described in the forum.
•What to turn in: All of your source code along with a Makefile and a README file. Your
Makefile must produce an executable named rt. The README file should include a short
description about your protocol (e.g., what is the packet format, how does the protocol
execute, why does it work, etc).
1

Partial preview of the text

Download Programming Homework 4: Distance Vector Routing Extension | CMSC 417 and more Assignments Computer Systems Networking and Telecommunications in PDF only on Docsity!

CMSC 417 Computer Networks Spring 2009

Programming Assignment 4 — Distance Vector Routing Extension

Assigned: Mar. 14 Due: Mar. 27, 23:59:59.

1 Extensions to Distance Vector Routing

Extend your previous assignment to handle three new mechanisms:

  • Triggered update: Implement triggered update to speed up the convergence of routing tables.
  • Counting up to infinity (for two nodes): Implement poison reverse to handle the counting up to infinity problem.
  • Node Failure: Add a heartbeat message to your protocol. The heartbeat message should be sent periodically. Devise a mechanism using the heartbeat messages to detect when a peer is no longer reachable and tear-down all links to that peer. Your DV implementation should eventually converge and find routes to all reachable destinations.

We will test your program by manually stopping specific nodes. The remaining nodes should detect the set of nodes that are no longer reachable and re-configure routing tables as necessary. Note that you will have to devise the format of the heartbeat message and neighbor reachability protocol yourself. Please justify the inclusion and length of each field in the heartbeat message; you will need to write up a brief description of the mechanism you use to detect node failure.

2 Submission

  • Please submit your code as described in the forum.
  • What to turn in: All of your source code along with a Makefile and a README file. Your Makefile must produce an executable named rt. The README file should include a short description about your protocol (e.g., what is the packet format, how does the protocol execute, why does it work, etc).