View in EDS PDF Full Text

Edge-disjoint node-independent spanning trees in dense Gaussian networks.

Saved in:
Bibliographic Details
Title: Edge-disjoint node-independent spanning trees in dense Gaussian networks.
Authors: AlBdaiwi, Bader1 bdaiwi@cs.ku.edu.kw, Hussain, Zaid1 zhussain@cs.ku.edu.kw, Cerny, Anton2 anton.cerny@ku.edu.kw, Aldred, Robert3 raldred@maths.otago.ac.nz
Source: Journal of Supercomputing. Dec2016, Vol. 72 Issue 12, p4718-4736. 19p.
Subjects: Fault-tolerant computing, Computer reliability, Telecommunication, Electric network topology, Routing (Computer network management)
Abstract: Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. Dense Gaussian networks are potential alternatives for two-dimensional tori. They have similar topological properties; however, they are superiors in carrying communications due to their node-distance distributions and smaller diameters. No result on fault-tolerant communications in Gaussian networks exists in the literature. In this paper, we present constructions of edge-disjoint node-independent spanning trees in dense Gaussian networks. Based on the constructed trees, we design novel fault-tolerant communication algorithms that could be used in fault-tolerant routing, broadcasting, or secure message distribution. [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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 119356708
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Edge-disjoint node-independent spanning trees in dense Gaussian networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22AlBdaiwi%2C+Bader%22">AlBdaiwi, Bader</searchLink><relatesTo>1</relatesTo><i> bdaiwi@cs.ku.edu.kw</i><br /><searchLink fieldCode="AR" term="%22Hussain%2C+Zaid%22">Hussain, Zaid</searchLink><relatesTo>1</relatesTo><i> zhussain@cs.ku.edu.kw</i><br /><searchLink fieldCode="AR" term="%22Cerny%2C+Anton%22">Cerny, Anton</searchLink><relatesTo>2</relatesTo><i> anton.cerny@ku.edu.kw</i><br /><searchLink fieldCode="AR" term="%22Aldred%2C+Robert%22">Aldred, Robert</searchLink><relatesTo>3</relatesTo><i> raldred@maths.otago.ac.nz</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Dec2016, Vol. 72 Issue 12, p4718-4736. 19p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Fault-tolerant+computing%22">Fault-tolerant computing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+reliability%22">Computer reliability</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication%22">Telecommunication</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+network+topology%22">Electric network topology</searchLink><br /><searchLink fieldCode="DE" term="%22Routing+%28Computer+network+management%29%22">Routing (Computer network management)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. Dense Gaussian networks are potential alternatives for two-dimensional tori. They have similar topological properties; however, they are superiors in carrying communications due to their node-distance distributions and smaller diameters. No result on fault-tolerant communications in Gaussian networks exists in the literature. In this paper, we present constructions of edge-disjoint node-independent spanning trees in dense Gaussian networks. Based on the constructed trees, we design novel fault-tolerant communication algorithms that could be used in fault-tolerant routing, broadcasting, or secure message distribution. [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=119356708
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-016-1768-x
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 4718
    Subjects:
      – SubjectFull: Fault-tolerant computing
        Type: general
      – SubjectFull: Computer reliability
        Type: general
      – SubjectFull: Telecommunication
        Type: general
      – SubjectFull: Electric network topology
        Type: general
      – SubjectFull: Routing (Computer network management)
        Type: general
    Titles:
      – TitleFull: Edge-disjoint node-independent spanning trees in dense Gaussian networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: AlBdaiwi, Bader
      – PersonEntity:
          Name:
            NameFull: Hussain, Zaid
      – PersonEntity:
          Name:
            NameFull: Cerny, Anton
      – PersonEntity:
          Name:
            NameFull: Aldred, Robert
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 72
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1