E6998-02 Homework 1

Out: 05 September 2002


Extension: homework now due 17 September 2002 at 3am EDT. You have five extra days. No more extensions will be given.

Due: 12 September 2002 at 3am EDT. You have one week. Start tonight, ask questions if you have problems.


The purpose of this homework is to familiarize you with SSFNet and with the Spanning Tree algorithm.

Bring up SSFNet; the Raceway IDE is recommended, but you are free to use the C++ version if you feel more comfortable with that language. Implement the following network as an SSFNet DML file. The ellipses are bridges, the thick lines are 10Mbps Ethernets. The numbers in the ellipses are the bridge ID, the numbers outside indicate the port ID of each port.

Implement (or find on the net and incorporate) the spanning tree algorithm; run it on each bridge, and show the resulting spanning tree.
Change the id of bridge 11 to 1; what do you observe?
Change it to 22; what do you observe?


I'm exploring options for submitting the homework; most likely, you'll have to submit it by email to ji+hw1@cs.columbia.edu. Look for instructions in the announcements page.


$Id: index.html,v 1.2 2002/09/11 22:18:35 ji Exp ji $