A service availability-aware construction of profitable service overlay network

As the importance of service availability is increasing, we need to reflect the service availability when we build service overlay networks. With this requirement, we also have to achieve two goals for service providers and users: maximization of service provider´s revenue and guarantee of service availability of user service requests. For this, in this paper, we propose B-Greedy (service availability-Bounded revenue Greedy), a service availability-aware construction of profitable service overlay network. By bounding the range of service availability for the set of candidate service paths, we try to preserve the service paths supporting high service availability so that more user service requests are satisfied and service provider makes more revenue. From the test on PlanetLab, we verify that B-Greedy shows better performance in terms of the amount of revenue and the number of service failures than a method selecting a service path supporting maximum revenue at each user service request.