data link layer Flashcards

1
Q

what are some services that the datalink layer provides

A

framing
reliable delivery between adjacent nodes
flow control
error detection and correction
full and half duplex

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

framing

A

encapsulating datagrams from the network layer into a frame and adding a header and trailer

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

MAC address

A

added in the frame header
id the source and destination of each hop

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

how are mac addresses portable

A

when you change networks you dont need a new one

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

ARQ; automatic repeat request

A

asks the previous hop to resend the packet if theres an error

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

flow control

A

the pacing between adjacent sending and receiving hops

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

half-duplex

A

both the sender and receiver cant transmit data at the same time

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

how is the link layer implemented

A

on a network interface card

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

what is the NIC a combination of

A

firmware; software thats hardware specific
software; the kernel has modules for the link layer
hardware; the nic

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

ep roam

A

non volatile memory that stores firmware

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

what does the edc include

A

could be the entire frame including the header or just the data

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

what does the node do if theres too much corruption compared to if theres only a little

A

too much; asks to resend
little; corrects and sends

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

parity bit

A

single bit that detects single errors
with even parity you set the bit so theres an even amount of 1s

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

how do we alter parity bit to correct errors and how does this work

A

use two-dimensional parity
theres a parity bit for each row and column
when an error is detected the intersection of the row and column shows which bit it is which can then be flipped to correct it

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

what is an issue with 2-d parity

A

can only detect one error per row(odd number of errors )

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

what are two issues with regular parity bit

A

only detect an odd number of errors
doesnt correct

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

what effects do a larger edc have

A

better edc however decreases the efficiency of data throughput

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

cycle redundancy check(crc)

A

uses field theory to compute semi unique values for a given message

19
Q

why does crc only compute semi-unique values

A

depends on d and g and some values may have the same remainder

20
Q

what type of errors does crc detect

A

single and duplicate
errors with odd bit numbers

21
Q

what happens on the sender side of crc

A

add r 0s to the data bits
divide the new sequence by g using binary division and get the remainder
transmit the originial data followed by the computed remainder(crc)

22
Q

what happens on the receiver side of crc

A

divide the transmitted sequence by g
if the remainder is 0 then there are no errors

23
Q

what is the generator value in crc

A

r + 1

24
Q

what are the 2 types of multiple access links

A

point-to-point
shared broadcast

25
Q

multiple access protocol

A

a distributed algorithm that determined how nodes share a channel

26
Q

collision

A

when two or more nodes transmit simultaneously and their signals interfere with each other

27
Q

distributed algorithm

A

a protocol that determines how and when each node can transmit on a shared channel to avoid collisions

28
Q

what are two mac protocols

A

channel partitioning
random access

29
Q

channel partitioning

A

dividing the channel into smaller pieces and allocating each one to a node

30
Q

tdma; time division multiple access

A

each node gets a fixed time slot which is when the node can send data if its available

31
Q

what is the issue with tdma

A

not efficient as unused slots go idle

32
Q

fdma; frequency division multiple access

A

the channel is divided into different frequency bands and each node gets assigned one where they can transmit data at any time

33
Q

what is the issue with fdma

A

lacks efficiency as a band is wasted if a device is not ready to transmit

34
Q

what are the two channel partitioning protocols

A

tdma
fdma

35
Q

random access protocols

A

channels arent divided and allow collisions but can recover from them

36
Q

what are some principles of sorted ALOHA

A

all frames are the same size and time slots are divided equally
code is transmitted at the beginning of the time slot
the nodes are synchronised and if 2 or more nodes transmit at the same time they detect the collision

37
Q

in ALOHA how are nodes able to detect a collision

A

nodes can hear their own signal so if they hear one that isnt them then they know that theres a collision

38
Q

how does ALOHA work

A

when a node gets a fresh frame it transmits in the next slot
if theres no collision then it can send a new frame in the next slot
if there is a collision then the node either backs off or re transmits until the frame goes through based on an algorithm

39
Q

what is a negative of aloha

A

theres a lot of collision and wasted resources
37% max efficiency

40
Q

simple csma; carrier sense multiple access

A

listens before transmission
if channel is empty then transmits entire frame
if busy then defer transmission

41
Q

csma/cd; with collision detection

A

when a collision is detected then the node backs off for a certain amount of time
if its repeated then the time to back off increases
collisions are detected within a short amount of time which reduces the amount of time wasted on them

42
Q

how does an nic detect a collision

A

comparing the signal theyre transmitting with the signal theyre receiving on the network

43
Q

what does the nic do when it detects another transmission whilst sending

A

sends a jam