Exam #3 Study Guide
EcpE 489, Fall 2002 (Russell)
DATE AND TIME: Tuesday, November
12, during the usual class time in our usual classroom.
SUBJECT MATTER: The exam will cover the lecture
material since the last exam up to, and including, the lecture on November
5. It will cover the homework assignments that apply to the lecture
material
SUGGESTIONS: Start or join a study group. Study
together and share lecture notes. For this first exam, concentrate on answering
conceptual questions, some of which will be in essay form.
General Information
-
Exams are closed book. One 81/2 by 11 sheet of
paper (crib sheet) can be used for reference to study notes. No other information
is allowed.
-
Bring your palm computers and/or calculators to
class. They are usually not needed but if they are, you will be specifically
instructed to do so at the start of the exam.
-
Selection of exam problems will give emphasis
to the topics emphasized in the lectures and the problems assigned as homework.
Example Study Topics (test questions
will be taken from these)
-
Probability of a frame error
-
Probability of error-free packet reception
-
Average number of message retransmissions
-
Average number of transmissions per packet
-
Hop-to-hop versus end-to-end
-
Effects of delay in network efficiency and ARQ
-
Efficiency of Stop and Wait, Go-Back-N, and Selective Repeat ARQs
-
Go-Back-N ARQ
-
Selective Repeat ARQ
-
Network Address Translator
-
What is a NAT?
-
How does it work?
-
IP Hopping - What is it?
-
Frame Synchronization
-
Bit Stuffing
-
Point-to-Point Protocol
-
Link Control Protocol
-
What is tunneling?
-
Define the basic network access types
-
Multiple access communications
-
Sharing the channel
-
Fair access to the channel
-
Half-Duplex and Full-Duplex methods
-
Multiple access methods (overview)
-
Time domain multiple access
-
Frequency domain multiple access
-
Code division multiple access
-
Space division multiple access
-
Medium access control (MAC)
-
MAC protocols
-
MAC Sublayer
-
Logical Link Control
-
Multiple Access using CSMA
-
1-persistent
-
non-persistent
-
p-persistent
-
CSMA-CD and probablity of success
-
Scheduling Methods
-
Reservation
-
Polling
-
Token Ring