• DocumentCode
    1700985
  • Title

    The Forwarding Indices of Enhanced Hypercube Networks

  • Author

    Liu, Changqing ; Liu, Hongmei

  • Author_Institution
    Coll. of Sci., Three Gorges Univ., Yichang, China
  • fYear
    2010
  • Firstpage
    116
  • Lastpage
    118
  • Abstract
    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 a 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.
  • Keywords
    graph theory; hypercube networks; connected graph; edge forwarding index; enhanced hypercube network; network model; Educational institutions; Electronic mail; Hypercubes; Indexes; Mathematics; Routing; Cayley graph; edge forwarding index; enhanced hypercube; vertex forwarding index;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia Information Networking and Security (MINES), 2010 International Conference on
  • Conference_Location
    Nanjing, Jiangsu
  • Print_ISBN
    978-1-4244-8626-7
  • Electronic_ISBN
    978-0-7695-4258-4
  • Type

    conf

  • DOI
    10.1109/MINES.2010.32
  • Filename
    5670929