Graph Embedding to Allocate Network Resources for Service Composition

Recent developments in optical communications have led to the creation of large scale optical networks allowing its users to run distributed applications with high QoS requirements. In this context, this paper focuses on a strategy of reservation of temporal virtualized resources in an high bandwidth optical network for service composition. In this strategy, the service composition requirements are modeled by a specific workflow graph with constraints. To satisfy such demands, the workflow graph is embedded in a graph modeling the network in which the availability of resources is scheduled in consecutive equal time periods. We first present the models of workflow and network graphs we use and the theoretical problems we focus on. Then, we describe an online embedding algorithm and we evaluate its performances on various demand scenarii.