Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Heuristics for composite Web service decentralization

  • Theme Section Paper
  • Published:
Software & Systems Modeling Aims and scope Submit manuscript

Abstract

A composite service is usually specified by means of a process model that captures control-flow and data-flow relations between activities that are bound to underlying component services. In mainstream service orchestration platforms, this process model is executed by a centralized orchestrator through which all interactions are channeled. This architecture is not optimal in terms of communication overhead and has the usual problems of a single point of failure. In previous work, we proposed a method for executing composite services in a decentralized manner. However, this and similar methods for decentralized composite service execution do not optimize the communication overhead between the services participating in the composition. This paper studies the problem of optimizing the selection of services assigned to activities in a decentralized composite service, both in terms of communication overhead and overall quality of service, and taking into account collocation and separation constraints that may exist between activities in the composite service. This optimization problem is formulated as a quadratic assignment problem. The paper puts forward a greedy algorithm to compute an initial solution as well as a tabu search heuristic to identify improved solutions. An experimental evaluation shows that the tabu search heuristic achieves significant improvements over the initial greedy solution. It is also shown that the greedy algorithm combined with the tabu search heuristic scale up to models of realistic size.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. We note that \(\forall i, j, i \ne j\), \(CA_i \cap CA_j\)={\(\emptyset \)} and \(CTR_i \cap CTR_j\)={\(\emptyset \)}.

  2. http://oryx-project.org/backend/poem/repository.

  3. http://www.zurich.ibm.com/csc/bit/downloads.html.

  4. http://code.google.com/p/bpstruct/.

