Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Robust web services provisioning through on-demand replication|
|Citation:||Proceedings of the 3rd International United Information Systems Conference (UNISCON), held in Sydney, Australia 2009.|
|Series/Report no.:||Lecture Notes in Business Information Processing ; 20|
|Conference Name:||International United Information Systems Conference (3rd : 2009 : Sydney, Australia)|
|Quan Z. Sheng, Zakaria Maamar, Jian Yu, and Anne H.H. Ngu|
|Abstract:||Significant difference exists between things that work and things that work well. Availability along with reliability would make Web services the default technology of choice in developing many mission-critical electronic-business applications. Unfortunately, guaranteeing a Web service availability is still a challenge due to the unpredictable number of invocation requests a Web service (e.g., Google Maps) has to handle at a time, as well as the dynamic nature of the Internet (e.g., network disconnections). In addition, the heterogeneity, mobility and distributed nature of Web services makes traditional dependability and availability approaches inappropriate for Web services. In this paper, we describe the design of an on-demand replication approach for robust Web service provisioning. This approach dynamically deploys Web services at appropriate idle hosts, reducing the unavailability of Web services during peak demand for limited computing resources. In addition this approach promotes the decoupling of Web service providers and Web service host providers, which supports a more flexible replication model.|
|Description:||Book subtitle: Third International United Information Systems Conference, UNISCON 2009, Sydney, Australia, April 21-24, 2009. Proceedings|
|Rights:||Copyright Springer-Verlag Berlin Heidelberg 2009|
|Appears in Collections:||Aurora harvest 5|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.