It is time to work on assignment 4, even if you are not done with the first 3 assignments and their quizzes. Your objective for this week is to become proficient in working with the Ford-Fulkerson Max Flow Min Cut algorithm. You will find links on the assignments page for java software that implements the algorithm. Don't just run it -- understand it. Do Quiz 4 and then go back and redo the other quizzes. Help one another. Read the notes again. When you are done, you should have a gut understanding of Dijkstra's algorithm and Ford-Fulkerson. We are coming up on the midterm soon, and you will need to be able to do this to get through it.
Contact me if you get stuck, but one way or another this is the time to get this right.
Please note that starting immediately, Monday office hours in B205 are being replaced by Friday office hours for the rest of the semester. Please also note that I have Skype office hours at 8 pm on Tuesdays.
Monday, February 20, 2012
Saturday, February 11, 2012
Correction to Quiz 2
There were some numbering errors in problems that referred to other problems in Quiz 2. The Quiz has been corrected and reposted. You all have until Friday, 17 February to redo Quiz 2 in parallel with Quiz 3, which is due at the same time. My apologies for the error. My thanks to Mr. Malejana for spotting the problem. -- HJB
Sunday, February 5, 2012
Changes in the second Assignment
The second assignment has been posted, but it has changed.
Most people had serious difficulty with the first quiz. One person did not submit it at all. Everybody must understand that doing all the quiz questions is an essential part of completing the course, and the first few quizzes in particular relate to material you need to be able to do anything at all in this course. Therefore, I have added a great deal of additional instructional material to the second assignment. Be sure to refresh your browser when looking at the assignments page.
After you complete the readings and videos, you all must retake Quiz 1 and also take Quiz 2 by Friday 10 February.
You should look at your quiz results and the second assignment promptly and then contact me via Skype IM or email if anything is not clear.
I will be available for office hours this week in B205 from 12:30 to 4. You can find me their either via Skype or in person. I will be out of town Tuesday through Thursday, so it would not be a god idea to delay working on this.
The third assignment has also been posted, but it may change depending on results from the quizzes.
Most people had serious difficulty with the first quiz. One person did not submit it at all. Everybody must understand that doing all the quiz questions is an essential part of completing the course, and the first few quizzes in particular relate to material you need to be able to do anything at all in this course. Therefore, I have added a great deal of additional instructional material to the second assignment. Be sure to refresh your browser when looking at the assignments page.
After you complete the readings and videos, you all must retake Quiz 1 and also take Quiz 2 by Friday 10 February.
You should look at your quiz results and the second assignment promptly and then contact me via Skype IM or email if anything is not clear.
I will be available for office hours this week in B205 from 12:30 to 4. You can find me their either via Skype or in person. I will be out of town Tuesday through Thursday, so it would not be a god idea to delay working on this.
The third assignment has also been posted, but it may change depending on results from the quizzes.
Thursday, February 2, 2012
Updated PDF of Network Design lecture notes PDF
Some students have reported garbled characters in the current version of the Network Design lecture notes PDF. I have posted a slightly updated draft at:
http://www.bernstein-plus-sons.com/.dowling/CSC2281S12/Network_Design_and_Implementation_Spring_1984_Jan12.pdf
Comments, corrections and suggestions greatly appreciated. I will not take down the original notes yet so they are still on the links for the notes from all the web pages.
http://www.bernstein-plus-sons.com/.dowling/CSC2281S12/Network_Design_and_Implementation_Spring_1984_Jan12.pdf
Comments, corrections and suggestions greatly appreciated. I will not take down the original notes yet so they are still on the links for the notes from all the web pages.
Information on the project for CSC2281
It is time to tell you more about the project for the course.
As you will discover as you read the material for the course further, there is a complex but reasonable process for designing a network: you identify the various nodes that will want to send traffic to other
nodes and estimate the amount of traffic each node will want to send (the "offered load"). You try to work out a reasonable topology of links connecting those nodes. You try to assign capacities
to those links that will allow that traffic to be handled. You try to optimize those capacities on the basis of a minimal cost for a given delay. Then you perturb the topoogy and try again. The main tool for the topology design is the Ford-Fulkerson max-flow-min-cut algorithm. The main tool for capacity optimization is the Kleinrock approximation. Those two tools are the hard part of the course.
Since the methodology is well-established, you project is primarily one of identifying some reasonable realistic network design problem to which to apply it. The last class that did this decided to all get together and redesign the LIRR. They did pretty well.
As you will discover as you read the material for the course further, there is a complex but reasonable process for designing a network: you identify the various nodes that will want to send traffic to other
nodes and estimate the amount of traffic each node will want to send (the "offered load"). You try to work out a reasonable topology of links connecting those nodes. You try to assign capacities
to those links that will allow that traffic to be handled. You try to optimize those capacities on the basis of a minimal cost for a given delay. Then you perturb the topoogy and try again. The main tool for the topology design is the Ford-Fulkerson max-flow-min-cut algorithm. The main tool for capacity optimization is the Kleinrock approximation. Those two tools are the hard part of the course.
Since the methodology is well-established, you project is primarily one of identifying some reasonable realistic network design problem to which to apply it. The last class that did this decided to all get together and redesign the LIRR. They did pretty well.
Subscribe to:
Posts (Atom)