Data Communication

Course Materials

mv polydiv.sty /home/abby/texmf/tex/latex
texhash

Data communication as a network of flows (a graph)
Network flow algorithm, shortest-path algorithm, etc.
- The Maximum flow and the Minimum cut
Little’s theorem, Queueing theory, Markov chains, Poisson process
Scheduling for timely data delivery and/or data-loss tolerance

Real-time communication
Fault-tolerant communication
- Data retransmission and/or Passive replication
- CAP Theorem
Flow controls
- Data communication as a network of flows
- ARQ at the data-link layer vs. Window flow control at the transport layer
Layered Networks
- Image Not Showing Possible Reasons
  The image file may be corrupted
  The server hosting the image is unavailable
  The image path is incorrect
  The image format is not supported
  Learn More →
- Circuit switching vs. packet switching
- Point-to-point communication vs. end-to-end communication
- Multiplexing - TDM vs. FDM
Error detection vs. error correction vs. retransmission
In the DLC layer, error detection and correction.
Free-for-all multiaccess vs. Perfectly-scheduled multiaccess
- CAN, Aloha, TDMA and its extension to improve throughput
  - Slotted ALOHA
  - CAN Bus Arbitration
- Time synchronization