Instructor:
Prof. Nikos Sidiropoulos
Room 6-161 EE/Csci
612-625-3537
nikos@ece.umn.edu
Teaching Assistant:
Paul Anghel
Room 5-178 EE/Csci
Office Hours:
Instructor: Wed. 2:00pm-3:15pm
TA (Anghel): Tue. 4:00pm-5:00pm
Course Objective:
The primary objective of this course is to expose students to the fundamental principles behind modern telecommunication networks, and the mathematical tools required for their performance analysis. The emphasis is on preparing students for research in related subjects. With this in mind, we will mostly spend time on core issues like mathematical analysis and proving correctness and efficiency of algorithms, rather than discussing the specifics of existing networks.
Required Text (Bookstore, Williamson Hall):
Data Networks, D. Bertsekas and R. Gallager, Prentice-Hall, 1992 (2nd Ed.) Reference Article (available to all UMN students via www.ieeexplore.ieee.org):
A. Ephremides and B. Hajek, ``Information Theory and Communication Networks: An Unconsummated Union'', IEEE Trans. Information Theory, 44(6):3416-3434, Oct. 1998. (good perspective on random access, among other things)Prerequisites:
-
EE 5531 (Probability & Stochastic Proc. @ first-year grad level);
EE 4501 (Communications Systems @ senior undergraduate level).
Grading & Student conduct:
- Scholastic misconduct is broadly defined as "any act that violates the right of another student in academic work or that involves misrepresentation of your own work. Scholastic dishonesty includes, (but is not necessarily limited to): cheating on assignments or examinations; plagiarizing, which means misrepresenting as your own work any part of work done by another; submitting the same paper, or substantially similar papers, to meet the requirements of more than one course without the approval and consent of all instructors concerned; depriving another student of necessary course materials; or interfering with another student's work." See also:
- Student conduct and academic honesty
- Incomplete policy: No incomplete grade will be given, except under very unusual circumstances, like documented medical emergency.
- Likewise, no makeup exams will be given, unless there is a documented emergency and suitable arrangements are made with the instructor prior to the date of the scheduled exam.
- Students are responsible for all information disseminated in class and all course requirements, including deadlines and examinations.
- A student may not submit extra work in an attempt to raise his or her grade.
- Homework: About 8 Homework Assignments, 15%
- Midterm Exam (tentatively ~ Oct. 23): 40% Closed book; one sheet of notes of your choice allowed
- Final Exam: Tue. December 18, 1:30-3:30 pm, room TBA: 45% Closed book; two sheets of notes allowed.
Students with disabilities:
Students with disabilities that affect their ability to participate fully in class or to meet all course requirements are encouraged to bring this to the attention of the instructor so that appropriate accommodations can be arranged. Further information is available from Disabilities Services (30 Nicholson Hall).
Homework:
About eight homework sets will be assigned. Homework is graded and carries 15% of the total grade. Your solutions should represent your own work. Each homework assignment is due at the beginning of class on the due date. Late homework will not be accepted. Some programming skills required when we get to routing: you will be asked to program several shortest path algorithms in Matlab or C.
Syllabus:
-
Introduction:
-
Overview; Network layers; Examples of current networks: datagram (Internet), virtual circuit (ATM), multiple access (Ethernet); Physical layer: sampling theorem, Shannon capacity, CRC error detection [Bertsekas and Gallager, Chapter 1, 2.1, 2.2]
-
Automatic Repeat reQuest (ARQ):
Stop and Wait, Go back n, Selective Repeat;
Correctness and efficiency of ARQ protocols;
Examples [Bertsekas and Gallager, 2.4]
-
Review of Markov chain theory; Little's theorem, M/M/1, M/G/1,
the Kleinrock independence approximation, networks of queues (Jackson's theorem) [Bertsekas and Gallager, Appendix A of Chapter 3; 3.1, 3.2, 3.3, 3.5, 3.6, 3.8]
-
ALOHA, CSMA/CD, reservations, packet radio [Bertsekas and Gallager, 4.1, 4.2, 4.4, 4.5, 4.6]
-
Introduction, graphs, minimum weight spanning trees, shortest path algorithms: Bellman-Ford algorithm, Dijkstra's algorithm
[Bertsekas and Gallager, 5.1, 5.2]
-
Window flow control, rate-control schemes, combined optimal routing
and flow control, max-min flow control [Bertsekas and Gallager, 6.1, 6.2, 6.3, 6.5]
Homework solutions and related material:
Will be posted here
Streaming Video:
Available to registered students via the UNITE Web site (not available F2001)
This document was last updated Aug. 27, 2001