Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

3 . ( 2 0 pts ) Choose the most appropriate answer in each of the following cases ( with a brief justification ) .

3.(20 pts) Choose the most appropriate answer in each of the following cases (with a brief justification).
D: To implement packet re-transmissions in a window-based data transfer protocol (with window-size Ws >1), the selective-repeat policy (SR) incurs a higher software complexity than the goback-N policy (GBN), because:
(i) Maximum allowed Ws in SR is only half of that in GBN;
(ii) SR treats each of Ws packets separately, but GBN treats the entire Ws packets as one unit;
(iii) SR reduces unnecessary packet retransmissions, when compared to GBN;
(iv) Retransmission timeout in SR is more sensitive to network transfer delays than in GBN.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Transactions On Large Scale Data And Knowledge Centered Systems Vi Special Issue On Database And Expert Systems Applications Lncs 7600

Authors: Abdelkader Hameurlain ,Josef Kung ,Roland Wagner ,Stephen W. Liddle ,Klaus-Dieter Schewe ,Xiaofang Zhou

2012th Edition

3642341780, 978-3642341786

More Books

Students also viewed these Databases questions

Question

Complexity of linear search is O ( n ) . Your answer: True False

Answered: 1 week ago