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.

[1]  Mohammad Rob,et al.  The rise and fall of an e-commerce program , 2003, Commun. ACM.

[2]  Mike P. Papazoglou,et al.  Service-Oriented Computing , 2008 .

[3]  Jianping Wang,et al.  Fault Tolerant Service Composition in Service Overlay Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[4]  Klara Nahrstedt,et al.  On construction of service multicast trees , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  Keiichi Yasumoto,et al.  Resource-aware service composition for video multicast to heterogeneous mobile users , 2005, MSC '05.

[6]  Mike P. Papazoglou,et al.  Introduction: Service-oriented computing , 2003, CACM.

[7]  Jean-Philippe Martin-Flatin,et al.  Special Issue on Recent Advances in Web Services , 2007, World Wide Web.

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Klara Nahrstedt,et al.  mc-SPF: an application-level multicast service path finding protocol for multimedia applications , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[10]  Klara Nahrstedt,et al.  Service composition for generic service graphs , 2006, Multimedia Systems.

[11]  Minming Li,et al.  Service Sharing for Streaming Video Multicast , 2008, IEEE Transactions on Multimedia.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Klara Nahrstedt,et al.  Finding service paths in a media service proxy network , 2001, IS&T/SPIE Electronic Imaging.

[14]  Zongpeng Li,et al.  sFlow: towards resource-efficient and agile service federation in service overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[15]  Randy H. Katz,et al.  Load balancing and stability issues in algorithms for service composition , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Klara Nahrstedt,et al.  Resource- and quality-aware application-level service multicast , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[17]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[18]  Sujata Banerjee,et al.  Service adaptive multicast for media distribution networks , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[19]  Klara Nahrstedt,et al.  QoS-assured service composition in managed service overlay networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[20]  Sujata Banerjee,et al.  RITA: receiver initiated just-in-time tree adaptation for rich media distribution , 2003, NOSSDAV '03.

[21]  Klara Nahrstedt,et al.  A scalable QoS-aware service aggregation model for peer-to-peer computing grids , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[22]  Faris Nizamic,et al.  Service-Oriented Computing , 2010, Lecture Notes in Computer Science.

[23]  Yaron Goland,et al.  Web Services Business Process Execution Language , 2009, Encyclopedia of Database Systems.

[24]  Mike P. Papazoglou,et al.  Web Services and Business Transactions , 2003, World Wide Web.

[25]  Klara Nahrstedt,et al.  Source-based QoS service routing in distributed service networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).