The Experts below are selected from a list of 95085 Experts worldwide ranked by ideXlab platform
Shinichi Honiden - One of the best experts on this subject based on the ideXlab platform.
-
efficient qos aware service composition with a probabilistic service Selection Policy
International Conference on Service Oriented Computing, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
-
ICSOC - Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Computing – ICSOC 2007, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
Adrian Klein - One of the best experts on this subject based on the ideXlab platform.
-
efficient qos aware service composition with a probabilistic service Selection Policy
International Conference on Service Oriented Computing, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
-
ICSOC - Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Computing – ICSOC 2007, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
Radu State - One of the best experts on this subject based on the ideXlab platform.
-
monitoring the transaction Selection Policy of bitcoin mining pools
Network Operations and Management Symposium, 2018Co-Authors: Beltran Borja Fiz Pontiveros, Robert Norvill, Radu StateAbstract:Mining pools are collection of workers that work together as a group in order to collaborate in the proof of work and reduce the variance of their rewards when mining. In order to achieve this, Mining pools distribute amongst the workers the task of finding a block so that each worker works on a different subset of the candidate solutions. In most mining pools the Selection of transactions to be part of the next block is performed by the pool manager and thus becomes more centralized. A mining Pool is expected to give priority to the most lucrative transactions in order to increase the block reward however changes to the transaction Policy done without notification of workers would be difficult to detect. In this paper we treat the transaction Selection Policy performed by miners as a classification problem; for each block we create a dataset, separate them by mining pool and apply feature Selection techniques to extract a vector of importance for each feature. We then track variations in feature importance as new blocks arrive and show using a generated scenario how a change in Policy by a mining pool could be detected.
-
NOMS - Monitoring the transaction Selection Policy of Bitcoin mining pools
NOMS 2018 - 2018 IEEE IFIP Network Operations and Management Symposium, 2018Co-Authors: Beltran Borja Fiz Pontiveros, Robert Norvill, Radu StateAbstract:Mining pools are collection of workers that work together as a group in order to collaborate in the proof of work and reduce the variance of their rewards when mining. In order to achieve this, Mining pools distribute amongst the workers the task of finding a block so that each worker works on a different subset of the candidate solutions. In most mining pools the Selection of transactions to be part of the next block is performed by the pool manager and thus becomes more centralized. A mining Pool is expected to give priority to the most lucrative transactions in order to increase the block reward however changes to the transaction Policy done without notification of workers would be difficult to detect. In this paper we treat the transaction Selection Policy performed by miners as a classification problem; for each block we create a dataset, separate them by mining pool and apply feature Selection techniques to extract a vector of importance for each feature. We then track variations in feature importance as new blocks arrive and show using a generated scenario how a change in Policy by a mining pool could be detected.
Zhenzhen Zhao - One of the best experts on this subject based on the ideXlab platform.
-
A flexible service Selection for executing virtual services
World Wide Web, 2013Co-Authors: Nassim Laga, Ivan Bedini, Benjamin Molina, Emmanuel Bertin, Noel Crespi, Zhenzhen ZhaoAbstract:With the adoption of a service-oriented paradigm on the Web, many software services are likely to fulfil similar functional needs for end-users. We propose to aggregate functionally equivalent software services within one single virtual service, that is, to associate a functionality, a graphical user interface (GUI), and a set of Selection rules. When an end user invokes such a virtual service through its GUI to answer his/her functional need, the software service that best responds to the end-user’s Selection Policy is selected and executed and the result is then rendered to the end-user through the GUI of the virtual service. A key innovation in this paper is the flexibility of our proposed service Selection Policy. First, each Selection Policy can refer to heterogeneous parameters (e.g., service price, end-user location, and QoS). Second, additional parameters can be added to an existing or new Policy with little investment. Third, the end users themselves define a Selection Policy to apply during the Selection process, thanks to the GUI element added as part of the virtual service design. This approach was validated though the design, implementation, and testing of an end-to-end architecture, including the implementation of several virtual services and utilizing several software services available today on the Web.
Fuyuki Ishikawa - One of the best experts on this subject based on the ideXlab platform.
-
efficient qos aware service composition with a probabilistic service Selection Policy
International Conference on Service Oriented Computing, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
-
ICSOC - Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Computing – ICSOC 2007, 2010Co-Authors: Adrian Klein, Fuyuki Ishikawa, Shinichi HonidenAbstract:Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic Selection Policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
