All lecture notes Sections in the books. ------------------------------------------------------------------------ Chapter 1: Introduction (Chapter 1 Tanenbaum, Chapter 1 Kurose) Concepts: packet switching/circuit switching point-to-point/broadcast networks multiplexing LAM/WAN Computer Networks Components in Computer Networks delay/throughput Layer architecture (Why?) protocol/service interface connection-oriented service/connectionless service reliable and unreliable service elements in a protocol network architecture Layers in the OSI/ISO reference model Layers in the TCP/IP reference model Basic facts about the layers Calculation: delay and throughput ------------------------------------------------------------------------ Chapter 2: Application layer (Chapter 2 Kurose) Concepts: TCP API TCP/UDP service model sequence of system calls in TCP clients/servers Email: SMTP, Pop, Message format HTTP: persistent/non-persistent HTTP examples of different types of messages cookies DNS: functionality of DNS How DNS system is organized root name servers/top-level domain servers/authoritative DNS servers/local name servers How to access DNS? recursive query/iterated query Coding: Project No. 1 ------------------------------------------------------------------------ Chapter 3: Physical Layer (Chapter 2, Tanenbaum, 2.1.2) Concepts: Bandwidth capacity bit rate/baud rate modulation: amplitude modulation, frequency modulation, phase modulation PCM code, differential pulse code, delta modulation, predictive encoding simplex/duplex/half duplex communication multiplexing: TDM, FDM, code division multiplexing components in a physical layer protocol Calculation: Nyquist's theorem and Shannon's theorem ------------------------------------------------------------------------- Chapter 4: Data link layer (Chapter 3, Tanenbaum, 3.1, 3.2, 3.3, 3.4, 3.6) Concepts: design issues in data link layer framing character count byte oriented framing with character stuffing bit oriented framing with bit stuffing physical level code violation flow control PAR, Go-back-N sliding/selective repeat sliding window Hamming distance relation between hamming distance with error correction and detection capability CRC code calculation: Error detection and correction capability for a given code CRC checksum calculation throughput/delay calculation with PAR and sliding window ------------------------------------------------------------------------ Chapter 5: Medium access control (Chapter 4, Tanenbaum, 4.1, 4.2, 4.3) Concepts: ALOHA, slotted ALOHA, CSAM, CSMA/CD bitmap/binary countdown adaptive tree walk Ethernet CSMA/CD + binary exponential backoff relation between minimum frame size and network size Issues with Fast Ethernet and Gigabit Ethernet Calculation: relation between minimum frame size and network size ------------------------------------------------------------------------ Problem types: 1) True/False/Multiple choices 2) Definition 3) Explain 4) Calculation 5) Coding (project No. 1) ------------------------------------------------------------------------