[Back to Lecture Notes page]

The Data Link Layer - Readings

Computer Networks (3rd Ed), A. Tanenbaum, Chapter 3

• Required:
  • ALL sections except 3.5 - this chapter contains some C program code to illustrate the algorithms used in the protocols. Although I do not expect you to understand exactly what the code does (especially if you haven't had experience with C-like languages), I do expect you to understand the algorithms and how they work. I will be summarising the algorithms in the lecture notes. You will also need to refer to the text descriptions in the book.
  • You are also not required to read the parts on p187 - p190 on the algebra behind the polynomial code.
  • In section 3.6.3, for the purpose of the exam, don't worry about the lines mentioning SONET since I haven't had time to cover it in the physical layer. Also, don't worry about the details on page 237-238 under the heading "Cell Reception".
• Optional (not required for exam)
  • Sec 3.5 - this section described a way of using Finite State Machines (FSM) to design and to prove the protocols do what they are suppose to do. It may be a bit tedious for those of you who have not encountered FSM before, but have a read, and see how you go.
  • The parts on p187 - p190 on the algebra behind the polynomial code.

[Back to Lecture Notes page]