Changes between Version 29 and Version 30 of GENIExperimenterWelcome

Timestamp:

07/08/12 17:05:05 (12 years ago)

Author:

justinc@cs.washington.edu

Comment:

--

GENIExperimenterWelcome

@@ -35 +35 @@
 || [https://seattle.cs.washington.edu/wiki/EducationalAssignments/LinkState Link State Routing (Dijkstra's Algorithm) ]  || [[Image(Seattle.png, nolink, 100%)]] || This assignment will illustrate an important network routing strategy called Link State routing. In this assignment, Seattle nodes will take an initial connectivity map of nodes. They will then implement and run Dijkstra's shortest path algorithm to build their routing tables. Finally, nodes will forward packets using their routing table. ||
 
-|| [https://seattle.cs.washington.edu/wiki/EducationalAssignments/LinkState Link State Routing (Dijkstra's Algorithm) ]  || [[Image(Seattle.png, nolink, 100%)]] || This assignment will illustrate an important network routing strategy called Link State routing. In this assignment, Seattle nodes will take an initial connectivity map of nodes. They will then implement and run Dijkstra's shortest path algorithm to build their routing tables. Finally, nodes will forward packets using their routing table. ||
-
 || [https://seattle.cs.washington.edu/wiki/EducationalAssignments/WebServer HTTP Server Assignment ]  || [[Image(Seattle.png, nolink, 100%)]] || In this part of the project you will create a minimal web server to serve text and html files. Your webserver will have a single dynamic component for listing files in a directory, it will need to read and send file contents to clients as well as accept incoming data. ||