Home Admissions Students Careers Research Business People Help
Text size A A A A A

| STUDENTS > Networked Systems |

Networked Systems

Note: Whilst every effort is made to keep the syllabus and assessment records correct for this course, the precise details must be checked with the lecturer(s).


Code: 3035 (Also taught as: GZ01)
Year:3
Prerequisites:Succesful completion of years 1 and 2 of the Computer Science programme
Term: 1
Taught By: Brad Karp (50%)
Kyle Jamieson (50%)
Aims:To provide a theoretical background and practical understanding of the techniques and technologies that are used to build data communications networks and the applications which use them.
Learning Outcomes:The ability to describe and calculate the constraints on communication systems derived from basic physics. To be able to descibe and analyse the operation and main performance characteristics of modern network technologies and, especially, of the Internet. To be able to discuss the principles of operation of the Internet and the various protocols and support services used within it and to be able to discriminate between different options in the practical deployment of such systems. To appreciate the need for quality of service control in support of integrated services.

Content:

InformationInformation, encoding and entropy
Introduction to communication theorySpectral analysis. Application to modulation and FDM.
Introduction to Queuing TheoryDerivation and use of simple M/M/1 results.
Integration and APIsServices, protocols and programatic interfaces to communications services
ARQ Protocols - performance analysisClassification of protocols. Effect of window size. Flow control
Wireless technologiesSpread-spectrum techniques (DSSS, FHSS). Wireless MAC algorithms (CSMA, TDMA, CDMA). IEEE 802.11
Asynchronous Transfer ModeRationale, operation, QoS and adaptation.
Local interconnection IEEE MAC service. Bridges, switches. LAN emulation.
The Internet Architecture The IP protocol (V4 and v6). Routers and forwarding. Fragmentation and reassembly. IP v4 and v6 addressing.
Internet DeploymentGlobal Internet Architecture, Implementing IP over dial-up, ADSL, ATM. Label switching. Configuration. NAT and VPNs. Mobile IP. ICMP
Internet Transport protocols Architecture - end-to-end approach, use of ports. TCP, acknowledgement strategy, congestion control. UDP.
Routing Factors affecting routing. Dynamic routing protocols - distance vector and link-state approaches. Bellman-Ford and Dijkstra algorithms. Internet routing protocol examples; interior gateway protocols - RIP and OSPF, exterior gateway protocols BGP.
Application architectureClients and servers. User-level sessions. Application services and protocols. RPC, stubs and skeletons. Abstract and concrete syntaxes. Examples HTTP, ASN.1 and BER.
Application ExamplesEmail, WWW

Method of Instruction:

Lecture presentations, self-learning modules and tutorials

Assessment:

The course has the following assessment components:

  • Coursework Section (4 pieces, 40%)
  • Written Examination (2.5 hours, 60%)
To pass this course, students must:
  • Obtain an overall pass mark of 40% for all sections combined
The examination rubric is:
Answer THREE Questions.

Resources:

Required Text: James Kurose and Keith Ross, 'Computer Networks: A Top-Down Approach', fifth edition, paperback, published in UK by Pearson Education, ISBN 978-0-13-136548-7

Optional Text: Jerome Saltzer and M. Frans Kaashoek, 'Principles of Computer Systems Design: An Introduction', Part I (Chapters 1-6), paperback, published in UK by Elsevier, ISBN 978-0-12-374957-4.

Required Text: Jerome Saltzer and M. Frans Kaashoek, 'Principles of Computer Systems Design: An Introduction', Part II (Chapters 7-11), Version 5.0, PDF available free online.

Research Paper: Metcalfe, R., Boggs, D., 'Ethernet: Distributed Packet Switching for Local Computer Networks', Communications of the ACM 19(7), July 1976.

Research Paper: Degemark, M., Brodnick, A., Carlsson, S., and Pink, S., 'Small Forwarding Tables for Fast Routing Lookups', in SIGCOMM 1997.

Research Paper: Saltzer, J., Reed, D., and Clark, D.,' End-toEnd Arguments in System Design', in ACM TOCS, 2(4), November 1984.

Research Paper: Jacobson, V. and Karels, M., Congestion Avoidance and Control, revised version of original paper in SIGCOMM 1988.

Module web page

This page last modified: 26 May, 2010 by Nicola Alexander

Computer Science Department - University College London - Gower Street - London - WC1E 6BT - Telephone: +44 (0)20 7679 7214 - Copyright © 1999-2007 UCL


Search by Google
Link to UCL home page