Routing

  • Oliver Keszocze
  • Robert Wille
  • Rolf Drechsler
Chapter

Abstract

When performing experiments on a biochip it is essential to have the liquids ready at certain positions at given points in time in order to utilize them. For this purpose, the biochip must perform its most fundamental and essential operation: droplet movement. For the correct movements, it is necessary to know where and when to move each droplet of liquid. The routing problem is how to determine such routes for all the droplets in order to conduct the given experiment. The problem not just consists of determining such routes but also minimizing the length of the routes. In this chapter, the NP-completeness of the routing problem is proven and an exact solution is proposed. This chapter briefly introduces the DMFB routing problem in Sect. 3.1. In Sect. 3.2, the NP-completeness of the problem is proven. After a short related work discussion in Sect. 3.3, an exact methodology for solving the DMFB routing problem is presented in Sect. 3.4. The proposed method is evaluated on a commonly used set of benchmarks in Sect. 3.5.

References

  1. [Böh04]
    Böhringer KF (2004) Towards optimal strategies for moving droplets in digital microfluidic systems. In: International conference on robotics and automation, pp 1468–1474Google Scholar
  2. [CP08]
    Cho M, Pan DZ (2008) A high-performance droplet routing algorithm for digital microfluidic biochips. IEEE Trans Comput Aided Des Integr Circuits Syst 27(10):1714–1724Google Scholar
  3. [DB08]
    De Moura L, Bjørner N (2008) Z3: an efficient SMT solver. In: Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 337–340. Z3 is available at https://github.com/Z3Prover/z3
  4. [GJ79]
    Garey MR, Johnson DS (1979) In: Klee V (ed) Computers and intractability. Books in the mathematical sciences, vol 29. W.H. Freeman and Company, New YorkGoogle Scholar
  5. [HH09]
    Huang T-W, Ho T-Y (2009) A fast routability and performance-driven droplet routing algorithm for digital microfluidic biochips. International conference on computer design, pp 445–450Google Scholar
  6. [KWD14]
    Keszocze O, Wille R, Drechsler R (2014) Exact routing for digital microfluidic biochips with temporary blockages. In: International conference on computer aided design. ICCAD, pp 405–410Google Scholar
  7. [RW90]
    Ratner D, Warmuth M (1990) The (n 2 − 1)-puzzle and related relocation problems. J Symbol Comput 10(2):111–137MathSciNetCrossRefGoogle Scholar
  8. [Sin05]
    Sinz C (2005) Towards an optimal CNF encoding of boolean cardinality constraints. In: International conference on principles and practice of constraint programming, pp 827–831CrossRefGoogle Scholar
  9. [Sri+04]
    Srinivasan V et al (2004) Protein stamping for MALDI mass spectrometry using an electrowetting-based microfluidic platform. Optics East 5591:26–32Google Scholar
  10. [SC05]
    Su F, Chakrabarty K (2005) Unified high-level synthesis and module placement for defect-tolerant microfluidic biochips. In: Design automation conference, pp 825–830Google Scholar
  11. [SHC06]
    Su F, Hwang W, Chakrabarty K (2006) Droplet routing in the synthesis of digital microfluidic biochips. In: Design, automation and test in Europe, vol 1, pp 1–6Google Scholar
  12. [Tri69]
    Trinder P (1969) Determination of glucose in blood using glucose oxidase with an alternative oxygen acceptor. Ann Clin Biochem 6(1):24–27CrossRefGoogle Scholar
  13. [YYC08]
    Yuh P-H, Yang C-L, Chang Y-W (2008) BioRoute: a network-flow-based routing algorithm for the synthesis of digital microfluidic biochips. IEEE Trans Comput Aided Des Integr Circuits Syst 27(11):1928–1941CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Oliver Keszocze
    • 1
  • Robert Wille
    • 2
  • Rolf Drechsler
    • 1
  1. 1.University of Bremen and DFKI GmbHBremenGermany
  2. 2.Johannes Kepler University LinzLinzAustria

Personalised recommendations