EE6340 Introduction to Telecommunications Networks

Topics covered in the textbook:

Dimitri Bertsekas and Robert Gallager
Data Networks - Second Edition
Prentice Hall


Chapter 1: Introduction and Layered Network Architecture

1.1 Historical Overview
1.2 Messages and Switching
1.3 Layering

Chapter 2: Point-to-Point Protocols and Links

2.1 Introduction
2.3 Error Detection
2.4 ARQ: Retransmission Strategies
  2.4.1 Stop-and-Wait ARQ
  2.4.2 Go Back n ARQ
  2.4.3 Selective Repeat ARQ
2.5 Framing
2.8 Point-to-Point Protocols at the Network Layer
  2.8.1 Session Identification and Addressing
  2.8.2 Packet Numbering, Window Flow Control, and Error Recovery
  2.8.3 The X.25 Network Layer Standard
  2.8.4 The Internet Protocol
2.9 The Transport Layer
  2.9.3 Error Recovery in TCP
  2.9.4 Flow Control in TCP/IP
2.10 Broadband ISDN and the Asynchronous Transfer Mode
  2.10.1 Asynchronous Transfer Mode (ATM)
  2.10.2 The Adaptation Layer

=======================================================================
Midterm Exam
=======================================================================

Chapter 3: Delay Models in Data Networks

3.1 Introduction
3.2 Queueing Models - Little's Theorem
3.3 The M/M/1 Queue System
3.4 The M/M/m, M/M/infinite, M/M/m/m. and Other Markov Systems
  3.4.1 M/M/m: the m-Server Case
  3.4.2 M/M/infinite: The Infinite-Server Case
  3.4.3 M/M/m/m: The m-Server Loss System
  3.4.4 Multidimensional Markov Chains - Applications in Circuit Switching
3.5 The M/G/1 System
  3.5.1 M/G/1 Queues with Vacations
  3.5.3 Priority Queueing

Topics not covered in the textbook

- M/Stotted/1
- M/Slotted with re-service/1
- M/Slotted with re-queueing/1
- M+Geom/Slotted/1 service policy: priority given to Geom arrivals
- M+Geom/Slotted/1 service policy: priority given to M arrivals
- M+Geom/Slotted/1 service policy: FCFS


=======================================================================
Final Exam
=======================================================================

Chapter 4: Multiaccess Communication

4.1 Introduction
4.2 Slotted Multiaccess and the Aloha System
  4.2.1 Idealized Slotted Multiaccess Model
  4.2.2 Slotted Aloha
  4.2.4 Unslotted Aloha
4.3 Splitting Algorithms
4.4 Carrier Sensing
  4.4.1 CSMA Slotted Aloha
  4.5.2 Local Area Networks: CSMA/CD Ethernet
  4.5.3 Local Area Networks: Token Rings

Chapter 5: Routing in Data Networks

5.1 Introduction
  5.1.1 Main Issues in Routing
  5.1.2 Wide Area Network Routing: An Overview
5.2 Network Algorithms and Shortest Path Routing
  5.2.1 Undirected Graphs
  5.2.2 Minimum Weight Spanning Trees
  5.2.3 Shortest Path Algorithms
    - The Bellman-Ford Algorithm
    - Dijstra's Algorithm
    - The Floyd-Warshall Algorithm
  5.2.4 Distributed Asynchronous Bellman-Ford Algorithm

Topics not covered in the textbook

- max-flow min-cut theorem

Chapter 6: Flow Control

6.1 Introduction
  6.1.1 Means of Flow Control
  6.1.2 Main Objectives of Flow Control
6.2 Window Flow Control
  6.2.1 End-to-End Windows
  6.2.3 The Isarithmic Method
6.3 Rate Control Schemes