Lectures

This "Lectures" page is restricted to the slides as shown in lectures. Refer the "Resources" page for most supplementary material, including --

• A comprehensive treatment of the IEEE 802.3, 802.4 and 802.5 protocols.
• The Ethernet simulator applet

---

Slides from lectures

Remember that many printing systems can convert from 1-page per sheet (as on the PDF documents) to 4 pages per sheet.

• On the Macintosh, when you have selected "Print", go to the sub-menu which is usually labelled "General" and select "Layout". Then choose your layout option.
• On the PC, you can select the "paper" tab and then under "layout" find the 4-up option. This may be useful when printing the PDF files, with Acrobat.
• With private printers, you are on your own!!

Notes will be made available here only as they are covered in lectures.

Description	PDF Posted to Web	Sections in Shay (2nd Edition) (very approximate)
Introduction, Protocol layers, etc	YES	Chapter 1
Communication Models & Layers	YES	Section 1.4, 2.3
Data Framing and Protocols	YES	Section 3.1, 4.2, 5.2, 5.3, 5.5
Errors and Compression	YES	Section 3.5, 4.2, 4.3, 4.4
802.2 LLC & LAN Interconnect	YES	Section 6.5 (not fixed routing)
Ethernet, VLANS, Token Ring & Token Bus	YES	Section 6.1, 6.2. Brief 6.3, 6.4.
Wide Area Routing and Virtual Circuits	YES	Section 7.1, 7.2 (but defer RIP & BGP until later)
IP, ICMP & IPv6	YES	Section 7.4.
TCP and UDP	YES	Section 7.5.
Physical Communication	YES	Chapter 2.
Physical Communication (part 2)	YES
Asynchronous Transfer Mode (ATM)	YES	Pages 624 - 645 (but only to detail of notes)
Management; MIBs and SNMP	YES	Pages 573 - 576
Spread Spectrum	YES	- NONE -
PPP over SONET; GFP etc	YES	not examinable

---

Textbook Relevance

Most of this material was presented on slides which were distributed as handouts. The general rule is that I expect you to know what is in the slides and probably related material from the text. Topics which I left out completely from the slides are almost certainly omitted from the exam, unless of course they are in assignments.

• Chapter 1. Introduction. Essential background material
• Chapter 2. Fundamentals. 2.1 is essential background; 2.2 general knowledge; 2.3 Know ASCII, aware of others; 2.4, 2.5 Essential background 2.6 as much as in lectures
• Chapter 3. Data Communication. 3.1 important; 3.2 not important; 3.3 important; 3.4 important, but done later; 3.5 NOT image compression
• Chapter 4. Data Security. 4.1 -- 4.4 Important; ignore 4.5--4.7
• Chapter 5. Protocols. Ignore section 5.4 "Protocol Correctness"
• Chapter 6. Local Area Networks
• Most except Section 6.6.
• Know the frame formats, the fields which data frames contain and approximate sizes. Do not try to learn the details of control frames.
• Ignore part on Ethernet Efficiency.
• Overview only of Token Ring and Token Bus (IEEE 802.5 and 802.4). Ignore details of control messages and priorities.
• Chapter 7. Wide Area Networks.
• Routing Tables, Djikstra's Algorithm, Bellman-Ford Algorithm, Congestion and Deadlock.
• Ignore Section 7.3, except for Virtual Circuit Routing.
• Include all of Section 7.4, Internet Protocols, but overview only of IPv6.
• Include Section 7.5, TCP and UDP.
• Ignore OSI Transport.
• Ignore Socket Programming.
• Chapter 8.
• MIBs and SNMP
• Section 8.5 ATM, and then only to depth in slides.

---

Textbook errors and comments

These are comments on the text from teaching 314 in 2000. Some may be a bit mysterious, but some do indicate definite errors.
This applies to the 2nd Edition, NOT the 3rd.

• 1. Needs SNAP Headers
• 2. Needs CDMA/Spread Spectrum
• 3. Confusion over LZW, LZ78 etc
• 4. Correction to LZW code - needs more discussion of special case.
• 5. 2-ph 110V power - USA only p158
• 6. European E-1 standard
• 7. p111 "F" should be "f"
• 8. p148 Fig 3.3 should bits be lsb first?
• 9. Synchronous transmission is clocked from modem.
• 10. Right to left bit ordering is confusing, especially cf computers, even though it does seem to be data comm. convention
• 11. Deleted !
• 12. Fig 6.5 p370 missing part; also Fig 6.6 p372 Fig 6.7 p374.
• 13. Hamming code is confusing. I suggest first the (7,4) code, then extend it to (15,11), and finally puncture that to (11,7)
• 14. Token bus operation too brief.
• 15. Should mention "latency" in token ring.
• 16. Token bus mentions decreasing logical address order only in passing.
• 17. Should token ring say more about Token Holding Time?
• 18. Example of IP reassembly, preferably with multiple steps of fragmentation.
• 19. TCP checksum is more complex - it includes some of IP header as well.
• 20. Chap 7, Q8 Bellman-Ford routing needs another iteration. A-F has path A-D-C-E-F, cost 11.
• 21. Chap 7, Q8 Bellman-Ford example is ambiguous with 2 equal cost paths from A to C.
• 22. Chap 7, p 520. Under "window", should be "...change the size of the window...".
• 23. Something on SDH, SONET.
• 24. Fig 8.49. Caption should be

(c) AAL5
• 25. Chap 7, Q4 Dijkstra's algorithm adds E on step 3.

---

Questions and Answers