Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Minimum cost service composition in service overlay networks


In service computing, it is often desirable to find the service composition solution for a given service composition request such that the total cost of the service composition solution is minimized. In this paper, we study the problem of finding the minimum cost service composition (MCSC) for a general service composition request which is represented by a directed acyclic graph (DAG). We first prove that the general case of the MCSC problem is NP-Hard. We then show that optimal solutions can be found in polynomial time for some special structured service composition requests. To this end, we derive a sufficient condition on the service composition request graph and propose corresponding algorithms to find the optimal solutions in polynomial time. Using such algorithms as building blocks, we propose heuristic algorithms to decompose the general service composition request graph into service composition request subgraphs with optimal structures. Simulation results demonstrate the effectiveness of the proposed heuristic algorithms.

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


  1. 1.

    Banerjee, S., Xu, Z., Lee, S., Tang, C.: Service adaptive multicast for media distribution networks. In: Proc. of the the Third IEEE Workshop on Internet Applications, p. 50. IEEE Computer Society (2003)

  2. 2.

    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Co. (1979)

  3. 3.

    Gu, X., Nahrstedt, K.: A scalable QoS-Aware service aggregation model for Peer-to-Peer computing grids. In: Proc. of the 11th IEEE International Symposium on High Performance Distributed Computing. IEEE Computer Society, p. 73 (2002)

  4. 4.

    Gu, X., Nahrstedt, K., Chang, R., Ward, C.: QoS-assured service composition in managed service overlay networks. In: Proc. of the 23rd International Conference on Distributed Computing Systems, pp. 194–201 (2003)

  5. 5.

    Jin, J., Nahrstedt, K.: Resource- and quality-aware application-level service multicast. In: Proc. of the 9th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS’03), pp. 198–204 (2003)

  6. 6.

    Jin, J., Nahrstedt, K.: Source-based QoS service routing in distributed service networks. In: Proc. of IEEE International Conference on Communications, vol. 4, pp. 2036–2041 (2004)

  7. 7.

    Jin, J., Nahrstedt, K.: On construction of service multicast trees. In: Proc. of IEEE International Conference on Communications (ICC ’03), vol. 2, pp. 860–864 (2003)

  8. 8.

    Jin, J., Nahrstedt, M.: mc-SPF: an application-level multicast service path finding protocol for multimedia applications. In: Proc. of IEEE International Conference on Multimedia and Expo (ICME ’02), vol. 1, pp. 765–768 (2002)

  9. 9.

    Liang, J., Nahrstedt, K.: Service composition for generic service graphs. Multimedia Syst. 11(6), 568–581 (2006)

  10. 10.

    Martin-Flatin, J., Löwe, W.: Special issue on recent advances in web services. World Wide Web 10(3), 205–209 (2007)

  11. 11.

    Papazoglou, M.P.: Web services and business transactions. World Wide Web 6(1), 49–91 (2003)

  12. 12.

    Papazoglou, M.P., Traverso, P., Dustdar, S., Leymann, F.: Service-oriented computing. Commun. ACM 46, 25—28 (2003)

  13. 13.

    Raman, B., Katz, R.: Load balancing and stability issues in algorithms for service composition. In: Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 2, pp. 1477–1487 (2003)

  14. 14.

    Snell, J.: The web services insider, part 4: introducing the web services flow language. Available online: (2001). Accessed 26 December 2009

  15. 15.

    Wang, J., Chiu, D., Li, Q., Li, M.: Service sharing for streaming video multicast. IEEE Trans. Multimedia 10(7), 1393–1405 (2008)

  16. 16.

    Wang, M., Li, B.: sFlow: towards resource-efficient and agile service federation in service overlay networks. In: Proc. of 24th International Conference on Distributed Computing System, pp. 628–635 (2004)

  17. 17.

    Wang, J., Wang, J., Gu, N., Yang, B.: Fault tolerant service composition in service overlay networks. In: Proc. of IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–5 (2008)

  18. 18.

    WS-BPEL: Web services business process execution language version 2.0. Available online: (2007). Accessed 26 December 2009

  19. 19.

    WSCI: Web service choreography interface (WSCI) 1.0. Available online: (2002). Accessed 26 December 2009

  20. 20.

    Xu, D., Nahrstedt, K., Kienzle, M.G., Shenoy, P.J.: Finding service paths in a media service proxy network. In: Proc. of Multimedia Computing and Networking 2002, vol. 4673, pp. 171–185. SPIE: San Jose (2001)

  21. 21.

    Xu, Z., Tang, C., Banerjee, S., Lee, S.: RITA: receiver initiated just-in-time tree adaptation for rich media distribution. In: Proc. of the 13th international workshop on Network and operating systems support for digital audio and video, pp. 50–59. ACM, Monterey (2003)

  22. 22.

    Yamaoka, S., Sun, T., Tamai, M., Yasumoto, K., Shibatay, N., Ito, M.: Resource-aware service composition for video multicast to heterogeneous mobile users. In: Proc. of the first ACM international workshop on Multimedia service composition, pp. 37–46. ACM, Hilton (2005)

  23. 23.

    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)

Download references

Author information

Correspondence to Jianping Wang.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wang, J., Wang, J., Chen, B. et al. Minimum cost service composition in service overlay networks. World Wide Web 14, 75–103 (2011).

Download citation


  • service computing
  • service composition
  • service overlay network
  • graph
  • np-hard