Skip to main content
SpringerLink
Log in

A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6831))

Abstract

Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is tractable in several types of sparse graphs. The ring-tree graph is such a kind of sparse graph that not only has the capability of failure tolerance but also holds an underlying tree topology which facilitates network administration. In this paper, we are concerned with unreliable general ring-tree graphs in which each edge has an independent operational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ball, M.O., Lin, F.L.: A Reliability Model Applied to Emergency Service Vehicle Location. Oper. Res. 41(1), 18–36 (1993)

    Article  MATH  Google Scholar 

  2. Ball, M.O., Provan, J.S., Shier, D.R.: Reliability Covering Problems. Networks 21(3), 345–357 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. Macmillan, London (1976)

    Book  MATH  Google Scholar 

  4. Censor, Y., Gordon, D., Gordon, R.: Component Averaging: an Efficient Iterative Parallel Algorithm for Large and Sparse Unstructured Problems. Parallel Computing 27(6), 777–808 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)

    Google Scholar 

  6. Colbourn, C.J., Xue, G.: A Linear Time Algorithms for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci. 209, 331–345 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, W.: Computing the Most Reliable Source on Stochastic Ring Networks. In: 2009 WRI World Congress on Software Engineering, Xiamen, China, May 19–21, vol. 1, pp. 345–347 (2009)

    Google Scholar 

  8. Ding, W.: Embedded-Rings-Based Survivable Networks. In: 2010 International Conference on Industrial and Information Systems, Dalian, China, July 10–11, vol. 2, pp. 412–415 (2010)

    Google Scholar 

  9. Ding, W., Xue, G.: A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 268–280. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Ding, W., Xue, G.: A Linear Time Algorithm for Computing a Most Reliable Source on a Tree Network with Faulty Nodes. Theor. Comput. Sci. 412, 225–232 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eiselt, H.A., Gendreau, M., Laporte, G.: Location of Facilities on a Network Subject to a Single-Edge Failure. Networks 22(3), 231–246 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. In: Proceedings of the seventeenth annual ACM symposium on Theory of computing (STOC 1985), Toronto, Canada, pp. 1–10 (1985)

    Google Scholar 

  13. Melachrinoudis, E., Helander, M.E.: A Single Facility Location Problem on a Tree with Unreliable Edges. Networks 27(3), 219–237 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mirchandani, P.B., Odoni, A.R.: Locations of Medians on Stochastic Networks. Transport. Sci. 13, 85–97 (1979)

    Article  MathSciNet  Google Scholar 

  15. Nel, L.D., Colbourn, C.J.: Locating a Broadcast Facility in an Unreliable Network. INFOR 28, 363–379 (1990)

    MATH  Google Scholar 

  16. Pardalos, P.M., Xue, G., Panagiotopoulos, P.D.: Parallel Algorithms for Global Optimization Problems. In: Ferreira, A., Pardalos, P.M. (eds.) SCOOP 1995. LNCS, vol. 1054, pp. 232–247. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  17. Shier, D.R.: Network Reliability and Algebraic Structure. Oxford University Press, New York (1991)

    MATH  Google Scholar 

  18. Sun, X.H., Rover, D.T.: Scalability of Parallel Algorithm-Machine Combinations. IEEE Transactions on Parallel and Distributed Systtem 5(6), 599–613 (1994)

    Article  Google Scholar 

  19. Xue, G.: Linear Time Algorithms for Computing the Most Reliable Source on an Unreliable Tree Network. Networks 30(1), 37–45 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhang, T.Y., Suen, C.Y.: A Fast Parallel Algorithm for Thinning Digital Patterns. Communications of the ACM 27(3), 236–239 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang, 310000, China

    Wei Ding

  2. Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, 85287-8809, USA

    Guoliang Xue

Authors
  1. Wei Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guoliang Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, 688 Yingbin Road, 321004, Jinhua, Zhejiang Province, China

    Weifan Wang  & Xuding Zhu  & 

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, W., Xue, G. (2011). A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22616-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22615-1

  • Online ISBN: 978-3-642-22616-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation