EE/TE 4367 Telecommunications Networks

Topics covered in class organized by exam
[This list will be continuosly updated during this semester]

Pointers are given to the following books:

[LABEL=Stallings]
William Stallings
Data & Computer Communications
Sixth Edition
Prentice Hall
ISBN 0-13-084370-9

[LABEL=Bertsekas]
Dimitri Bertsekas, Robert Gallager
Data Networks
Second Edition
Prentice Hall
ISBN 0-13-200916-1

[LABEL=Bellamy]
John C. Bellamy
Digital Telephony
Third Edition
Wiley Interscience
ISBN 0-471-34571-7


================================================================
Midterm Exam I
================================================================

[Stallings]
Chapter 1
1.1 A Communications Model
1.2 Data Communications
1.3 Data Communication Networking
1.4 Protocols and Protocol Architecture
1.5 Standards


[Bertsekas]
Chapter 3
3.2 Queueing Models - Little's Theorem


[Bertsekas]
Chapter 2
2.5 Framing
2.5.1 Character-Based Framing
2.5.2 Bit-Oriented Framing: Flags
2.5.3 Length Fields
2.5.4 Framing with Errors
2.5.5 Maximum Frame Size


[Bertsekas]
Chapter 2
2.3 Error Detection


================================================================
Midterm Exam II
================================================================


[Bertsekas]
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


[Bertsekas]
Chapter 4
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


[Bellamy]
Chapter 1
1.2 The Analog Network Hierarchy
1.3 The Introduction of Digits

Chapter 8
8.1 Fiber Optic Transmission System Elements
8.2 Line Codes for Fiber Optic Transmission
8.3 Wavelength Division Multiplexing
8.5 SONET/SDH
8.6 SONET Rings


Chae Y. Lee and Seon G. Chang
"Balancing Loads on SONET Rings with Integer Demand Splitting,"
Computers Ops Res., Vol 24, No. 3, pp 221-229, 1997,
Elsevier Science Ltd


[Bertsekas]
Chapter 5
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
      Dijkstra's algorithm


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

[Bertsekas]
Chapter 3
3.3 The M/M/1 Queueing System
3.3.1 Main Results
      Arrival statistics - The Poisson Process
      Service statistics
      Markov chain formulation
      Derivation of the stationary distribution
3.3.2 Occupancy Distribution upon Arrival
3.3.3 Occupancy Distribution upon Departure
3.4 The M/M/m, M/M/infinity, M/M/m/m and Other Markov Systems
3.4.1 M/M/m: The m-Server Case
3.4.2 M/M/infinity: 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