Reliable and efficient big service selection

Big services, both virtual (e.g., cloud services) and physical (e.g., public transportation), are evolving rapidly to handle and deal with big data. By aggregating services from various domains, big services adopt selection schemes to produce composite service solutions that meet customer requirements. However, unlike traditional service selection, a huge number of big services require some lengthy selection processes to improve the service reliability. In this paper, we propose an efficient big service selection approach based on the coefficient of variation and mixed integer programming that improves the solution in two senses: 1) minimizing the time cost and 2) maximizing the reliability. We tested our approach on real-world datasets, and the experimental results indicated that our approach is superior to others.