存储-转发网络死锁问题  

A SOLUTION TO STORE-AND-FORWARD DEADLOCK IN COMPUTER NETWORKS

作　　者：李强[1] 王天仲[2] 赵志平 

机构地区：[1]河南财经学院信息系,郑州450002 [2]河南省信息中心,郑州450002 [3]河南电信局南阳线务段,南阳473071

出　　处：《计算机学报》1991年第9期704-709,共6页Chinese Journal of Computers

摘　　要：Inders Gopal讨论了在计算机网络中,报文包的通路在无回路的情况下的死锁问题,给出了预约缓冲的数目.本文以此为基础,进而给出在报文包的通路含有任意回路的情况下,死锁问题的解法,得出了几个结果.Inders Gopal discussed the problem af Store-and-Forward deadlock in computer networks, and gave a solution to the problem and a number of buffer reservation on-condition of no cycle in the packet travelling. Based on the solution given above, further solution on condition of whatever number of cycles in the packet travelling is given. Some interesting results are obtained.

关 键 词：报文包 存储 转发 网络 死锁 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]