Conference paper. This process is experimental and the keywords may be updated as the learning algorithm improves. This is a preview of subscription content, log in to check access. Bertsekas, D. Google Scholar. Banerjee, D. Areas Commun. CrossRef Google Scholar. Ramaswami, R, and Sivarajan, K. Subramaniam, S. Tucker, A. Wilfong, G. Asuman E. Ozdaglar 1 Dimitri P. Bertsekas 1. Cambridge USA.
Computer Networks, 5th edition, A. Tanenbaum and Davis Wetherall, Prentice Hall, Kurose and K. Last day to drop a course so it does not appear on the record of enrollment: February 7, Midterm Exam: March 8, tentative. Homework will be assigned on a weekly basis on the topics covered in class. There will be approximately 8 homework assignments of equal weight. Assignments will be posted every Thursday and will be due at the start of the class the following Thursday. There will also be one midterm exam, three group projects and a final exam.
Homework is due at the time that it is specified in the homework handout all homework handouts will be posted on the class website. Late homework will not be accepted, and will receive 0 points. Make-up exams: A make-up exam may only be given under extraordinary circumstances. It is up to the discretion of the Instructor to accept the justification provided by the student.
If you anticipate barriers related to the format or requirements of this course, please meet with me so that we can discuss ways to ensure your full participation in the course. If you determine that disability-related accommodations are necessary, please register with Disability Resources ; DRC center and notify me of your eligibility for reasonable accommodations. We can then plan how best to coordinate your accommodations. Make sure that such a request is set forth at least 2 weeks before the first exam to allow sufficient time for any preparations that may be needed.
Copying previously posted solutions or solution manuals is strictly forbidden; anyone violating this policy will receive zero credit for homework that was plagiarized. All work must be original.
You are expected to produce your work in a timely manner. You may discuss and work on questions with other students in the class. However, you should write your solutions on your own. In other words, if I were to later ask you to re-derive one of your homework solutions or to solve a similar problem when you were without your friends, you should be able to do so or have a clear understanding of how to approach the problem.
This can only be learned by doing, so you should do your homework. However, if you don't ace your tests and homeworks, but you can demonstrate to me that you have learned the material in another fashion mainly via office-hour discussion in which you work through additional problems , you can improve by up to one letter grade e.
To reiterate, it is possible to improve your grade by demonstrating an understanding of the material. I am more interested in your gaining an understanding of and developing an intuition for why certain rules, laws, and techniques hold and are used. I am less interested in your ability to memorize these rules, laws and techniques and blindly apply them without intuition as to why they work. Thus, I will try to design the midterm and final questions to test your understanding of the concepts, not your memorization skills.
I realize that some memorization will undoubtebly be required, but hopefully the memorized concepts will be those that can be rederived via your intuition. Large-scale phenomena: self-similar traffic, heavy-tailed distributions. We focus in particular on the problem of routing and wavelength assignment RWA , which is critically important for increasing the efficiency of wavelength-routed all-optical networks.
Our methodology can be applied as a special case to the problem of routing in a circuit-switched network. We discuss an integer-linear programming formulation, which can be addressed with highly efficient linear not integer programming methods, to obtain optimal or nearly optimal solutions.
This is a preview of subscription content, log in to check access. Bertsekas, D. Google Scholar. Banerjee, D.