Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CS 640 Introduction to Computer Networks Fall 2007 http://www.cs.wisc.edu/akella/CS640/F07
 

Summary: CS 640 Introduction to Computer Networks Fall 2007
http://www.cs.wisc.edu/akella/CS640/F07
Programming Assignment 2: Routing Protocol
Assigned: October 16, 2007 Due: November 1, 2007, 11:59pm
1 Problem Statement
In this assignment you will implement a simplified version of Distance Vector Protocol in P&D 4.2. The protocol will
be run on top of servers (behaving as routers) using UDP. Each server runs on a machine at a pre-defined port number.
The servers should be able to output their forwarding tables along with the cost and should be robust to link changes.
(Note: we would like you to implement the basic algorithm, count to infinity, not poison reverse)
2 Protocol Specification
The various components of the protocol are explained step by step. Please strictly adhere to the specifications.
2.1 Topology Establishment
Each server is supplied with a topology file at startup that it uses to build its initial routing table. The topology file is
local and contains the link cost to the neighbours. For all other servers in the network, the initial cost would be infinity.
The topology file looks as follows:




num-servers: total number of servers

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences