4级Clos网络不阻塞的条件  

Nonblocking Conditions of 4-Stage Clos Networks

作　　者：程亮[1] 李乔[1] 

机构地区：[1]上海交通大学数学系,上海200240

出　　处：《上海交通大学学报》2004年第5期838-841,共4页Journal of Shanghai Jiaotong University

摘　　要：给出了交换网络非阻塞特性图论形式上的定义,运用图论的概念和方法得到了4级Clos网络严格不阻塞的充分必要条件和可重排不阻塞的一个充分条件.并运用Hall定理,证明得到了代数学中的一个引理.Giving the definition of nonblockingness of Clos network in terms of graph theory, using some conceptions and tools in graph theory, this paper formulated and proved a sufficient and necessary condition under which a (4-stage) Clos network is strictly nonblocking and a sufficient condition under which a 4-stage Clos network is rearrangeably nonblocking. A common theorem in algebra was obtained by applying Hall theorem in the proving. The conclusion of this paper about Clos network is of originality.

关 键 词：图论 4级Clos网络 严格不阻塞 可重排不阻塞 Hall定理 

分 类 号：O157.5[理学—数学]