We design a Blind Network-Assisted Diversity Multiple Access (BNDMA) method for resolving packet collisions in synchronous packet-switched networks. As opposed to typical BNDMA schemes, the method operates in non-blocking mode. Idle transmitters at the start of a collision resolution interval may join the set of active transmitters and contact the receiver before the end of the interval. A naive queuing analysis of the proposed scheme is exponentially complex in the size of the network. We carry out a computationally efficient analysis of the network throughput and queuing delay. We show that the suggested scheme reduces the queuing delay of the buffered packets at the transmitters without sacrificing the maximum throughput achieved by standard BNDMA. Further insights are derived from the numerical experiments.

中文翻译：

---

同步信道盲网辅助分集多址无阻塞方案

我们设计了一种盲网络辅助分集多址 (BNDMA) 方法来解决同步分组交换网络中的分组冲突。与典型的 BNDMA 方案相反，该方法以非阻塞模式运行。冲突解决间隔开始时的空闲发射器可以加入活动发射器组并在间隔结束前联系接收器。对所提出方案的朴素排队分析在网络规模上呈指数级复杂。我们对网络吞吐量和排队延迟进行了计算效率分析。我们表明，建议的方案在不牺牲标准 BNDMA 实现的最大吞吐量的情况下，减少了发送器缓冲数据包的排队延迟。进一步的见解来自数值实验。