4-stage Clos network Nonblocking的条件.pdfVIP

Nonblocking conditions of 4-stage Clos networks Cheng liang , Li qiao (Dept . of Math ShangHai JiaoTong Univ. 200240 Shanghai China) Abstract: Clos network is a class of networks which has been widely used. Study about the nonblockingness of Clos network is useful both in theory and practice. Results have been obtained on 3-stage Clos network nonblobcking conditions. The structure of 4-stage Clos network can be defined by directed graph. 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 the 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 is obtained by applying Hall theorem in proving. The conclusion of this paper about Clos network is of originality. Keywords: 4-stage Clos network, crossbar, strictly nonblocking, rearrangeably nonblocking, Hall’s theorem Introduction Switching network is a kind of fundamental connection patter widely used in telephone networks, computer networks, optical networks and satellite communication. The most common and deeply studied switching network is 3 stage Clos network [1]. One important capability standard is nonblockingness. There are three basic level nonblockingness: strictly nonblocking, widesense nonblocking, rearrangeably nonblocking [2]. The sufficient and necessary conditions of 3-stage Clos network of strictly nonblocking and rearrangeably nonblocking have been obtained in paper [15]. This paper will give the sufficient and necessary condit