IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i5d10.1007_s10878-025-01315-1.html
   My bibliography  Save this article

Further combinatorial analysis of substar reliability in star networks

Author

Listed:
  • Hao Li

    (Xinjiang University)

  • Eminjan Sabir

    (Xinjiang University)

Abstract

Substar reliability defined as the probability that a fault-free substar of a certain scale is still available in the star network $$S_n$$ S n when the occurrence of faults. The substar reliability is one of the most practical reliability measures because a user in the current star multiprocessors is given a certain substar for the execution of his/her program. Wu and Latifi(Inf. Sci. 178 (2008)) derived upper-bound on the substar reliability of $$S_n$$ S n by analysing the intersection of no more than three substars. Later, Li et al.(IEEE. Trans. Rel. 65 (2016)) derived lower-bound on the substar reliability of $$S_n$$ S n by considering the intersection of no more than four substars. In the paper, we further derive the upper- and lower bounds on the substar reliability of $$S_n$$ S n by taking into account the intersection of no more than five or four substars, respectively. At a result, we obtain more accurate value of the upper-bound on substar reliability of $$S_n$$ S n . The experimental study indicates that both the upper- and lower bounds are very close to approximate results especially for the low value of the node reliability.

Suggested Citation

  • Hao Li & Eminjan Sabir, 2025. "Further combinatorial analysis of substar reliability in star networks," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-28, July.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01315-1
    DOI: 10.1007/s10878-025-01315-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01315-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01315-1?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.

    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:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01315-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.