A bargaining-driven global QoS adjustment approach for optimizing service composition execution path

Ren, Kaijun; Song, Junqiang; Zhu, Min; Xiao, Nong

doi:10.1007/s11227-011-0645-x

Cited by 6 publications

(3 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ren et al . presented a novel approach to service composition based on a recursive bargaining strategy that takes advantage of the hidden competition relationships between service providers. Unfortunately, this approach is useful in environments where different service providers contend for the users and charge them their services, not being applicable to our environment.…”

Section: Comparison With Other Approachesmentioning

confidence: 99%

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

Estévez-Ayres

Val

García-Valls

2012

Concurrency and Computation

View full text Add to dashboard Cite

During the last decade, the number of distributed application domains with temporal requirements has significantly augmented, arising the necessity of exploring new concepts and paradigms that allow, on the one hand, the development of dynamic and flexible distributed applications and, on the other hand, the reusability of code. Service-oriented paradigms have been successfully applied to distributed environments, increasing their flexibility and allowing the reusability of their components. Besides, distributed real-time Java technologies have shown to be a good candidate to deploy real-time distributed applications. This paper presents a model for service-oriented applications on a time-triggered distributed real-time Java environment, focusing on the definition of the temporal model of an application and its schedulability, applying and evaluating this model in real-time service-oriented composition algorithms. COMPOSING AND SCHEDULING TT-DISTRIBUTED RT-JAVA SOAS 153 used by distributed real-time applications, such as the concept of connection-pool, memory-pool and thread-pool or the usage of a distributed garbage collector, defining a dual programming model that allows the choice of between a development based on remote invocation or based on distributed events [7][8][9]. DREQUIEMI also includes a synchronous scheduling service [10] that allows the establishment of a common temporal axis for a distributed application.This work aims to give the basis to design and develop a service-oriented application in a distributed real-time Java environment. The support given by the synchronous scheduling service over DREQUIEMI for real-time coordination between entities within the system (allowing the coordination between services within an application) and between the system and external actions (allowing the system to interact with sensors and actuators or the cooperation between different autonomous applications) makes it a good candidate for supporting real-time service-based applications. This service is based on a time-triggered communications paradigm and also supports asynchronous traffic, with temporal isolation, needed for the communication of events between different entities of a real-time service-based distributed system.This RTRMI middleware will be used as underlying platform in a real-time service-based system. In a real-time service-based architecture, the underlying paradigm (RMI or any other) should be transparent from the point of view of the application programmer, so she only needs to be aware of the abstract notion of a service and of the desired behaviour and quality of service (QoS) of an application. The system is, then, in charge of building loosely coupled communications (one of the main characteristics of a service-based approach) on top of the given underlying platform. This is achieved by the definition of suitable architectures [11][12][13][14] and translation rules between application and communication concepts (as the presented in Section 4.2.1).When composing real-time service-oriented ...

show abstract

Section: Comparison With Other Approachesmentioning

confidence: 99%

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

Estévez-Ayres

Val

García-Valls

2012

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…For example, users shall pay higher price for better cloud service with higher performance where the price and performance is a couple of conflict objects. The service composition optimization problem that needs to consider multiple conflict objects is known as Multi-objective Optimal Problem of Service Composition (MOPSC) [2]. The MOPSC has been proven to be a NP-hard problem that could not be resolved in linear manner [3].…”

Section: Introductionmentioning

confidence: 99%

“…To cope with the challenge of MOPSC, there have been many attempts to find near optimal solutions by utilizing novel optimization algorithms such as heuristic algorithm, evolutionary algorithm, bionic algorithm and integer programming method [4]. In despite of the difference of basic idea, these researches always adopt local optimization strategy or global optimization strategy to achieve the optimal or near optimal solutions [5] [6].…”

Section: Introductionmentioning

confidence: 99%

A Data Volume Aware Ant Colony Optimization Approach for Geographical Knowledge Cloud Service Composition

Chen

Huang

2016

IJGDC

View full text Add to dashboard Cite

show abstract

A weakest link-driven global QoS adjustment approach for optimizing the execution of a composite web service

2019

View full text Add to dashboard Cite

A bargaining-driven global QoS adjustment approach for optimizing service composition execution path

Cited by 6 publications

References 37 publications

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

A Data Volume Aware Ant Colony Optimization Approach for Geographical Knowledge Cloud Service Composition

A weakest link-driven global QoS adjustment approach for optimizing the execution of a composite web service

Contact Info

Product

Resources

About