A Distributed Planning Approach for Web Services Composition

Falou, Mohamad El; Bouzid, Maroua; Mouaddib, Abdel‐Illah; Vidal, Thierry

doi:10.1109/icws.2010.13

Cited by 14 publications

(7 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…El Falou et al introduced an agent based distributed planning method for service compositions [16]. An agent is associated with each service while a central agent broadcasts clients' requests to all agents.…”

Section: Related Workmentioning

confidence: 99%

QoS-Based Composition of Service Specific Overlay Networks

Ridhawi

Karmouch

2015

IEEE Trans. Comput.

View full text Add to dashboard Cite

Optimization of service compositions represents a challenging area of research in mobile networks. The use of formal semantic descriptions of service interfaces and functionalities enable automated reasoning over service compositions. The growing challenge of finding effective methods to satisfy non-functional QoS requirements of customers exacerbates the composition problem. Fuzzy reasoning provides an effective means to represent QoS concepts that are vague or approximate thus providing a flexible best-match service query scheme. This paper presents a new fuzzy-induced, semantic-similarity-based service-specific overlay network composition over a hybrid service overlay network. The presented composition method allows for efficient, accurate, and QoS-aware component service discovery, composition, and execution. We demonstrate that our approach provides better performance and reduced composition delay when compared to other service-composition solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

QoS-Based Composition of Service Specific Overlay Networks

Ridhawi

Karmouch

2015

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…Our extension algorithm DEC-A* is inspired from a new distributed multi-agent planning approach proposed in [4]. In this approach, agents coordinates by proposing their best plans evaluated basing on local heuristic and global heuristic.…”

Section: Related Workmentioning

confidence: 99%

DEC-A*: A Decentralized Multiagent Pathfinding Algorithm

Falou

Bouzid

Mouaddib

2012

2012 IEEE 24th International Conference on Tools With Artificial Intelligence

View full text Add to dashboard Cite

A* is the algorithm of finding the shortest path between two nodes in a graph. When the searching problem is constituted of a set of linked graphs, A* searches solution like if it is face of one graph formed by linked graphs. While researchers have developed solutions to reduce the execution time of A* in multiple cases by multiples techniques, we develop a new algorithm: DEC-A* which is a decentralized version of A* composing a solution through a collection of graph. A* uses a distance-plus-cost heuristic function to determine the order in which the search visits nodes in the tree. Our algorithm DEC-A* extends the evaluation of the distance-plus-cost heuristic to be the sum of two functions : local distance, which evaluates the cost to reach the nearest neighbor node s to the goal, and global distance which evaluates the cost from s to the goal through other graphs. DEC-A* reduces the time of finding the shortest path and reduces the complexity, while ensuring the privacy of graphs.

show abstract

“…The problem of managing a dynamic service composition has been dealt with in literature by proposing approaches mainly based on dynamic service assembly (e.g., [8], [14]) or on dynamic service planning (e.g., [15], [16]). In this section we shortly review the papers based on dynamic service assembly, which are the ones closest to our approach.…”

Section: Related Workmentioning

confidence: 99%

QoS-aware fully decentralized service assembly

Grassi¹,

Marzolla²,

Mirandola³

2013

2013 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)

View full text Add to dashboard Cite

Abstract-Large, distributed software systems are increasingly common in today geographically distributed IT infrastructures. A key challenge for the software engineering community is how to efficiently and effectively manage such complex systems. Extending software services with autonomic capabilities has been suggested as a possible way to address this challenge. Ideally, selfmanagement capabilities should be based on fully distributed, peer-to-peer (P2P) architectures in order to try to overcome the scalability and robustness problems of centralized solutions. Within this context, we propose an approach for the adaptive self-assembly of distributed services, based on a simple epidemic protocol. Our approach is based on the three-layer reference model for adaptive systems, and is centered on the use of a gossip protocol to achieve decentralized information dissemination and decision making. The goal of our system is to build and maintain an assembly of services that, besides functional requirements, is able to fulfill global quality of service (QoS) and structural requirements. A set of simulation experiments is used to assess the effectiveness of our approach in terms of convergence speed towards the optimal solution, and resilience to failures.

show abstract

A Distributed Planning Approach for Web Services Composition

Cited by 14 publications

References 4 publications

QoS-Based Composition of Service Specific Overlay Networks

QoS-Based Composition of Service Specific Overlay Networks

DEC-A*: A Decentralized Multiagent Pathfinding Algorithm

QoS-aware fully decentralized service assembly

Contact Info

Product

Resources

About