Digital Communication II Supervisions
This course requires about 8 supervisions.
To be handed in at least 24 hours in advance. Use the post-box next to Student Administration in the William Gates Building or, preferably, email your work to me in any sensible format.
Supervision 1 - Network Types
- Consider (a) the telephone network, (b) the internet and (c) ATM networks.
Describe and explain:
- What each was designed to do, including any specific challenges or requirements; [about 2 marks each]
- The distinguishing features of each; [about 4 marks each]
- Why each is suited (or not) to its intended purpose; [about 1 mark each]
- 2003 Paper 9 Question 3 (IP vs ATM)
- 1996 Paper 9 Question 2 (Audio over ATM)
Supervision 2 - Network Layering and The Internet
- Describe the difference between naming and addressing in the Internet. [about 3 marks]
- 1995 Paper 9 Question 3 (OSI Layers)
- 2005 Paper 7 Question 2 (Parts (a) and (c) only, Checksums and Traceroute)
Supervision 3 - Routing
- Describe in detail, with brief examples, the operation of
- Distance Vector routing
- Link-state routing
- 2000 Paper 8 Question 3 (IP Routing)
Supervision 4 - Error Control and Flow Control
- Explain the difference between error control and flow control, including details and examples of how each might be implemented. [about 5 marks each]
- 2006 Paper 7 Question 2 (Flow Control)
- 1996 Paper 8 Question 2 (Packet Retransmission)
Supervision 5 - Multiple Access
- What is a "stable algorithm" in the context of multiple access? [1 mark]
- Define and explain FDMA, TDMA and CDMA. Give pros and cons for each. [about 3 marks each]
- What are centralized and decentralized schemes in the context of multiple access? What are the benefits of each? [about 5 marks]
- Describe the CSMA algorithm. Include an explanation of the difference between CSMA/CD and CSMA/CA and where you would use each. [about 8 marks]
- 2007 Paper 9 Question 4 (CSMA)
Supervision 6 - Switching
- Briefly describe the operation of and differences between first, second and third generation switches. [about 6 marks]
- 2002 Paper 8 Question 3 (Router Design)
- 2004 Paper 8 Question 3 (Router Design)
- 2006 Paper 9 Question 3, Part (a) only (Switch Design)
- 1993 Paper 9 Question 2, Part (c) only (ATM Switch Design)
Supervision 7 - Scheduling
- In the context of scheduling, what does 'work conserving' mean? What is the conservation law?
- FCFS scheduling
- The max-min fair share criteria
- Simple Priority Queuing
- Generalised Processor Sharing
- The difference between absolute and relative fairness.
- Weighted Round Robin scheduling
- Deficit Round Robin scheduling
- Weighted Fair Queuing
- Class-Based Queuing
- What is Random Early Detection?
- 2003 Paper 7 Question 2 (Scheduling)