Diary for herman

Older diary entries for herman (starting at number 21):

11 Dec 2000  »

In Japan

I'm in Japan today. I hope everyone has no trouble making their project web pages!

24 Nov 2000  »

Exam 3

Examination 3 is graded. This time, scores are lower, reflecting the fact that students are concentrating on projects --- as they should --- instead of studying for an examination, which contributes less to the final grade than working on projects. Projects are more important!

8 Nov 2000  »


My next lecture covers Section 4.4 of the textbook, which introduces some protocols for multicast routing. This link to a document at 3com can be a helpful supplement to the textbook.

7 Nov 2000  »

Pictures of the Internet

Since I'm covering BGP routing and the Internet backbone, some pictures are in order.

3 Nov 2000  »


I've graded the second exam and fourth quiz. See the grades page to see the scores. If you're curious about the solutions to the second exam, look here.

19 Oct 2000  »

Exam 2

It's not graded. I'm not sure when I'll be able to grade it, given other time demands. I did post an update to the reading assignments for the next week.

16 Oct 2000  »

cleaning up sliding windows

I skipped over several important topics in my lectures on link protocols. These are explained in the textbook, but it will be helpful to mention them explicitly.

  1. variable frame size. In the examples I've presented for calculation of window size, effective bandwidth, and so on, there is an assumption that frames are all the same size (only the ACK is smaller). In fact, many protocols allow for varying frame sizes.
  2. full-duplex, half-duplex, and assymetric bandwidth situations. There is some relation between how window protocols work, the best design for parameters of these protocols, and how bandwidth is allocated in a channel between two endpoints.
  3. NACK (Negative ACK, sometimes also written as NAK). This can be a complement to ACKs, an alternative technique to using ACK packets, or convey extra information from receiver to sender.
  4. two-way sending. In practice, on many channels, both endpoints of a channel have data to send. In these circumstances, the sliding window is used simultaneously by both sides, each endpoint acting both as a sender and a receiver.
  5. piggybacking. This term mainly arises in the context of two-way sending. Why send a separate ACK packet when you also have a data frame to send? Why not combine both into one packet? That's the essence of piggybacking.
None of these points are essential to understanding how the basic window protocols work, but they are essential to getting ``the big picture'' of how things work out in practice.

15 Oct 2000  »

course notes

I'm having some difficulty in preparing and posting course notes. Finally I've posted the notes for Thursday's class (several days late) because I think there is some error in one of the calculations, but I couldn't remember exactly where. The next notes on Ethernet will require some figure drawing that may be too time-consuming.

10 Oct 2000  »

Second Exam

It's not too early to start thinking about the second exam. So I've posted an article and made pointers to previous exams. Now I can concentrate on preparing the remaining three lectures before the exams. This time I hope to throw in a little about wireless techniques not covered in the textbook.

Also, I need to think about what lectures (if any) I should prepare while I will be away during the week of 22-27 October.

9 Oct 2000  »

Busy Week

As the book states, the sliding window protocol is perhaps the best-known algorithm in computer networking. It illustrates many themes: efficiency, error recovery, flow control, and the implementation of a reliable service from unreliable hardware. This week I'll very quickly cover this material, leading up to the next exam. First, I'll just quickly describe the algorithms in a high-level fashion. (Actually, I won't have time to do it in detail --- that's what the textbook does.) The second lecture will concentrate on analysis and calculation.

12 older entries...

[ Home | Help | Articles | Account | People | Projects ]