Communication Networks > Link Layer > Flashcards

Link Layer Flashcards

(63 cards)

Study These Flashcards
1
Q

What are the 4 link layer services?

A
  1. framing
  2. synchronisation
  3. flow control
  4. errors in transmission
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How does framing work in the link layer?

A
  • encapsulates datagram into frame
  • adds header and trailer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are MAC addresses and what are they used for?

A
  • used if shared medium
  • used in frame headers to identify source and destination
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How does the link layer use reliable delivery between adjacent nodes?

A
  • seldom used on low bit-error link
  • half/full duplex
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Do wireless links have high or low error rates?

A

high

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How are link layer functions implemented?

A
  • in an adaptor (network interference chip NIC)
  • on a chip
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the two types of links?

A
  • point-to-point
  • broadcast
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are the 3 classes of MAC protocols?

A
  1. Channel Partitioning
  2. Random Access
  3. Round robin
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How does channel partitioning work?

A

allocate to node exclusively

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How does random access work?

A

contention mechanisms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How does round robin work?

A

Nodes take turns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How does point-to-point data link control work?

A
  • 1 sender
  • 1 receiver
  • 1 link
  • no MAC
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What are the 2 most popular DLC protocols?

A
  1. PPP: point-to-point protocol
  2. HDLC: high level data link control
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How is a PPP data frame structured, what does each part do and how many bytes for each section?

A

8 - Flag: delimiter
8 - Address: nothing
8 - Control: nothing
8/16 - Protocol: upper layer protocol to which
frame delivered
Variable: Info: upper layer data being carried
16/64 - Check: cycle redundancy check for error
detection
8 - Flag

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the 3 performance considerations for the link layer?

A
  1. Delay between ready to transmit and completion of successful transmission
  2. Throughput - total rate of data being transmitted between stations
  3. Utilisation of the medium - fraction of total capacity being used
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is propagation delay?

A

time taken for signal to propagate from one node to the next

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is transmission delay

A

time taken for transmission to send out block of data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What is the equation for propagation delay?

A

distance / velocity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What is the equation for transmission delay?

A

Length of frame / data rate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

What is an example if a centralised round-robin technique?

A

Polling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What is an example of a distributed round-robin technique?

A

Token Bus
Token Ring

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

What is an example of a centralised reservation technique?

A

Centralised reservation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

What is an example of a distributed reservation technique?

A

Distributed reservation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

What is an example of a centralised contention technique?

A

There are none

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What is an example of a distributed contention technique?
ALOHA, CSMA, CSMA/CD
26
What is polling?
Master node invited slave nodes to transmit in turn
27
What is token passing?
Control token is passed form one node to the next sequentially
28
What is a random access MAC protocol specify?
- how to detect collisions - how to recover from collisions
29
What are examples of a random access MAC protocol?
CSMA, CSMA-CD, CSMA-CA, ALOHA, slotted ALOHA
30
What is CSMA?
- carrier sense multiple access - LAN protocol - if channel is busy then wait until becomes idle - if collision occurs wait a random time and start over
31
What are the 6 CSMA-CD performance assumptions?
1. N independent stations 2. only 1 medium channel 3. Normalised transmission time (=1) 4. if overlapping -> collision -> frame loss (only source of error) 5. continuous or slotted time 6. carrier sense or no carrier sense
32
For 1 persistent CSMA-CD what is the probability that exactly one station attempts transmission in a slot?
A = NP(1-P)^(N-1) N = no of stations P = prob station transmits during an available slot Slot = twice the end to end propagation = 2a
33
What is the utilisation for 1 persistent CSMA-CD?
U = 1/[(1+2a)/A]
34
What does a bus ethernet cable have?
coaxial cable
35
What does a star ethernet cable have?
switch
36
What is the ethernet frame structure?
Preamble Destination address Source address Type Data CRC
37
What is a token ring?
- point to point interfaces - token circulates round ring - seize token ot transmit
38
What are the token ring states?
- listen - transmit
39
When is the token released on a token ring?
after the station finishes transmitting and the receipt of the physical transmission edge
40
What are the performance assumptions for the token ring?
- normalised throughput to system capacity - normalised transmission time - propagation delay = a - N stations ready to transmit - all stations equidistant
41
If a>1 what time is the transmission finished for a token ring?
t0+1
42
if a>1 what time does all the the frame return back to the start for a token ring?
t0+1+a
43
If a<1 for a token ring, what is the transmission process?
- frame started to be sent - still transmitting when the frame starts to be received - waits for all of frame to be received until sending ack
44
What is the token ring utilisation for a<1?
U = 1/(1+a/N)
45
What is the token ring utilisation for a>1?
U = 1/(a+a/N)
46
For a broadcast token ring mechanism, what is the transmission process?
- if have data, listen - free token then append data - transmit token - information goes round ring - one station reads the data - full frame transmitted back round to start - station assumes data read and extracts data back - token free again
47
What are the 2 flow control protocols?
stop and wait sliding window
48
What are the 3 error control protocols?
stop and wait ARQ selective reject ARQ go back n ARQ
49
What is the purpose of flow control?
assure sender doesn't overwhelm receiver
50
What is the principle of flow control?
do not accept frames from sender until receiver grants permission
51
What is the half duplex stop and wait protocol?
- send frame - receives ok - acknowledge - send new frame
52
What is the utilisation of the stop and wait protocol for a half duplex?
U = 1/(1+2a)
53
What is the sliding window protocol?
- sender keeps list of sequence number of frames sent - keep frames in memory until ack - if buffer full, stop transmitting - receievr keeps window size with number of frame sequence - frames falling out of window discarded
54
What is the utilisation of the sliding window protocol?
U = W/(2a+1)
55
What is the stop and wait ARQ?
once frame acknowledged transmit next frame
56
what is the go back n ARQ?
- send series of frames determined by window size - if error detected discard all frames after corrupted one - sender retransmits from corrupted onwards
57
What is the selective repeat ARQ?
- only one frame transmitted due to corrupted frame/time- out - minimizes amount of transmission - receivers contain storage and logic to order frames
58
What is the utilisation of the ARQ protocols?
Tf/(NrTt)
59
What are the assumptions when analysing ARQ protocols?
acks and negative acks are error free
60
What is the equation for expected number of transmission of one frame (Nr)?
Nr = 1/(1-P)
61
What is the utilisation for stop and wait protocol?
(1-P)/(1+2a)
62
What is the utilisation for selective repeat protocol?
W>2a+1: U = 1-P W<2a+1: U = [W(1-P)]/(1+2a)
63
What is the utilisation for go back n ARQ protocol?
W>2a+1: U = (1-P)/(1+2aP) W<2a+1: U = [W(1-P)]/[(1+2a) (1-P+WP)]
Communication Networks
flashcards
Decks in class (8)
# Cards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2026 Bold Learning Solutions. Terms and Conditions