用排序网实现ATM信元淘汰

Modified Batcher Network For ATM cell Knockout

本文探讨了修改排序网实现信元淘汰的方法（简称Ｂ网）。比较了Ｂ网和［１］中淘汰网（简称Ｋ网）的复杂性和时延。给出了集线比λ＝Ｌ／Ｎ的临界值λ０（Ｎ），并证明当λ＞λ０（Ｎ）时Ｂ网有较小复杂性和较小时延。

The Bnet, a modified Batcher network for ATM cell knockout is proposed in this paper. Its complexity and delay performance is compared with the Knet proposed in [1]. It is shownthat, for each N, there is a value λ0(N),tends to log2N/4N asymptotically. When the concentrotion factor λ= L/N>λ0 (N) 9 the B net is better in both of its complexity and time delay performance.