The Forwarding Indices of Enhanced Hypercube Networks
The enhanced hypercube(denoted by Qn,k) is a very important network model because of its excellent properties which are superior to the corresponding properties of hypercube. For a given connected graph G of order n, a routing R is set of n(n -1) simple paths specified for each ordered pair of vertices in G. The load of a vertex(resp.edge) for a given routing R is the number of paths going through it. The vertex(resp.edge) forwarding index of the network is the minimum of the largest load taken over all routings. In this work, the authors determine the vertex and the edge forwarding indices of enhanced hypercube.
enhanced hypercube Cayley graph vertex forwarding index edge forwarding index
Changqing Liu Hongmei Liu
College of Science Three Gorges University Hubei Yichang 443002 PRC
国际会议
南京
英文
116-118
2010-11-01（万方平台首次上网日期，不代表论文的发表时间）