Dynamic and adaptive composition of e-services
Information Systems - The 12th international conference on advanced information systems engineering (CAiSE 00)
Globally Distributed Content Delivery
IEEE Internet Computing
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Composing Web Services: A QoS View
IEEE Internet Computing
Distributed multimedia service composition with statistical QoS assurances
IEEE Transactions on Multimedia
| Hi-index | 0.00 |
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.