Peter Dordal, Loyola University Chicago Dept of Computer Science.
The text will be An Introduction to Computer Networks, second edition, written by myself and available for free online. Note that the book is updated regularly.
My general course groundrules are here. Exams will count for between 60% to 70% of your grade, with homework and programs making up the rest.
The midterm will be the week of October 12 and the final will be during the normal finals week.Each week's assignment is generally due the Friday of the following week; eg September 6 for Week 1.
The schedule below is subject to change!
Homework can be submitted in .text, .odt, .doc/.docx, .xls/.xlsx, .rtf, etc. I discourage .pdf because I can't insert comments, but I will accept it. I will also accept image formats such as .jpeg (and for that matter .pdf images), but I recommend that you submit images only for those exercises for which you had to write out a diagram by hand. Some Mac formats I cannot accept simply because I cannot open them.
(As of August, the full assignment list is not ready yet.)
1 8/24 |
Chapter 1: Overview of Networks |
Homework 1, due Fri Sept 4 Chapter 1, exercises 1.0, 2.0, 5.0, 6.0, 7.0, 9.0, 10.0 |
2 8/31 |
2.1 10-Mbps classic Ethernet 2.1.1 Ethernet Packet Format 2.1.2 Multicast 2.1.3 Ethernet Address Structure 2.1.4 LAN layer 2.1.5 Slot Time and Collisions 2.1.6 Exponential Backoff 2.2 100 Mbps (Fast) Ethernet 2.3 Gigabit Ethernet 2.4 Ethernet Switches and the learning algorithm 3.1 Spanning Tree Algorithm. |
Homework 2, due Fri Sept 11 Chapter 2, exercises 1.0, 2.0, 5.0, 7.0 New exercise: use the diagram of exercise 3.0, but with the following transmissions instead:
|
3 9/7 |
Chapter 4, Wireless: 4.1: Radio, 4.2: Wi-Fi (up through 4.2.4) Chapter 5: 5.3 Chapter 6 (Links): 6.1 Chapter 7 (Packets): 7.1, 7.2, 7.3 |
Homework 3, due Fri Sept 18 Chapter 4: 1.0, 3.0 Chapter 5: 3.0(a) Chapter 6: 1.0, 5.0 Chapter 7: 1.0, 2.0, 6.0, 8.0 |
4 9/14 |
Chapter 8: Sliding windows |
Homework 4, due Fri Sept 25 Chapter 8: 3.0, 5.0, 6.0, 7.0, 8.0, 9.0, 12.0 |
5 9/21 |
Chapter 9: 9.1-9.7 (don't worry about numeric details of fragmentation) Chapter 10: 10.1-10.4 Chapter 13: section 1: DV update algorithm |
Homework 5, due Fri Oct 2 Chapter 9: 2.0, 3.0, 6.0, 8.0 Chapter 10: 1.0 Chapter 13: 2.0, 4.0 |
6 9/28 |
Chapter 16 (UDP): 16.1-16.3 Chapter 17 (TCP): 17.1-17.7 |
Homework 6, due Fri Oct 9 Chapter 13: 9.0, 11.0 Chapter 16: 4.0, 6.0, 7.0 Chapter 17: 2.0, 3.0, 4.0 |
7 10/5 |
No homework due Oct 16, because of the midterm |
|
8 10/12 |
Chapter 5: 5.4 (virtual circuits) Chapter 13: 13.5 Chapter 17: as needed |
Homework 7, due Fri Oct 23 Chapter 5: 5.0, 6.0, 8.0(a)(d) Chapter 13: 14.0, 15.0 Chapter 17: 9.0, 10.0, 11.0 |
9 10/19 |
Chapter 14: 14.1, 14.2, 14.4 Chapter 18: 18.1, 18.2, 18.3, 18.4 Chapter 19: 19.1, 19.2 |
Homework 8, due Fri Oct 30 Chapter 14: 2.0, 3.0, 4.0, 5.0 Chapter 18: 4.0 Chapter 19: 1.0, 2.0 |
10 10/26 |
Chapter 14: as needed Chapter 15: 15.1, 15.2, 15.3, 15.4 Chapter 19: 19.3, 19.4 |
Homework 9, due Fri Nov 6 Chapter 14: 6.0, 7.0, 8.0 Chapter 15: 1.0 Chapter 19: 3.0, 4.0, 5.0, 7.0 |
11 11/2 |
Chapter 14: 14.5 Chapter 15: as needed Chapter 19: as needed Chapter 20: as needed |
Homework 10, due Fri Nov 13 Chapter 14: 9.0 Chapter 15: 2.0 Chapter 19: 6.0, 11.0, 14.0 Chapter 20: 2.0, 3.0 |
12 11/9 |
Chapter 20 and 21 as needed |
Homework 11, due Fri Nov 20 Ch 20: 5.0, 7.0, 9.0, 10.0, 11.0 Ch 21: 3.0, 9.0 |
13 |
Chapter 21 as needed Chapter 22: TCP Vegas and TCP Westwood |
Homework 12, due Fri Dec 4 Ch 19: 12.0 Ch 21: 12.0, 16.0 Ch 22: 2.0, 13.0 |
TCP: server,
client,
threaded
server
UDP: server,
client
You are to do ONE of the following:
Due: Dec 4 8
Learning outcomes
Students will understand how the Internet is constructed, how LANs are built and managed, how data is routed to its destination, how connections are managed and implemented, how congestion is handled, and how security can be addressed.