The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1109/tsc.2013.2295811
|View full text |Cite
|
Sign up to set email alerts
|

Opportunistic Service Composition in Dynamic Ad Hoc Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 28 publications
(24 citation statements)
references
References 41 publications
0
24
0
Order By: Relevance
“…Groba and Clarke identified the impact of topology changes in a service communication; in order to reduce the service failure, a composition protocol is designed, and it is able to allocate and minimize the service invoked at the providers' end. Moreover, it is able to choose appropriate services opportunistically at the time of the service requisition process.…”
Section: Literature Study and Related Workmentioning
confidence: 99%
“…Groba and Clarke identified the impact of topology changes in a service communication; in order to reduce the service failure, a composition protocol is designed, and it is able to allocate and minimize the service invoked at the providers' end. Moreover, it is able to choose appropriate services opportunistically at the time of the service requisition process.…”
Section: Literature Study and Related Workmentioning
confidence: 99%
“…3 adopts a heuristic procedure that tries to determine a "good enough" composition, without a strict guarantee that an optimal solution will be found. The procedure is based on a greedy approach similar to the ones proposed in [9,19], which resolves services in Σ W on a stepby-step basis, starting from the initial node of W : indeed, a required service σ is bound to a matching concrete service only if all preceding services in Pred (σ) have already been resolved (line 7). The rationale for this mechanism is that only when Pred (σ) is fully resolved, it is possible to know the worst case increment to the path length caused by resources in the set of known candidates for σ, and to select the one causing the minimal increment (lines 7-9).…”
Section: System Modelmentioning
confidence: 99%
“…Many approaches dealing with these issues have been proposed in the literature (e.g., [5,[7][8][9]17]). Existing solutions can be broadly divided into centralized or decentralized service composition.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations