newman
Junior Member level 3
data communication tutorial
_____________________________________________________________________
Consider the transfer of a file containing one million 8-bit characters from one station to another. What is the total elapsed time and effective throughput for the following cases.
A Ring topology local network with a total circular length of 2D, with the two station distance D apart. Acknowledgement is archived by the allowing a frame to circulate past the destination station, back to the source station, with an acknowledgement bit set by the station. There are N repeaters on the ring, each of which introduces a delay of one bit time. Repeat the calculation for each of b1 through b4 for N=10; 100; 1000
______________________________________________________
This question from Data and Communications book, author is William Stallings
I don’t understand the actual one bit time how can obtained? Can show me to solve this problem??
_____________________________________________________________________
Consider the transfer of a file containing one million 8-bit characters from one station to another. What is the total elapsed time and effective throughput for the following cases.
A Ring topology local network with a total circular length of 2D, with the two station distance D apart. Acknowledgement is archived by the allowing a frame to circulate past the destination station, back to the source station, with an acknowledgement bit set by the station. There are N repeaters on the ring, each of which introduces a delay of one bit time. Repeat the calculation for each of b1 through b4 for N=10; 100; 1000
______________________________________________________
This question from Data and Communications book, author is William Stallings
I don’t understand the actual one bit time how can obtained? Can show me to solve this problem??