References

  1. Aarts, E., Lenstra, J. (eds.): Local Search in Combinatorial Optimization. Discrete Mathematics and Optimization. Wiley, Chichester (1997)

  2. Ai, L., Tang, M., Fidge, C.J.: Partitioning composite web services for decentralized execution using a genetic algorithm. Future Gen. Comput. Syst. 27(2), 157–172 (2011)

    Article  Google Scholar 

  3. Alrifai, M., Risse, T.: Combining global optimization with local selection for efficient QoS-aware service composition. In: Proceedings of 18th International Conferences on World Wide Web, pp. 881–890. ACM, New York (2009)

  4. Beckman, M., Koopmans, T.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)

    Article  MathSciNet  Google Scholar 

  5. Benatallah, B., Dumas, M., Sheng, Q.Z.: Facilitating the rapid development and scalable orchestration of composite web services. In: Distributed and Parallel Databases (2005)

  6. Benatallah, B., Sheng, Q.Z., Dumas, M.: The self-serv environment for web services composition. IEEE Int. Comput. 7(1), 40–48 (2003)

    Article  Google Scholar 

  7. Bokhari, S.: Partitioning problems in parallel, pipeline, and distributed computing. IEEE Trans. Comput. 37(1), 48–57 (1988)

    Article  MathSciNet  Google Scholar 

  8. Burkard, R.E., Çela, E., Rote, G., Woeginger, G.J.: The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: easy and hard cases. In: IPCO, pp. 204–218 (1996)

  9. Canfora, G., Di Penta, M., Esposito, R., Villani, M.L.: A framework for QoS-aware binding and re-binding of composite web services. Syst. Softw. 81(10), 1754–1769 (2008)

    Google Scholar 

  10. Cardoso, J., Sheth, A., Miller, J., Arnold, J., Kochut, K.: Quality of service for workflows and Web service processes. Web Semantics 1(3), 281–308 (2004)

    Article  Google Scholar 

  11. Chafle, G., Chandra, S., Mann, V., Nanda, M.G.: Decentralized orchestration of composite Web services. In: WWW (Alternate Track Papers& Posters), pp. 134–143 (2004)

  12. Dumas, M., García-Ba nuelos, L., Polyvyanyy, A., Yang, Y., Zhang, L.: Aggregate quality of service computation for composite services. In: Proceedings of the 8th International Conference on Service-Oriented Computing (ICSOC), San Francisco, CA, USA, pp. 213–227, December 2010

  13. Fdhila, W., Godart, C.: Toward synchronization between decentralized orchestrations of composite web services. In: Proceedings of the 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2009, Washington DC, USA, pp. 1–10. IEEE, Nov 2009

  14. Fdhila, W., Yildiz, U., Godart, C.: A flexible approach for automatic process decentralization using dependency tables. In: ICWS ’09: Proceedings of the 2009 IEEE International Conference on Web Services, pp. 847–855, Los Angeles, CA, USA. IEEE Computer Society (2009)

  15. Glover, F., Laguna, M.: Tabu search (1997)

  16. Hendrickson, B.: Load balancing fictions, falsehoods and fallacies. Appl. Math. Model. 25(2), 99–108 (2000)

    Article  MATH  Google Scholar 

  17. Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Safe distribution of declarative processes. In: Proceedings of the 9th International Conference on Software engineering and Formal Methods, SEFM’11, pp. 237–252. Springer, Berlin (2011)

  18. Hwang, S.-Y., Wang, H., Srivastava, J., Paul, R.A.: A probabilistic QoS model and computation framework for Web services-based workflows. In: Proceedings of 23rd International Conference on Conceptual Modeling, pp. 596–609. Springer, Berlin (2004)

  19. Hwang, S.-Y., Wang, H., Tang, J., Srivastava, J.: A probabilistic approach to modeling and estimating the QoS of web-services-based workflows. Inf. Sci. 177(23), 5484–5503 (2007)

    Article  MATH  Google Scholar 

  20. Jaeger, M.C., Rojec-Goldmann, G., Muhl, G.: QoS aggregation for Web service composition using workflow patterns. In: Proceedings of the International Conference on Enterprise Distributed Object Computing (EDOC), pp. 149–159. IEEE (2004)

  21. Jaeger, M.C., Rojec-Goldmann, G., Muhl, G.: QoS aggregation in Web service compositions. In: Proceedings of the IEEE Conference on E-Commerce, E-Services and E-Government (EEE), pp. 181–185 (2005)

  22. Khalaf, R., Kopp, O., Leymann, F.: Maintaining data dependencies across bpel process fragments. Int. J. Cooperative Inf. Syst. 17(3), 259–282 (2008)

    Article  Google Scholar 

  23. Khalaf, R., Leymann, F.: E role-based decomposition of business processes using bpel. In: ICWS, pp. 770–780 (2006)

  24. Liu, Y., Ngu, A.H., Zeng, L.Z.: QoS computation and policing in dynamic Web service selection. In: WWW Alt, pp. 66–73 (2004)

  25. Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics 8(2), 197–213 (2002)

    Article  MATH  Google Scholar 

  26. Milner, R., Tofte, M., Macqueen, D.: The Definition of Standard ML. MIT Press, Cambridge (1997)

    Google Scholar 

  27. Mitra, S., Kumar, R., Basu, S.: Optimum decentralized choreography for Web services composition. In: IEEE SCC (2), pp. 395–402 (2008)

  28. Mitra, S., Kumar, R., Basu, S.: A framework for optimal decentralized service-choreography. In: IEEE International Conference on Web Services, pp. 493–500 (2009)

  29. Polyvyanyy, A., García-Ba nuelos, L., Dumas, M.: Structuring acyclic process models. Inf. Syst. 37(6), 518–538 (2012)

    Article  Google Scholar 

  30. Ramalingam, G.: On loops, dominators, and dominance frontiers. ACM Trans. Program. Lang. Syst 24(5), 455–490 (2002)

    Article  Google Scholar 

  31. Sadiq, W., Sadiq, S.W., Schulz, K.: Model driven distribution of collaborative business processes. In: IEEE SCC, pp. 281–284 (2006)

  32. Safi, Esfahani F., Azmi Murad, M.A.: Adaptable decentralized service oriented architecture. J. Syst. Softw. 84(10), 1591–1617 (2011)

    Article  Google Scholar 

  33. Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. Research Monographs in Parallel and Distributed Computing, Pitman (1989)

  34. Sreedhar, V.C., Gao, G.R., Lee, Y.-F.: Identifying loops using dj graphs. ACM Trans. Program. Lang. Syst. 18(6), 649–658 (1996)

    Article  Google Scholar 

  35. Trandac, H., Duong, V.: A constraint-programming formulation for dynamic airspace sectorization. In: Proceedings of 21st Digital Avionics Systems Conference, 2002. vol. 1, pp. 1C5-1-1–C5-11 (2002)

  36. Wodtke, D., Weißenfels, J., Weikum, G., Dittrich, A.K.: The mentor project: steps toward enterprise-wide workflow management. In: ICDE, pp. 556–565 (1996)

  37. Yang, Y., Dumas, M., García-Ba nuelos, L., Polyvyanyy, A., Zhang, L.: Generalized aggregate quality of service computation for composite services. J. Syst. Softw (2012)

  38. Yildiz, U., Godart, C.: Information flow control with decentralized service compositions. In: ICWS, pp. 9–17 (2007)

  39. Zeng, L., Benatallah, B., Ngu, A., Dumas, M., Kalagnanam, J., Chang, H.: QoS-aware middleware for Web services composition. IEEE Trans. Softw. Eng. 30(5), 311–327 (2004)

    Article  Google Scholar 

Download references

Acknowledgments

This work was conducted while the second author was a Visiting Professor at LORIA–INRIA Nancy. The second and fourth authors were also supported by the ERDF through the Estonian Centre of Excellence in Computer Science.

Author information

Authors and Affiliations

  1. Université de Lorraine, Nancy, France

    Walid Fdhila & Claude Godart

  2. University of Vienna, Vienna, Austria

    Walid Fdhila

  3. University of Tartu, Tartu, Estonia

    Marlon Dumas & Luciano García-Bañuelos

Authors
  1. Walid Fdhila
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marlon Dumas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claude Godart
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luciano García-Bañuelos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Walid Fdhila.

Additional information

Communicated by Dr. Juan M. Vara, Mike Papazoglou and Il-Yeol Song.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fdhila, W., Dumas, M., Godart, C. et al. Heuristics for composite Web service decentralization. Softw Syst Model 13, 599–619 (2014). https://doi.org/10.1007/s10270-012-0262-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10270-012-0262-z

Keywords

Search

Navigation