Equivalent nondegenerate L-shapes of double-loop networks

被引:0
|
作者
Chen, CY [1 ]
Hwang, FK [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu 300, Taiwan
关键词
double-loop network; L-shape; diameter; Euclidean algorithm;
D O I
10.1002/1097-0037(200009)36:2<118::AID-NET7>3.3.CO;2-T
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Double-loop networks have been widely studied as architecture for local area networks. The L-shape is an important tool for studying the distance properties of double-loop networks. Two L-shapes are equivalent if the numbers of nodes k steps away from the origin are the same for every k, Hwang and Xu first studied equivalent L-shapes through a geometric operation called 3-rectangle transformation. Fiol et al. proposed three equivalent transformations. Rodseth gave an algebraic operation, which was found by Huang et al, to correspond to 3-rectangle transformations, In this paper, we show that all equivalent nondegenerate L-shapes are determined by four basic geometric operations. We also discuss the algebraic operations corresponding to these geometric operations. (C) 2000 John Wiley & Sons, Inc.
引用
收藏
页码:118 / 125
页数:8
相关论文
共 50 条
  • [21] AN EFFICIENT ALGORITHM TO FIND OPTIMAL DOUBLE-LOOP NETWORKS
    AGUILO, F
    FIOL, MA
    DISCRETE MATHEMATICS, 1995, 138 (1-3) : 15 - 29
  • [22] MOST RELIABLE DOUBLE-LOOP NETWORKS IN SURVIVAL RELIABILITY
    HU, XD
    HWANG, FK
    LI, WCW
    NETWORKS, 1993, 23 (05) : 451 - 458
  • [23] Some infinite families of optimal double-loop networks
    Wang, Xiaolin
    Zhou, Jianqin
    Dai, Xiaoping
    2007 International Symposium on Computer Science & Technology, Proceedings, 2007, : 52 - 56
  • [24] An optimal message routing algorithm for double-loop networks
    Guan, DJ
    INFORMATION PROCESSING LETTERS, 1998, 65 (05) : 255 - 260
  • [25] Separating bichromatic point sets by L-shapes
    Sheikhi, Farnaz
    Mohades, Ali
    de Berg, Mark
    Davoodi, Mansoor
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 673 - 687
  • [26] MINIMAL DIAMETER DOUBLE-LOOP NETWORKS - DENSE OPTIMAL FAMILIES
    BERMOND, JC
    TZVIELI, D
    NETWORKS, 1991, 21 (01) : 1 - 9
  • [27] Embedding connected double-loop networks with even cardinality in books
    Yang, Weihua
    Meng, Jixiang
    APPLIED MATHEMATICS LETTERS, 2009, 22 (09) : 1458 - 1461
  • [28] TOLERANCE OF DOUBLE-LOOP COMPUTER-NETWORKS TO MULTINODE FAILURES
    MASUYAMA, H
    ICHIMORI, T
    IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (05) : 738 - 741
  • [29] The minimum distance diagram and diameter of undirected double-loop networks
    Li, Ying
    Chen, Yebin
    Tai, Weipeng
    Wang, Renwei
    PROCEEDINGS OF THE 2016 3RD INTERNATIONAL CONFERENCE ON MATERIALS ENGINEERING, MANUFACTURING TECHNOLOGY AND CONTROL, 2016, 67 : 1682 - 1687
  • [30] Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks
    Hui, Liu
    Wang, Shengling
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2019, 2019, 11604 : 587 - 595