早期和延迟令牌释放之间的区别

先决条件 – 令牌环

1. 早期代币发布：

• 发送方不等待数据包完成旋转才释放令牌。数据一传输就释放令牌。
• 环中存在多个数据包。
• 不如延迟令牌释放可靠。

2. 延迟释放代币：

• 在这种情况下，发送方发送数据包并等待整个数据包完成环的往返行程并返回到环的时间。当发送方接收到整个数据包时，它就会释放令牌。
• 一个实例的环中只有一个数据包。
• 比早期令牌发布更可靠。

早期和延迟令牌释放之间的区别：

Early Token Release	Delayed Token Release
Sender does not wait for the data packet to complete revolution before releasing the token.	In this, the sender transmit the data packet and waits till the time the whole packet takes the round trip of the ring and return to it.
Token is released as soon as the data is transmitted.	When the whole packet is received by the sender, then it releases the token.
At an instance, Multiple packets are present in the ring.	There is only one packet in the ring at any instance.
Less Reliable as compared to Delayed Token Release.	More Reliable as compared to Early Token Release.
Token Holding Time (THT) = Tt where, Tt = transmission delay	Token Holding Time (THT) = Tt + Tp where, Tt = transmission delay, Tp = propagation delay
Collision is possible as multiple packets are present in the ring.	Collision is not possible as there is only one packet in the ring at any instance.
Cycle Time = Tp + N * (Tt) where, Tt = transmission delay Tp = propagation delay N = No. of stations in ring	Cycle Time = Tp + N*(Tt + Tp) where, Tt = transmission delay Tp = propagation delay N = No. of stations in ring
Efficiency = (N * Tt) / (Tp + N * (Tt)) where, Tt = transmission delay Tp = propagation delay N = No. of stations in ring	Efficiency = (N * Tt)/(Tp + N*(Tt + Tp)) where, Tt = transmission delay Tp = propagation delay N = No. of stations in ring