There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propos...There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propose a special MSSS(SMSSS) model for the first time,where all special SEs,known as basic switching modules(BSMs),are connected hierarchically into a tree profile.Unlike the existing investigations,each BSM in this model is characterized by one highrate port and several low-rate ports.This study focuses on the analysis,design and optimization of the SMSSS model.Moreover,we propose a novel BSM cost model which relates to its flux factor considered rarely in existing studies.Two examples are demonstrated to obtain the optimal structure parameters of the SMSSS system with a minimum overall cost.The comparison of the proposed SMSSS with similar fat tree structures indicates its relative advantages.展开更多
This paper proposes a new approach for implementing fast multicast on multistage interconnection networks (MINs) with multi-head worms. For an MIN with n stages of k×k switches, a single multi-head worm can cover...This paper proposes a new approach for implementing fast multicast on multistage interconnection networks (MINs) with multi-head worms. For an MIN with n stages of k×k switches, a single multi-head worm can cover an arbitrary set of destinations with a single communication start-up. Compared with schemes using unicast messages, this approach reduces multicast latency significantly and performs better than multi-destination worms.展开更多
A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags...A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.展开更多
It has long been an outstanding conjecture that any(2^(n)×2^(n))-stage shuffle exchange network(Omega net-work)is rearrangeable for 2n 62n.Many researchers have failed to prove this conjecture,including a recent ...It has long been an outstanding conjecture that any(2^(n)×2^(n))-stage shuffle exchange network(Omega net-work)is rearrangeable for 2n 62n.Many researchers have failed to prove this conjecture,including a recent one established by Hasan.However,nobody has pointed out its fallacy.Therefore,as one of the objectives,this paper shall clarify this fact.Since the case of n 53 has been proven by many researchers[1,2],this paper uses a con-structive approach to prove that when n 54,the 7-stage 16616 shuffle exchange network is also rearrangeable.The paper also presents the model of a balanced tree to avoid internal conflict,the representation of permutations using a connection graph and loop graph,and the con-cepts of symmetry graph and identical transform.Based on graphic composition and bipartition,the permutations 16×16 are divided into five classes,with five assignment algorithms proposed.These algorithms are simpler,clearer and easier to program.The techniques used for n=4 may provide hints for the general case of n>4.展开更多
基金supported by the National High-Tech Development Project (2012AA01A505)Key Issues of Terabit PTN Equipment R&D from the Ministry of Industry and Information Technology
文摘There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propose a special MSSS(SMSSS) model for the first time,where all special SEs,known as basic switching modules(BSMs),are connected hierarchically into a tree profile.Unlike the existing investigations,each BSM in this model is characterized by one highrate port and several low-rate ports.This study focuses on the analysis,design and optimization of the SMSSS model.Moreover,we propose a novel BSM cost model which relates to its flux factor considered rarely in existing studies.Two examples are demonstrated to obtain the optimal structure parameters of the SMSSS system with a minimum overall cost.The comparison of the proposed SMSSS with similar fat tree structures indicates its relative advantages.
文摘This paper proposes a new approach for implementing fast multicast on multistage interconnection networks (MINs) with multi-head worms. For an MIN with n stages of k×k switches, a single multi-head worm can cover an arbitrary set of destinations with a single communication start-up. Compared with schemes using unicast messages, this approach reduces multicast latency significantly and performs better than multi-destination worms.
基金Supported by the National High-Tech Programs(No.2002AA103062, No.2002AA121061 and No.2003AA103520) the Huawei Technologies Co. under contract number YBCN2002001.
文摘A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.
基金supported by the National Science Foundation of USA(Grant No.9810692)University of Missouri-Kansas City Faculty Research Grant(UMKC FRG)(No.K-2-11678).
文摘It has long been an outstanding conjecture that any(2^(n)×2^(n))-stage shuffle exchange network(Omega net-work)is rearrangeable for 2n 62n.Many researchers have failed to prove this conjecture,including a recent one established by Hasan.However,nobody has pointed out its fallacy.Therefore,as one of the objectives,this paper shall clarify this fact.Since the case of n 53 has been proven by many researchers[1,2],this paper uses a con-structive approach to prove that when n 54,the 7-stage 16616 shuffle exchange network is also rearrangeable.The paper also presents the model of a balanced tree to avoid internal conflict,the representation of permutations using a connection graph and loop graph,and the con-cepts of symmetry graph and identical transform.Based on graphic composition and bipartition,the permutations 16×16 are divided into five classes,with five assignment algorithms proposed.These algorithms are simpler,clearer and easier to program.The techniques used for n=4 may provide hints for the general case of n>4.
