#### DMCA

## Network Flow Heuristic Algorithm for a Distributed Web Service Selection Problem

Citations: | 1 - 0 self |

### Citations

662 | A new approach to the maximum flow problem
- Goldberg, Tarjan
- 1988
(Show Context)
Citation Context ...r exact algorithms nor metaheuristics is a good solution. Here we propose Network Flow Heuristic (NFH) using a modified form of the Push-Relabel Network Flow Maximization algorithm due to Goldberg [4]=-=[5]-=-. The rest of the paper is organized as follows. Our model is described, along with its mathematical formulation, in Section 2. Section 3 describes NFH and its worst case complexity analysis. A compar... |

177 |
N-version programming: a fault-tolerance approach to reliability of software operation
- Chen, Aviˇzienis
- 1978
(Show Context)
Citation Context ...ervers. Satisfaction from the service could be a function of reliability, performance, security and any other performance related attributes. Redundant allocation by using N-Version Programming (NVP) =-=[3]-=- is used as a means to increase individual client’s satisfaction. Our proposed problem is different from typical web service selection problems which deal with optimally selecting a set of component s... |

52 | Service selection algorithms for composing complex services with multiple QoS constraints
- Yu, Lin
- 2005
(Show Context)
Citation Context ...lient’s satisfaction. Our proposed problem is different from typical web service selection problems which deal with optimally selecting a set of component services for a composite service. Yu and Lin =-=[8]-=- presented a web service selection problem where exactly one service from each group of web services is to be selected so as to maximize a utility function subject to multiple Quality of Service const... |

42 |
Fulfilling the Web services promises
- Kreger
- 2003
(Show Context)
Citation Context ... applications are moving towards the zero-installation web services based approach. A web service is an interface that describes a collection of operations that are network accessible to remote users =-=[6]-=-. Web service standards define how software applications should communicate and share their resources. Besides regular web applications like web mail and search engines, there are now web services bas... |

41 | Toth,P.: New trends in exact algorithms for the 0-1 knapsack problem
- Martello, Pisinger
- 2000
(Show Context)
Citation Context ...s it as a multi-constraint optimal path problem (MCOP). Branch and Bound, Dynamic Programming and a combination of these two approaches can be used to solve these variants of Knapsack Problem exactly =-=[7]-=-. But these methods are not suitable when the search space is combinatorially explosive and thus can not be applied to real timeapplications and web service selection problems. Many metaheuristic alg... |

9 |
Tabu search-based meta-heuristic algorithm for software system reliability problems
- Caserta, Uribe
- 2006
(Show Context)
Citation Context ...t. al. [2] presented an Evolutionary Algorithm to solve similar problems. Also, for modular software systems, a Tabu Search based metaheuristic approach is used to solve a component selection problem =-=[1]-=-. Server 1 Comp 1 Version 1 Comp 2 Version 2 Comp 3 Version 1 Request 1 … Sending statistics to the broker Broker … Figure 1. Typical architecture of the distributed web service system. In this paper ... |

5 | Measuring reliability of applications composed of web services
- Zo, Nazareth, et al.
(Show Context)
Citation Context ...d thus can not be applied to real timeapplications and web service selection problems. Many metaheuristic algorithms have also been proposed to address the web service selection problems. Zo et. al. =-=[9]-=- presented a Genetic Algorithm formulation and Chang et. al. [2] presented an Evolutionary Algorithm to solve similar problems. Also, for modular software systems, a Tabu Search based metaheuristic ap... |

4 |
Optimizing dynamic web service component composition by using evolutionary algorithms
- Chang, Wu, et al.
- 2005
(Show Context)
Citation Context ...ice selection problems. Many metaheuristic algorithms have also been proposed to address the web service selection problems. Zo et. al. [9] presented a Genetic Algorithm formulation and Chang et. al. =-=[2]-=- presented an Evolutionary Algorithm to solve similar problems. Also, for modular software systems, a Tabu Search based metaheuristic approach is used to solve a component selection problem [1]. Serve... |

1 |
Network flow algorithms, Algorithms and Combinatorics 9
- Goldberg, Tardos, et al.
- 1990
(Show Context)
Citation Context ...ther exact algorithms nor metaheuristics is a good solution. Here we propose Network Flow Heuristic (NFH) using a modified form of the Push-Relabel Network Flow Maximization algorithm due to Goldberg =-=[4]-=-[5]. The rest of the paper is organized as follows. Our model is described, along with its mathematical formulation, in Section 2. Section 3 describes NFH and its worst case complexity analysis. A com... |