IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v362y2019ic50.html
   My bibliography  Save this article

Constructing dual-CISTs of DCell data center networks

Author

Listed:
  • Qin, Xiao-Wen
  • Chang, Jou-Ming
  • Hao, Rong-Xia

Abstract

The k-dimensional data center network with n port switches, denoted by Dk,n, has been proposed as a structure of the server-centric network and it was required to have a high reliability on data transmission. A set of t spanning trees in a graph G are called completely independent spanning trees (CISTs for short) if for every pair of nodes x, y ∈ V(G), the paths joining x and y in any two trees have neither node nor edge in common, except for x and y. In particular, if t=2, the two CISTs are called a dual-CIST. Although it has been proved that determining if a graph G admits t CISTs is an NP-complete problem even for t=2, the construction of multiple CISTs on the underlying graph of a network has applications in the fault-tolerance of data transmission. In this paper, we provide a recursive construction for building a dual-CIST on Dk,n for k ≥ 0 and n ≥ 6.

Suggested Citation

  • Qin, Xiao-Wen & Chang, Jou-Ming & Hao, Rong-Xia, 2019. "Constructing dual-CISTs of DCell data center networks," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    • Handle: RePEc:eee:apmaco:v:362:y:2019:i:c:50
    DOI: 10.1016/j.amc.2019.06.060
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319305296
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.06.060?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Jinn-Shyong & Li, Xiao-Yan & Peng, Sheng-Lung & Chang, Jou-Ming, 2022. "Parallel construction of multiple independent spanning trees on highly scalable datacenter networks," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    2. Yu-Han Chen & Kung-Jui Pai & Hsin-Jung Lin & Jou-Ming Chang, 2022. "Constructing tri-CISTs in shuffle-cubes," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3194-3211, December.
    3. Qin, Xiao-Wen & Hao, Rong-Xia, 2021. "Reliability analysis based on the dual-CIST in shuffle-cubes," Applied Mathematics and Computation, Elsevier, vol. 397(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:362:y:2019:i:c:50. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.