1 / 4

Review for Midterm Neil Tang 10/17/2008

Review for Midterm Neil Tang 10/17/2008. Chapter 1. Time Division Multiplexing (TDM) VS. Statistical Multiplexing: how do they work, weakness and strength. OSI 7-layer model and the major functionalities of each layer. Typical examples of protocols in each layer.

julius
Télécharger la présentation

Review for Midterm Neil Tang 10/17/2008

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Review for Midterm Neil Tang10/17/2008 CS440 Computer Networks

  2. Chapter 1 • Time Division Multiplexing (TDM) VS. Statistical Multiplexing: how do they work, weakness and strength. • OSI 7-layer model and the major functionalities of each layer. • Typical examples of protocols in each layer. • Latency and effective throughput: how to compute. CS440 Computer Networks

  3. Chapter 2 • Shannon’s theorem • Different encoding methods: weakness and strength • Different framing schemes: character/bit stuffing • Three error detection algorithms: how do they work • Sliding window algorithm: procedure, sequence numbers • Ethernet: Exponential backoff, min frame size, weakness and strength • 802.11: the hidden/exposed terminal problems, CSMA/CA, difference • 802.16: scheduling (signaling and algorithm), weakness, strength • Token ring: token passing and token release methods. CS440 Computer Networks

  4. Chapter 3 • Three packet switching schemes: how do they work, weakness and strength • Bridges: spanning tree algorithm • Switch implementation: switch architecture, head-of-line problem, self-routing CS440 Computer Networks

More Related