Skip to main content

Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams

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


Various network systems such as communication networks require survivability that is tolerance of attacks, failures, and accidents. Designing a network with high survivability is formulated as a survivable network design problem (SNDP). The input of the SNDP is a pair of an edge-weighted graph and a requirement of topology and survivability. For an edge subset of the graph, if it satisfies the requirement, we call it a desired edge subset (DES). The output of the SNDP is the minimum weight DES. Although the SNDP is an optimization problem, to simply solve it is not always desired in terms of the practical use: Designers sometimes want to test multiple DESs including non-optimal DESs, because the theoretical optimal DES is not always the practical best.

In this paper, instead of the optimization, we propose a method to enumerate all DESs with a compact data structure, called the zero-suppressed binary decision diagram (ZDD). Obtained ZDDs support practical network design by performing optimization, sampling, and filtering of DESs. The proposed method combines two typical techniques constructing ZDDs, called the frontier-based search (FBS) and the family algebra, and includes a novel operation on ZDDs. We demonstrate that our method works on various real-world instances of practical scales.


  • Network design
  • Survivable network
  • Decision diagram

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-39881-1_23
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-39881-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.


  1. 1.

    Although our approach can handle both directed and undirected graphs, we describe only the undirected version (i.e., \(E \subseteq \{\{u,v\} \mid u,v \in V\}\)) in this paper.


  1. Ellison, R., Linger, R., Longstaff, T., Mead, N.: Survivable network system analysis: a case study. IEEE Software 16, 70–77 (1999)

    CrossRef  Google Scholar 

  2. Kerivin, H., Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46(1), 1–21 (2005)

    CrossRef  MathSciNet  Google Scholar 

  3. Akgün, I.: New formulations for the hop-constrained minimum spanning tree problem via sherali and driscoll’s tightened miller-tucker-zemlin constraints. Comput. Oper. Res. 38(1), 277–286 (2011)

    CrossRef  MathSciNet  Google Scholar 

  4. Diarrassouba, I., Gabrel, V., Ridha Mahjoub, A., Gouveia, L., Pesneau, P.: Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67, 148–169 (2015)

    CrossRef  MathSciNet  Google Scholar 

  5. Fortz, B.: Design of survivable networks with bounded rings. In: Network Theory and Applications (2000)

    Google Scholar 

  6. Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math. Program. 128(1), 123–148 (2011)

    CrossRef  MathSciNet  Google Scholar 

  7. Rodriguez-Martin, I., Salazar Gonzlez, J.J., Yaman, H.: The ring/\(\kappa \)-rings network design problem: model and branch-and-cut algorithm. Networks 68, 130–140 (2016)

    CrossRef  MathSciNet  Google Scholar 

  8. Penttinen, A.: Chapter 10 - Network planning and dimensioning. Lecture Notes: S-38.145 - Introduction to Teletraffic Theory. Helsinki University of Technology (1999)

    Google Scholar 

  9. Minato, S.: Zero-suppressed BDDS for set manipulation in combinatorial problems. In: DAC, pp. 272–277 (1993)

    Google Scholar 

  10. Knuth, D.E.: The Art of Computer Programming: Bitwise tricks & Techniques. Binary Decision Diagrams, vol. 4, fascicle 1. Addison-Wesley Professional, Boston (2009)

    Google Scholar 

  11. Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans. Fundam. E100–A(9), 1773–1784 (2017)

    CrossRef  Google Scholar 

  12. Coudert, O.: Solving graph optimization problems with ZBDDS. In: Proceedings of the 1997 European Conference on Design and Test, EDTC 1997, p. 224 (1997)

    Google Scholar 

  13. Kawahara, J., Horiyama, T., Hotta, K., Minato, S.I.: Generating all patterns of graph partitions within a disparity bound. In: WALCOM: Algorithms and Computation, pp. 119–131 (2017)

    CrossRef  Google Scholar 

  14. Kawahara, J., Saitoh, T., Suzuki, H., Yoshinaka, R.: Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs. In: Phon-Amnuaisuk, S., Au, T.-W., Omar, S. (eds.) CIIS 2016. AISC, vol. 532, pp. 294–305. Springer, Cham (2017).

    CrossRef  Google Scholar 

  15. Minato, S., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient boolean function manipulation. In: 27th ACM/IEEE Design Automation Conference, pp. 52–57 (1990)

    Google Scholar 

  16. Amarilli, A., Bourhis, P., Jachiet, L., Mengel, S.: A circuit-based approach to efficient enumeration. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), vol. 80, pp. 111:1–111:15 (2017)

    Google Scholar 

  17. Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Ichi-Minato, S.: Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112, 636–640 (2012)

    CrossRef  MathSciNet  Google Scholar 

Download references


This work was supported by JSPS KAKENHI Grant Number 15H05711.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Hirofumi Suzuki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Suzuki, H., Ishihata, M., Minato, Si. (2020). Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. In: Rahman, M., Sadakane, K., Sung, WK. (eds) WALCOM: Algorithms and Computation. WALCOM 2020. Lecture Notes in Computer Science(), vol 12049. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-39880-4

  • Online ISBN: 978-3-030-39881-1

  • eBook Packages: Computer ScienceComputer Science (R0)