The Average Packet Latency and Fault Tolerant Routing Algorithm for Generalized-Star Crossed Cube

DOI IR (HANDLE)

Bibliographic Information

Other Title
  • Generalized Star Crossed Cubeにおける平均パケットレイテンシと耐故障経路探索アルゴリズム

Search this article

Description

In the previous research, we proposed a Generalized-Star Crossed Cube (GSCC) interconnection network, which focuses on the cost reduction and flexibility in network size. In this research, we discuss the topological properties of GSCC, examine the average packet latency, and propose a fault tolerant routing algorithm. Average packet latency is the time a packet travels from the source node to the destination node. Multiple nodes send packets simultaneously, and there are conflicts on the paths. The fault tolerant routing algorithm tries to find a routing path in the system where some nodes and links may be faulty. As a result, the average packet latency for GSCC is better than hypercube and (n, k)-Star Graph when traffic load is low, and the proposed fault tolerant routing algorithm achieves 30 percent better performance than the shortest path routing algorithm.

Journal

Details 詳細情報について

  • CRID
    1390853649755015168
  • NII Article ID
    120006714916
  • NII Book ID
    AA12746425
  • DOI
    10.15002/00021940
  • HANDLE
    10114/00021940
  • ISSN
    24321192
  • Text Lang
    ja
  • Article Type
    departmental bulletin paper
  • Data Source
    • JaLC
    • IRDB
    • CiNii Articles
  • Abstract License Flag
    Allowed

Report a problem

Back to top