Cost-effective complex service mapping in cloud infrastructures

In cloud computing, instead of building their own network and facilities, companies can allocate resources from network operators, thus reducing hardware investment and maintenance cost. The company's IT infrastructure can be designed as an abstract virtual graph of services to be mapped into the substrate network of the operator. In this paper, we refer to the virtual graph mapping problem as service composition. How to identify and locate the substrate components to map the virtual graph to in an optimal way is the subject of this paper. We propose three algorithms for three different graph topologies: path, star, and tree, whose complexity is O(V3) + O(ERV2) where V is the set of substrate network nodes and ER is the set of virtual links. We also provide simulations to evaluate the performance of our algorithms.

[1]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[2]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  A. Bavier,et al.  Constructing end-to-end paths for playing media objects , 2001, 2001 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2001 (Cat. No.01EX484).

[4]  L. Orozco-Barbosa,et al.  Minimal cost design of virtual private networks , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

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

[6]  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).

[7]  Jonathan S. Turner,et al.  Configuring sessions in programmable networks with capacity constraints , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[8]  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..

[9]  Klara Nahrstedt,et al.  Service composition for advanced multimedia applications , 2005, IS&T/SPIE Electronic Imaging.

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

[11]  Brian Hayes,et al.  What Is Cloud Computing? , 2019, Cloud Technologies.

[12]  Marios D. Dikaiakos,et al.  Cloud Computing: Distributed Internet Computing for IT and Scientific Research , 2009, IEEE Internet Computing.

[13]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[14]  Schahram Dustdar,et al.  Towards Composition as a Service - A Quality of Service Driven Approach , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[15]  Qiang Liu,et al.  Virtual Network Embedding for Evolving Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[16]  Raouf Boutaba,et al.  Cloud computing: state-of-the-art and research challenges , 2010, Journal of Internet Services and Applications.

[17]  Klaus Marius Hansen,et al.  Service Composition Issues in Pervasive Computing , 2010, IEEE Pervasive Computing.

[18]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[19]  Jian Yang,et al.  QoS Analysis and Service Selection for Composite Services , 2010, 2010 IEEE International Conference on Services Computing.