简体   繁体   中英

Efficiency of delayed token ring insertion?

Let N be the number of stations in the ring, THT the token holding time, Tt be the transmission time of packet, Tp be the propagation time of packet on Channel/ Link.

Then Cycle Time = N * THT + Tp (this is cycle time for token)

and efficiency = (useful time)/(Cycle Time)

Here useful time is stated as N * Tt. (justified as transmission time at each station in single cycle of token passing)

And thus proven efficiency = (N * Tt)/(N*THT + Tp)

Now THT depends on what strategy we are using. If I am using delayed token ring then only one station transmits the data and other station doesn't transmit the data, but everywhere showing in useful time Tt multiplied by N.In this case, THT = Tt + Tp So, cycle time = Tp + N*(Tt + Tp)

Efficiency, e = (N Tt)/(Tp + N (Tt + Tp)). My question is why we multiplied Tt by N inspite of one transmits the data?

Here in delayed token ring N=1 since only one station transmitting the data so, Efficiency, e = Tt/Tp + Tt + Tp=Tt/2Tp + Tt.

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM