Efficiency and reliable routing can be achieved by using internally nodedisjoint paths （disjoint path for short） because they can be used to avoid congestion, accelerate the transmission rate, and provide alternativ...Efficiency and reliable routing can be achieved by using internally nodedisjoint paths （disjoint path for short） because they can be used to avoid congestion, accelerate the transmission rate, and provide alternative transmission routes. It is well known that there are n disjoint paths connecting any two nodes in an n-dimensional hypercube （n-cube for short）. In order to enhance the performance and reliability, several variants of n-cube networks have been proposed. The enhanced hypercube networks （denoted by Qn,k） is one of these variation. In this paper, its structural natures are obtained in detail and its properties and performance have been analyzed. The minimum transmission delay of enhanced hypercube Qn,k has been proved equal to k ＋q┌n-k＋1/2┐.The one-to-one routing process is also concerned, this paper also proves that＇ thereexists n ＋ 1 internally-disjoint paths between any two distinct nodes in Qn,k for k = 2. It follows that its connectivity and edge-connectivity are n ＋ 1.展开更多
基金This project is supported by National Natural Science Foundation of China （10671081） the Science Foundation of Hubei Province （2006AA412C27）
文摘Efficiency and reliable routing can be achieved by using internally nodedisjoint paths （disjoint path for short） because they can be used to avoid congestion, accelerate the transmission rate, and provide alternative transmission routes. It is well known that there are n disjoint paths connecting any two nodes in an n-dimensional hypercube （n-cube for short）. In order to enhance the performance and reliability, several variants of n-cube networks have been proposed. The enhanced hypercube networks （denoted by Qn,k） is one of these variation. In this paper, its structural natures are obtained in detail and its properties and performance have been analyzed. The minimum transmission delay of enhanced hypercube Qn,k has been proved equal to k ＋q┌n-k＋1/2┐.The one-to-one routing process is also concerned, this paper also proves that＇ thereexists n ＋ 1 internally-disjoint paths between any two distinct nodes in Qn,k for k = 2. It follows that its connectivity and edge-connectivity are n ＋ 1.
