Forwarding index of cube-connected cycles

被引：5

作者：

Yan, Jun ^{[2
]}

Xu, Jun-Ming ^{[1
]}

Yang, Chao ^{[1
]}

机构：

[1] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China

[2] Univ Sci & Technol China, Dept Comp Sci, Hefei 230027, Anhui, Peoples R China

来源：

DISCRETE APPLIED MATHEMATICS | 2009年 / 157卷 / 01期

关键词：

Routings; Forwarding index; Cube-connected cycle; INTERCONNECTION NETWORKS; COMMUNICATION-NETWORKS; GRAPHS;

D O I：

10.1016/j.dam.2008.04.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For a given connected graph G of order v, a routing R in G is a set of v(v - 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) for-warding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Shahrokhi and Szekely [F. Shahrokhi, L.A. Szekely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175-191] obtained an asymptotic formula for the edge forwarding index of n-dimensional cube-connected cycle CCCn as 5/4 n(2)2(n) (1 - o(1)). This paper determines the vertex forwarding index of CCCn as 7/4 n(2)2(n) (1 - o (1)) asymptotically. (c) 2008 Elsevier B.V. All rights reserved.

引用

页码：1 / 7

页数：7

共 50 条

[1] Cycles in the cube-connected cycles graph
Germa, A
Heydemann, MC
Sotteau, D
DISCRETE APPLIED MATHEMATICS, 1998, 83 (1-3) : 135 - 155
[2] Cycles in cube-connected cycles graphs
Hsu, Lih-Hsing
Ho, Tung-Yang
Ho, Yen-Hsun
Tsay, Chey-Woei
DISCRETE APPLIED MATHEMATICS, 2014, 167 : 163 - 171
[3] INFINITE CUBE-CONNECTED CYCLES
HEIDE, FMAD
INFORMATION PROCESSING LETTERS, 1983, 16 (01) : 1 - 2
[4] On the pagenumber of the cube-connected cycles
Tanaka Y.
Shibata Y.
Mathematics in Computer Science, 2010, 3 (1) : 109 - 117
[5] UNIDIRECTIONAL CUBE-CONNECTED CYCLES
BHATTACHARYA, S
CHOI, YH
TSAI, WT
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1993, 140 (04): : 191 - 195
[6] MULTISCATTERING ON THE CUBE-CONNECTED CYCLES
LI, JJ
PARALLEL COMPUTING, 1994, 20 (03) : 313 - 324
[7] The diameter of the cube-connected cycles
Fris, I
Havel, I
Liebl, P
INFORMATION PROCESSING LETTERS, 1997, 61 (03) : 157 - 160
[8] A tight layout of the cube-connected cycles
Chen, GH
Lau, FCM
FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, : 422 - 427
[9] RECONFIGURABLE CUBE-CONNECTED CYCLES ARCHITECTURES
KUO, SY
FUCHS, WK
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1990, 9 (01) : 1 - 10
[10] Matching preclusion for cube-connected cycles
Li, Qiuli
Shiu, Wai Chee
Yao, Haiyuan
DISCRETE APPLIED MATHEMATICS, 2015, 190 : 118 - 126

← 1 2 3 4 5 →