| 摘要 |
<p>The time lapse between two readout counters which scan the storage elements of a calendar (K) in a cyclic pattern is restricted. The storage elements (nSB) are arranged in pairs containing the pointers (ZEA,ZEE) which mark the beginning and the end of a logical queue (W) in another memory (SP). A variable (Tnow) denoting the system time, and another (RP) denoting the desired waiting time of the latest cell stream, are cyclically compared. The incrementation of the first variable is delayed until the time difference ceases to exceed a threshold ( tau ).</p> |
