View in EDS HTML Full Text PDF Full Text

A stochastic link-fault-tolerant routing algorithm in folded hypercubes.

Saved in:
Bibliographic Details
Title: A stochastic link-fault-tolerant routing algorithm in folded hypercubes.
Authors: Thuan, Bui Thi1, Ngoc, Lam Boi1, Kaneko, Keiichi1
Source: Journal of Supercomputing. Oct2018, Vol. 74 Issue 10, p5539-5557. 19p.
Subjects: Routing algorithms, Hypercube networks (Computer networks), Fault-tolerant computing, Routing (Computer network management), Stochastic processes
Abstract: A folded hypercube is obtained by adding complementary links to a hypercube. The diameter of the folded hypercube is almost half of that of the hypercube, while its degree is larger than the degree of the hypercube by only one. In this paper, we propose a stochastic link-fault-tolerant routing algorithm in a folded hypercube by introducing a limited global information called routing probabilities. For an n-dimensional folded hypercube, we have proved that the routing probabilities for all distances can be calculated in O(n2logn) time at each node and the message can be forwarded to its neighbor node at each node in O(n) time. We also conducted a computer experiment, the results of which show that our algorithm achieves a better performance than the best algorithm for a hypercube. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 132272318
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A stochastic link-fault-tolerant routing algorithm in folded hypercubes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Thuan%2C+Bui+Thi%22">Thuan, Bui Thi</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Ngoc%2C+Lam+Boi%22">Ngoc, Lam Boi</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Kaneko%2C+Keiichi%22">Kaneko, Keiichi</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Oct2018, Vol. 74 Issue 10, p5539-5557. 19p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Routing+algorithms%22">Routing algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Hypercube+networks+%28Computer+networks%29%22">Hypercube networks (Computer networks)</searchLink><br /><searchLink fieldCode="DE" term="%22Fault-tolerant+computing%22">Fault-tolerant computing</searchLink><br /><searchLink fieldCode="DE" term="%22Routing+%28Computer+network+management%29%22">Routing (Computer network management)</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+processes%22">Stochastic processes</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A folded hypercube is obtained by adding complementary links to a hypercube. The diameter of the folded hypercube is almost half of that of the hypercube, while its degree is larger than the degree of the hypercube by only one. In this paper, we propose a stochastic link-fault-tolerant routing algorithm in a folded hypercube by introducing a limited global information called routing probabilities. For an n-dimensional folded hypercube, we have proved that the routing probabilities for all distances can be calculated in O(n2logn) time at each node and the message can be forwarded to its neighbor node at each node in O(n) time. We also conducted a computer experiment, the results of which show that our algorithm achieves a better performance than the best algorithm for a hypercube. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=132272318
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-018-2456-9
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 5539
    Subjects:
      – SubjectFull: Routing algorithms
        Type: general
      – SubjectFull: Hypercube networks (Computer networks)
        Type: general
      – SubjectFull: Fault-tolerant computing
        Type: general
      – SubjectFull: Routing (Computer network management)
        Type: general
      – SubjectFull: Stochastic processes
        Type: general
    Titles:
      – TitleFull: A stochastic link-fault-tolerant routing algorithm in folded hypercubes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Thuan, Bui Thi
      – PersonEntity:
          Name:
            NameFull: Ngoc, Lam Boi
      – PersonEntity:
          Name:
            NameFull: Kaneko, Keiichi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 74
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1