Proof of deadlock freedom and livelock freedom is presented.
同时给出了无死锁无活锁的证明。
Both partially adaptive NPN and deterministic IDO are minimal, deadlock and livelock free.
部分自适应的NPN和确定性的IDO都是无死锁，无活锁且最短的路由算法。
This paper analyses the receiving livelock problem faced by router at high packets arriving rate and its existing solutions.
分析了路由器在大报文流量下所面临的接收活锁问题和已有解决方法。
The results of the tests prove that these methods can avoid livelock effectively and improve the performance of overloaded servers greatly.
实验证明这些方法能有效防止活锁现象，极大地提高服务器在高负载情况下的性能。
In this paper, the issues in designing the routing algorithm in fabric are surveyed, including state information, routing strategies, deadlock and livelock freedom, quality of service...
本文从状态信息、路由策略、死锁活锁避免、服务质量路由和容错路由等五方面对交换网络路由算法设计进行了分析总结，最后展望了未来发展趋势。
In this paper, the issues in designing the routing algorithm in fabric are surveyed, including state information, routing strategies, deadlock and livelock freedom, quality of service...
本文从状态信息、路由策略、死锁活锁避免、服务质量路由和容错路由等五方面对交换网络路由算法设计进行了分析总结，最后展望了未来发展趋势。
应用推荐