formulas and applications Flashcards

Familiarise variables, formulas and their applications

1
Q

What is the formula for total transmission time for a frame of size L bits over a link of rate R and distance d?

A

Time= L/R + d/v
Where:
L: Frame length (bits)
R: Transmission rate (bps)
d: Distance between nodes
v: Propagation speed in medium

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

What does the variable L/R represent in a transmission delay formula?

A

Transmission delay — time to push all bits into the link

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

What does d/v represent in a transmission delay formula?

A

Propagation delay — time for a bit to travel from sender to receiver

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

Formula for channel efficiency in Stop-and-Wait ARQ?

A

η= L/L+2TpR
Where:
L: Frame size (bits)
Tp: Propagation time
R: Transmission rate

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

What is the efficiency of a Go-Back-N ARQ protocol?

A

𝜂=𝑊/1+2𝑎
Where:
W: Window size
𝑎=𝑇𝑝/𝑇𝑓 : Normalized propagation time
𝑇𝑓: Frame transmission time

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

In PPP, what are the byte stuffing escape sequences for 0x7E and 0x7D?

A

0x7E becomes 0x7D 0x5E

0x7D becomes 0x7D 0x5D

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

Formula to calculate link utilization?

A

𝑈=UsefulDataRate/ TotalTransmissionRate

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

What formula determines the number of crosspoints in a crossbar switch?

A

Ncrosspoints = 𝑛×𝑛,
where 𝑛 is number of inputs/outputs

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

What is the bit rate for a TDM system with
𝑁 channels each transmitting at 𝑅 bps?

A

Total rate = 𝑁×𝑅

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

What is the bandwidth requirement for a signal sampled at 𝑓𝑠 Hz with 𝑏 bits/sample?

A

Bitrate = 𝑓𝑠 × 𝑏

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

Q: What is the formula for transmission delay?

A

A: Transmission Delay = Packet Length (L) / Transmission Rate (R)

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

Q: What is the formula for propagation delay?

A

A: Propagation Delay = Distance (d) / Propagation Speed (s)

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

Q: What is the total nodal delay?

A

A: Total Delay = Processing + Queuing + Transmission + Propagation

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

Q: What is the formula for throughput?

A

A: Throughput = Total Data Sent / Total Time

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

Q: What is the formula for link utilization?

A

A: Utilization = Useful Time / Total Time

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

Q: How do you calculate round-trip time (RTT)?

A

A: RTT = 2 × Propagation Delay

17
Q

Q: Formula for utilization in Stop-and-Wait ARQ?

A

A: Utilization = L / (L + 2RTT × R)

18
Q

Q: How do you calculate Bit Error Rate (BER)?

A

A: BER = Number of Errors / Total Bits Sent

19
Q

Q: What does the Shannon Capacity formula calculate?

A

A: C = B × log₂(1 + S/N), where B = bandwidth, S/N = signal-to-noise ratio

20
Q

Q: How do you calculate the efficiency of Slotted ALOHA?

A

A: Efficiency = G × e^(-G), where G = average number of frames per slot

21
Q

Q: How is window size related to bandwidth-delay product in sliding window protocols?

A

A: Window Size = Bandwidth × RTT

22
Q

Q: What is the Go-Back-N ARQ retransmission condition?

A

A: Retransmit all frames starting from the one with error

23
Q

Q: In Selective Repeat ARQ, what happens on error?

A

A: Only the erroneous frame is retransmitted

24
Q

Q: What is the maximum utilization of Pure ALOHA?

A

A: Maximum Efficiency = 1 / (2e) ≈ 18.4%

25
Q

Q: What is the maximum utilization of Slotted ALOHA?

A

A: Maximum Efficiency = 1 / e ≈ 36.8%

26
Q

Bits in Transit (Bandwidth-Delay Product)

A

BitsinTransit=DataRate(bps)×PropagationDelay(s)

27
Q

Can a connection-oriented, reliable message transfer service be provided across a connectionless packet network?

A

Yes, by adding reliability features at higher layers (e.g., the transport layer). Protocols like TCP provide reliability by using sequence numbers, acknowledgments, retransmissions, flow control, error control and congestion control to ensure correct delivery over an unreliable network like IP

28
Q

Can a connectionless datagram transfer service be provided across a connection-oriented network?

A

Yes. A connectionless service can be built on top of a connection-oriented network by sending independent messages without using the connection features. The higher layer can treat the underlying connection as a transparent channel, providing no reliability or ordering by design.