Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
Proceedings of the 11th international conference on World Wide Web
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
IEEE Transactions on Parallel and Distributed Systems
Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI
IEEE Internet Computing
IEEE Transactions on Computers
Fast Algorithms for Distributed Resource Allocation
IEEE Transactions on Parallel and Distributed Systems
Distributed and Parallel Databases
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The SAHARA Model for Service Composition across Multiple Providers
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
DAML-S: Web Service Description for the Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
IEEE Internet Computing
Replica Selection in the Globus Data Grid
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
A Framework and Ontology for Dynamic Web Services Selection
IEEE Internet Computing
Replicating Web Applications On-Demand
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
Selecting the best web service
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Progressive Auction Based Resource Allocation in Service-Oriented Architecture
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 02
Quality Driven Web Services Selection
ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
SELF-SERV: a platform for rapid composition of web services in a peer-to-peer environment
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Allocation strategies for utilization of space-shared resources in Bag of Tasks grids
Future Generation Computer Systems
Capacity planning and scheduling in Grid computing environments
Future Generation Computer Systems
An innovative workflow mapping mechanism for Grids in the frame of Quality of Service
Future Generation Computer Systems
Future Generation Computer Systems
Fuzzy service selection in a distributed object-oriented environment
IEEE Transactions on Fuzzy Systems
Prediction-based real-time resource provisioning for massively multiplayer online games
Future Generation Computer Systems
Considerations on using transactions in workflow design
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Predicting service request rates for adaptive resource allocation in SOA
Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation
Partitioning composite web services for decentralized execution using a genetic algorithm
Future Generation Computer Systems
Flexible service selection with user-specific QoS support in service-oriented architecture
Journal of Network and Computer Applications
Economic model based cloud service composition
ICSOC'11 Proceedings of the 2011 international conference on Service-Oriented Computing
QoS-Aware cloud service composition based on economic models
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Hi-index | 0.00 |
In software service provision, the overall performance of a composite service is often the ultimate focus of concern rather than those of its individual components. This opens new opportunities for resource allocation because with its service workflow definition, more accurate prediction of its individual components' dynamic workload is possible, thus resulting in better utilization of resources. In this paper, we propose to improve resource allocation through tracing and prediction of workload dynamics of component services as requests traverse and pipeline through the workflow. Factors affecting service workload such as service time, transition probability, replication overhead for additional service etc. as well as the uncertainty in request arrival time are all taken into consideration in our model. The goal is to maximize the number of requests completed under the constraints of limited available resources. Experimental study on TPC-W and synthetic workflow shows that our dynamic workflow-based resource allocation scheme is much more efficient in enhancing the overall performance of composite services than current resource allocation schemes do.