Sliding Window Efficiency Calculator
Sliding windows keep the link busy during the round trip: with a = 25 and a window of 7, efficiency is 13.7254902 %.
13.7254901960784 %
Full answer, then cut to fewer decimals (not rounded):
- 13.7254901960784 %
- 13.725490196078 %
- 13.72549019607 %
- 13.7254901960 %
- 13.725490196 %
- 13.72549019 %
- 13.7254901 %
- 13.725490 %
- 13.72549 %
- 13.7254 %
- 13.725 %
- 13.72 %
- 13.7 %
- Transmission time Tt = L/B
- 0.8 ms
- a = Tp/Tt
- 25
- Throughput
- 1.37254902 Mbps
- Window for 100 % efficiency, 1 + 2a
- 51
- Sequence number bits needed
- 3
Step-by-step solution
- Tt = 8000 bits ÷ 10000000 bps = 0.8 ms; a = 20 ÷ 0.8 = 25
- η = N ÷ (1 + 2a) = 7 ÷ 51
Sliding Window Efficiency Formula
η = N ÷ (1 + 2a), a = Tp ÷ Tt
GBN sequence bits ⌈log₂(N + 1)⌉, SR ⌈log₂ 2N⌉
Worked Example
A 10 Mbps link, 1000-byte frames, 20 ms one-way delay and a window of 7 (Go-Back-N):
- Tt = 8000 bits ÷ 10000000 bps = 0.8 ms; a = 20 ÷ 0.8 = 25
- η = N ÷ (1 + 2a) = 7 ÷ 51
a = Tp/Tt: 25 · Throughput: 1.37254902 Mbps · Window for 100 % efficiency, 1 + 2a: 51 · Sequence number bits needed: 3
GATE tip
Convert units first: frame size to bits and delays to the same time unit. Most errors in these questions come from bytes versus bits or ms versus µs.
More Computer Networks and Algorithms Calculators
-
Subnet Calculator
network = IP AND mask, broadcast = network OR wildcard
hosts = 2^(32 − prefix) − 2
Example: 192.168.10.77/26: Network address = 192.168.10.64/26.
-
CRC Calculator
frame = data · 2ʳ + (data · 2ʳ mod G)
modulo-2 (XOR) division; r = degree of G
Example: Data 1101011111 with generator x⁴ + x + 1 (10011): Transmitted frame = 11010111110010.
-
Hamming Code Calculator
2ʳ ≥ m + r + 1
parity bit p checks positions with bit p set; syndrome = error position
Example: The data bits 1011: Hamming code word = 0110011.
-
Master Theorem Calculator
T(n) = aT(n/b) + Θ(nᵏ logᵖ n)
compare k with log_b a
Example: T(n) = 8T(n/2) + n²: T(n) = Θ(n^3).
Frequently asked questions
What window size gives 100 % efficiency?
N ≥ 1 + 2a frames, enough to keep sending until the first acknowledgement returns.
Why does Selective Repeat need more sequence numbers?
The receiver window equals the sender window, so sequence space must be at least 2N to avoid confusing old and new frames.
Sources
Last reviewed: . Factors are stored exactly and computed with 50-digit decimal arithmetic. See how we verify conversion factors.
Cite this page
APA
Scientific Converters. (2026, October 15). Sliding Window Efficiency Calculator. Retrieved October 25, 2026, from https://scientificconverters.com/calculators/sliding-window-calculator/
IEEE
Scientific Converters, "Sliding Window Efficiency Calculator," scientificconverters.com. Accessed: Oct. 25, 2026. [Online]. Available: https://scientificconverters.com/calculators/sliding-window-calculator/