Networking Midterm Study Guide

Homework Problems to know:

  • Chapter 1: 4, 6, 11, 14, 17, 19, 27
  • Chapter 2: 24, 25, 32, 54, 55

Chapter 1

  • Networking requirements
  • Network Scalability
  • Links, nodes, clouds
  • Point-to-point, multiple access
  • Circuit and packet switched networking
  • Start-and-forward
  • Switches, router, gateway, internetworking
  • Networking addressing concepts (physical and internet)
  • Routing
  • Broadcasting, multicasting
  • Resource Sharing Concepts
    • Multiplexing, demultiplexing
    • FDM, STDM
    • Packet buffering, queues, sequencing
    • Quality of service
  • Round robin
    • Congestion, overflow
  • Reliability
    • Errors, burst errors
    • Packet loss
    • Link failure
  • Manageability
  • Layering concepts
    • Service interfaces
    • Peer interfaces
    • Protocol graphs
    • Encapsulation
    • Multiplexing, demultiplexing
  • ISO, TCP/IP architectures.
  • Performance
    • Bandwidth and latency
    • Computations for these
    • RTT, transmit time, link capacity
    • Delay x bandwidth product
    • Meaning of “Mega”
    • Throughput calculations
    • Transfer time
    • Application networking needs

Chapter 2

  • Classes of Links
  • Encoding (NRZ, NRZI, Manchester, 4B/5B)
  • Byte and Bit oriented Protocols
  • Error Detection
    • Two-Dimensional Parity
    • Internet Checksum Algorithm
  • Reliable Transmission
    • Stop-and-Wait
    • Sliding Window
    • ACK, NAK, Sequence Numbers
    • Flow Control with sliding windows
    • Computing Throughput
  • Ethernet and Multiple Access Networks (802.3)
    • Physical Properties, Media Access Protocol
    • Frame Format, addresses
    • Collision detection
    • Frame length, link length, and link speed factors
  • Wireless
    • 802.11/Wi-Fi
    • Wireless date-rate selection
    • Collision avoidance
    • Hidden node problem
    • CSMA-CA
    • RTS-CTS
    • Distribution systems
    • AP selection and Association
    • Probe
    • Probe response
    • Association request
    • Frame format

Chapter 3: Inter-networking

  • Switching and Bridging
  • Datagrams
    • connectionless
    • routing
    • forwarding table
  • Virtual Circuit Switching
    • VCI
    • Virtual Circuit tables
  • Source Routing
  • Bridges and LAN Switches
    • LAN interconnections
    • collision domain
    • extended LANs
  • Learning Bridges
    • Simple learning
    • Spanning tree algorithms
  • Basic Internetworking
    • concepts
    • Service Model
      • Datagram delivery
      • Unreliable service
      • Best-effort service
      • IP Packet Format
      • Fragmentation and reassembly
Topic revision: r2 - 2015-10-13 - JimSkon
 
This site is powered by the TWiki collaboration platformCopyright &© by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback