• DocumentCode
    2298875
  • Title

    Are 2*-trees interesting topologies for the interconnection of a network?

  • Author

    Kant, Mariana

  • Author_Institution
    Fac. des Sci., Moncton Univ., NB, Canada
  • fYear
    1997
  • fDate
    10-13 Dec 1997
  • Firstpage
    534
  • Lastpage
    539
  • Abstract
    In this paper, we explore in detail some properties of 2*-trees. A 2*-tree is a connected graph with N nodes, diameter log2N, and degree of nodes 10. We propose routing algorithms for the unicasting, the broadcasting and the gossiping on a 2*-tree network. The routing algorithms we present have their time and communication complexities lower than the corresponding complexities for the routing on Hn, i.e., the hypercube of dimension n=log2N. Consequently, we think that a 2*-tree is an interesting topology to be considered for a network of processors
  • Keywords
    communication complexity; computational complexity; multiprocessor interconnection networks; telecommunication network routing; 2*-trees; communication complexity; connected graph; gossiping; routing algorithms; time complexity; unicasting; Broadcasting; Complexity theory; Delay; Disruption tolerant networking; Distributed computing; Distributed databases; Hypercubes; Network topology; Routing; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    0-8186-8227-2
  • Type

    conf

  • DOI
    10.1109/ICPADS.1997.652596
  • Filename
    652596
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2298875