Load Balancing Concurrent BPEL Processes by Dynamic Selection of Web Service Endpoints

Ferber, Marvin; Hunold, Sascha; Rauber, Thomas

doi:10.1109/icppw.2009.18

Cited by 6 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approaches like [11], [12] use dynamic binding to improve the QoS of process instances, whereas our approach does not assume the existence of several service endpoints.…”

Section: Related Workmentioning

confidence: 98%

“…Assume that replies of all requests in R are received after S RT , predict time t of finish for process p 6 l 0 = L p (t) // Default penalty 7 for request r in R do 8 Assume that a reply of r is received after S RT * 2 and replies of all other requests in R are received after S RT , predict time t r of finish for p 9 l r = L p (t r ) // Penalty for current request 10 d r = l r − l 0 // Difference between default penalty and the penalty for current request 11 Add the tuple of r, d r , and request time k (either real or predicted) to list D requests to the service.…”

Section: ) Collection Of Context and Monitoring Informationmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Request Prioritization in Dynamic Service-Oriented Systems

Khazankin

Schall

Dustdar

2011

2011 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

The availability of scarce resources in a serviceoriented system demands for context-aware selection policies that adapt based on service-level agreements (SLAs). One of the open issues is to prioritize service requests in dynamically changing environments where concurrent instances of processes may compete for resources. Here we propose a runtime monitoring approach to observe the actual state of the system. We argue that priorities should be assigned to requests based on potential violations of SLA objectives. While most existing work in the area of quality of service monitoring and SLA modeling focuses typically on purely technical systems, we consider service-oriented systems spanning both softwarebased services and human actors. Adaptive request scheduling in such systems is challenging due to the poorly predictable behavior of human actors in performing tasks. Our approach helps to cope with these challenges by prioritizing service requests that may cause violations of SLAs and corresponding objectives that are associated with processes.

show abstract

“…The approaches like [11], [12] use dynamic binding to improve the QoS of process instances, whereas our approach does not assume the existence of several service endpoints.…”

Section: Related Workmentioning

confidence: 98%

Section: ) Collection Of Context and Monitoring Informationmentioning

confidence: 99%

Adaptive Request Prioritization in Dynamic Service-Oriented Systems

Khazankin

Schall

Dustdar

2011

2011 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

show abstract

“…Note: Some efforts like [6] are done. They refer to parts of the research leading to this thesis done by myself [7].…”

Section: Business Process Execution Language For Web Services (Bpel4ws)mentioning

confidence: 99%

“…However, using replicas in system introduces an extra overhead for maintenance and data consistency. That is why it is important to combine the replication with an efficient allocation mechanism [8,7,6]. Otherwise, introducing replicas in systems would render the benefit from replication useless when compared to the gained improvement in the response time.…”

Section: Chapter 1 Introductionmentioning

confidence: 99%