Skip to main content
SpringerLink
Log in

New solutions for disjoint paths in P systems

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

We propose four fast synchronous distributed message-based algorithms, to identify maximum cardinality sets of edge- and node-disjoint paths, between a source node and a target node in a digraph. Previously, Dinneen et al. presented two algorithms, based on the classical distributed depth-first search (DFS), which run in O(mf) steps, where m is the number of edges and f is the number of disjoint paths. Combining Cidon’s distributed DFS and our new result, Theorem 3, we propose two improved DFS-based algorithms, which run in O(nf) steps, where n is the number of nodes. We also present improved versions of our two breadth-first search (BFS) based algorithms, with the same complexity upperbound, O(nf). Empirically, for a large set of randomly generated digraphs, our DFS-based edge-disjoint algorithm is 39 % faster than Dinneen et al.’s edge-disjoint algorithm and our BFS-based edge-disjoint algorithm is 80 % faster. All these improved algorithms have been inspired and guided by a P system modelling exercise, but are suitable for any distributed implementation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Aggarwal A, Kleinberg J, Williamson DP (2000) Node-disjoint paths on the mesh and a new trade-off in VLSI layout. SIAM J Comput 29(4):1321–1333

    Article  MathSciNet  MATH  Google Scholar 

  • Bălănescu T, Nicolescu R, Wu H (2011) Asynchronous P systems. Int J Nat Comput Res 2(2):1–18

    Article  Google Scholar 

  • Cidon I (1988) Yet another distributed depth-first-search algorithm. Inf Process Lett 26:301–305

    Article  Google Scholar 

  • Cormen TH, Stein C, Rivest RL, Leiserson CE (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge

    MATH  Google Scholar 

  • Dinneen MJ, Kim YB, Nicolescu R (2010a) Edge- and vertex-disjoint paths in P modules. In: Ciobanu G, Koutny M (eds) Workshop on membrane computing and biologically inspired process calculi, pp 117–136

  • Dinneen MJ, Kim YB, Nicolescu R (2010b) A faster P solution for the Byzantine agreement problem. In: Gheorghe M, Hinze T, Păun G (eds) Conference on membrane computing, Lecture Notes in Computer Science, vol 6501. Springer, Berlin, pp 175–197

  • Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248–264

    Article  MATH  Google Scholar 

  • Eichmann A, Makinen T, Alitalo K (2005) Neural guidance molecules regulate vascular remodeling and vessel navigation. Genes Dev 19:1013–1021

    Article  Google Scholar 

  • Ford LR Jr., Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404

    Article  MathSciNet  MATH  Google Scholar 

  • Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networkX. In: Varoquaux G, Vaught T, Millman J (eds) 7th Python in science conference (SciPy), pp 11–15

  • Kozen DC (1991) The design and analysis of algorithms. Springer, New York

    MATH  Google Scholar 

  • Lee YO, Reddy AN (2012) Constructing disjoint paths for failure recovery and multipath routing. Comput Netw 56(2):719–730

    Article  Google Scholar 

  • Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers Inc., San Francisco

    MATH  Google Scholar 

  • Nicolescu R (2011) Parallel and distributed algorithms in P systems. pp 33–42

  • Nicolescu R, Wu H (2011) BFS solution for disjoint paths in P systems. In: Calude C, Kari J, Petre I, Rozenberg G (eds) Unconventional computation, Lecture Notes in Computer Science, vol 6714. Springer, Berlin, pp 164–176

    Google Scholar 

  • Nicolescu R, Wu H (2012) New solutions for disjoint paths in P systems. Report CDMTCS-417, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand

  • Păun G (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143

    Article  MATH  Google Scholar 

  • Păun G, Rozenberg G, Salomaa A (2010) The Oxford handbook of membrane computing. Oxford University Press Inc., New York

    MATH  Google Scholar 

  • Seo D, Thottethodi M (2009) Disjoint-path routing: efficient communication for streaming applications. In: IPDPS, IEEE, pp 1–12

  • Tel G (2000) Introduction to distributed algorithms. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Wikipedia (2011) Multipath routing—Wikipedia, the free encyclopedia. http://en.wikipedia.org/wiki/Multipath_routing. Accessed 14 Dec 2011

Download references

Acknowledgments

The authors wish to thank Tudor Balanescu, Michael J. Dinneen, Hossam ElGindy, Yun-Bum Kim, John Morris and Sharvin Ragavan, for valuable comments and feedback, and the assistance received via the University of Auckland FRDF Grant 9843/3626216.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Radu Nicolescu & Huiling Wu

Authors
  1. Radu Nicolescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huiling Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huiling Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nicolescu, R., Wu, H. New solutions for disjoint paths in P systems. Nat Comput 11, 637–651 (2012). https://doi.org/10.1007/s11047-012-9342-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-012-9342-9

Keywords

Search

Navigation