Comp 346 Final Exam Study Guide
Final Exam is Tuesday, May 10, 1:45-2:45

Here is a summary of the sections (seventh edition) that may be 
covered on the final:

Chapter 7: (also on midterm)
7.1:    stop-and-wait and sliding windows intro
7.2:    fine-tuning of sliding windows: go-back-N and selective-reject
7.3:    basics of HDLC, a typical link-level sliding-windows protocol.
        HDLC uses sliding windows on a link-level basis

Chapter 8: (also on midterm)
8.1:    FDM (traditional)
8.2:    TDM, revisited. Lots on SONET.

Chapter 9: Spread Spectrum, intro to cellular phones
9.1: 	basic concepts
9.2:	frequency hopping
9.3:	Theoretically this is a prereq to 9.4, but I think you can
	safely omit this.
9.4:	CDMA

I am working on how to make some more detailed information from 
chapter 9 available to those who have only the SIXTH edition of Stallings.

There is a limited review of spread spectrum in Section 5.5 of the
SIXTH edition.

Chapter 11:
11.2:   ATM connections & paths
11.3:   ATM cell format
11.4:   ATM over SONET, etc
11.5:   ATM service categories: CBR, VBR-rt, VBR-nrt, ABR, UBR
11.6:   ATM Adaptation Layer

Chapter 13:
13.1:   Congestion basics
13.2:   Summary of congestion options
13.3:   More congestion appreaches
13.4:   Congestion summary (very short)
13.5:	omit
13.6:   ATM traffic management, GCRA, Token Buckets and Leaky Buckets
	Note that GCRA is *not* actually in Stallings.
13.7:   ATM-GFR traffic management

Chapter 14:
14.3: 	CDMA cellular networks

Chapter 19:
	RSVP (pp 647-648)
In the SIXTH edition, there is an entire RSVP-related chapter: chapter 16.
Section 16.3 is the main one, but 16.2 and 16.4 are closely related.

Also covered: 
GCRA(T,tau): General Cell Rate Algorithm

RSVP	rfc2205, section 1 (covered reasonably well in ch 16 of 
Stallings SIXTH edition)

==============================================  

Here are a few exercises. The first number is the problem number in the 
seventh edition; the second number is the problem number from the sixth
edition.

Also study the Review Questions at the end of each of the relevant chapters.

Chapter 7
1/1
2/2
3/3
4/4 (discussed before midterm in class)
6/14
9/17

Chapter 8
4/4
7/7
9/9

Chapter 9	(not found in 6th edition)
4
5
Be familiar with the calculations in Table 9.1

Chapter 11
2ab/2ab
3b/3b
5/4
6/5
7/6

Chapter 13

Recall the GCRA algorithm (this same definition will be given to you
on the exam):
    GRCA(T,tau): Avg time T between packets, tau = variation        
    Suppose current cell is expected at time tat, actually arrives at t
    Case 1: t < tat - tau (too EARLY): NONCONFORMING; do not change tat
    Case 2: t >= tat - tau: CONFORMING; newtat = max(t,tat) + T

Consider the following set of packet arrival times. 

	0  0  3  5  7  9  16  16
	
1. For GCRA(3,2), which packets are compliant?


2. For GCRA(3,1), which packets are compliant?


3. For GCRA(2,10), which packets are compliant?


For each example, also give the values for the theoretical arrival
times (tat).


4. For a GCRA(4,25) flow, 
   (a) how many packets can be sent as a burst at T=0?
   (b) if that burst is sent, at what time can the next packet be sent?


5. For each of the ATM traffic classes CBR, rt-VBR, nrt-VBR, and UBR, 
list the Quality-of-Service (QoS) and Traffic parameters they request.


6. Outline the differences between AAL3/4 and AAL5 in terms of:
(a) data bytes per packet
(b) bits used in ATM header
(c) error detection


7. Suppose an ATM connection meets GCRA(6, 18). 
(a) What is the maximum size of a packet burst?
(b) Assume the available output bandwidth is 1 packet per 4 time units. 
How long does it take to send a packet burst?
(c). What outbound bandwidth is needed if the maximum delay 
is 8 time units?
(d). What outbound bandwidth is needed if the maximum delay 
is 20 time units?


8. Compare and contrast ATM connection admission with RSVP.


9. Give an equivalent definition of GCRA in terms of token/leaky 
buckets.


10. Explain the differences and similarities between admission
control and policing.