AnLiu IDAR07 nocomment

Information about AnLiu IDAR07 nocomment

Published on October 12, 2007

Author: Charlie

Source: authorstream.com

Content

Ensuring Consistent Termination of Composite Web Services:  Ensuring Consistent Termination of Composite Web Services An Liu1,2,3 and Qing Li2,3 1 Department of Computer Science and Technology University of Science & Technology of China (USTC), Hefei, China  2 Joint Research Lab of Excellence CityU-USTC Advanced Research Institute, Suzhou, China  3 Department of Computer Science City University of Hong Kong (CityU), Hong Kong, China [email protected] [email protected] Outline:  Outline Problem Statement and Background Problem Modeling and Methodology Framework Conclusion and Future Work Web Services Composition:  Web Services Composition Client App Travel Agent Timeline Web Services Flight Taxi Hotel Reliable Composition Needs Transactional Support! ACID Transaction Insufficient:  ACID Transaction Insufficient Composite web services Last for hours or days Work in an open environment Cross administrative boundaries ACID transaction is insufficient Trust and timeliness no longer apply Compensation-based transaction No common transaction semantics Some Representative Related Work:  Some Representative Related Work Transaction semantics declaration Mikalsen et al. (2002): declare transaction semantics at operation level and transactional property at service level Transactional property (TP) deduction Vidyasankar and Vossen (2004): deduct TP of composite services from TP of component services Different Atomicity Requirements Fauvet et al. (2005): support flexible atomicity through TP-based service selection Bhiri et al. (2005): verify Accepted-Termination-States (ATS) based atomicity by some transactional rules Montagut and Molva (2006): support ATS-based atomicity through TP-based service selection and automatic coordination State of the Art:  State of the Art Current research has Defined TP of web services Guaranteed Reliable Service Composition in the context of heterogeneous TP Autonomy of services was overlooked Compensation has temporal and cost constraints (Benatallah et al. 2004) e.g., deadline of hotel reservation cancellation Problem Statement:  Problem Statement How to get reliable composition when both autonomy and heterogeneity are considered? Given The control flow of a composite service Component services with heterogeneous TP Temporal constraints of compensation How to get reliable composition where the composite service will terminate in a consistent state? Outline:  Outline Problem Statement and Background Problem Modeling and Methodology Framework Conclusion and Future Work Definitions:  Definitions Transactional Property (TP) of web services Compensatable (c): normal operation (on) and compensation operation (oc) Retriable (r): Only normal operation Pivot (p): Only normal operation Temporal property of operations Execution time (tx): e.g., 5 seconds Available time (ta): e.g., [9am, 5pm] Deadline: Maximal Compensatable Time (MCT) For compensation op, ta=[t, t+MCT] Definitions (cont.):  Definitions (cont.) Service s: 5-tuple(tp, on, oc, t, sta) tp{r, c, rc, p} on & oc : normal and compensation operation t = (ts, te): starting and ending time sta{initial, active, completed, aborted, failed, cancelled, compensated}: current state Process: G(Vt, Vo, E) Vo : set of control flow op. (cfo), where cfo{AND-split, AND-join, XOR-split, XOR-join, OR-split, OR-join, start-loop, end-loop} G(Vs, Vo, E): an instance of process G(Vt, Vo, E) Consistent Termination Condition:  Consistent Termination Condition A composite service sc will always terminate in a consistent state if the consistent termination condition (CTC) holds: vi.tp{c, rc}, sc.t.te  vi.oc.ta for vi  Vs in G Example: sc, s1s2 if s1.on.tx=2 & s1.oc.MCT=5 & s2.on.tx=4 then s1.oc.ta=[2,7], sc.t.te=6 CTC Verification:  CTC Verification Precondition: global view of a composite service: control flow, transactional and temporal property Method: simple calculation Problem: NOT easy to get a global view Dynamic selection Multi-level composition Methodology:  Methodology Assumptions A1: only elementary component services A2: static service selection A3: only compensatable component services A4: only AND-split and AND-join operators Outline:  Outline Problem Statement and Background Problem Modeling and Methodology Framework Conclusion and Future Work Framework Overview :  Framework Overview CTC Verification Examples:  CTC Verification Examples A B C D [10,30] 10 [11,31] 11 10 10 [16,28] 10 16 10 [8,16] [11,31] 17 11 [8,16] [10,18] 12 [12,20] 12 16 [16,28] 18 [18,30] [2,17] [2,17] 16 [16,28] 9 [9,17] [10,30] 10 11 [11,31] [11,19] 11 11 17 [17,29] Scheduling Algorithms:  Scheduling Algorithms Motivation: different scheduling algorithms lead to different results of CTC verification, which decide whether to abort the service or not Objective: design a scheduling algorithm which can decrease the possibility of service abortion Some algorithms Immediate scheduling Minimal delay scheduling Maximal delay scheduling Average delay scheduling …, optimal scheduling algorithm? Dynamic Monitoring :  Dynamic Monitoring Inaccurate Global View:  Inaccurate Global View Problems Uncertainty of Execution Time (UET) Information Missing (IM) IM1: execution time of normal operation is unknown IM2: available time of compensation operation is unknown Solution UET Scheduling algorithms Dynamic monitoring mechanism IM1: UET variation (increased execution time) IM2: Dynamic monitoring mechanism Removing Assumptions:  Removing Assumptions A4 (only AND-split and AND-join operators) Loop: UET variation XOR/OR: pseudo AND operator A3 (only compensatable component services) Retriable: safely ignored Pivot: process graph division A2 (static service selection) IM1 & IM2 A1 (only elementary component services) IM1 & IM2 Time Complexity:  Time Complexity CTC verification: O(n+e) Dynamic monitoring: O(n2+ne) Total time complexity: O(n2+ne) Outline:  Outline Problem Statement and Background Problem Modeling and Methodology Framework Conclusion and Future Work Conclusion and Future Work:  Conclusion and Future Work A framework Assists selection of services based on transactional and temporal property Ensures consistent termination under constrained compensation Some next steps Minimal-Abort-Possibility scheduling algorithms Cost constraints Integration with web services execution engine

Related presentations


Other presentations created by Charlie

Personality Development
17. 11. 2007
0 views

Personality Development

History of Plastics
30. 04. 2008
0 views

History of Plastics

Juniper Networks 22 Nov 2005
28. 04. 2008
0 views

Juniper Networks 22 Nov 2005

CA Communications 02 20 08
18. 04. 2008
0 views

CA Communications 02 20 08

BharAloutlookISRI
17. 04. 2008
0 views

BharAloutlookISRI

direct basis
16. 04. 2008
0 views

direct basis

AnEconomicHistory English
14. 04. 2008
0 views

AnEconomicHistory English

Chap002
13. 04. 2008
0 views

Chap002

Financial Crisis
10. 04. 2008
0 views

Financial Crisis

NATO Today
23. 12. 2007
0 views

NATO Today

TM photo pp ppt
08. 10. 2007
0 views

TM photo pp ppt

2007 seminar 3
12. 10. 2007
0 views

2007 seminar 3

Roalddahl
12. 10. 2007
0 views

Roalddahl

micro credit presentation
15. 10. 2007
0 views

micro credit presentation

lecture 9 12 proteins 2007
16. 10. 2007
0 views

lecture 9 12 proteins 2007

Spanish American War
22. 10. 2007
0 views

Spanish American War

ppw 6 28 04
07. 10. 2007
0 views

ppw 6 28 04

PP2
23. 10. 2007
0 views

PP2

KATRINA TEACHERS GUIDEpr
04. 09. 2007
0 views

KATRINA TEACHERS GUIDEpr

ECA Knowledge Fair
31. 08. 2007
0 views

ECA Knowledge Fair

Automatic Indexing
31. 08. 2007
0 views

Automatic Indexing

ROLE OF JOURNALISTS UNION
31. 08. 2007
0 views

ROLE OF JOURNALISTS UNION

wendy
15. 11. 2007
0 views

wendy

Maximize Access Coverage
28. 11. 2007
0 views

Maximize Access Coverage

Notable Arborists
02. 10. 2007
0 views

Notable Arborists

INDEX OF SEGREGATION
07. 12. 2007
0 views

INDEX OF SEGREGATION

wilhelm2
04. 01. 2008
0 views

wilhelm2

FV1 day1
07. 01. 2008
0 views

FV1 day1

berdai
23. 10. 2007
0 views

berdai

weddings
11. 12. 2007
0 views

weddings

McDowell
29. 10. 2007
0 views

McDowell

usa jl
13. 11. 2007
0 views

usa jl

Construccion de un NOM
24. 10. 2007
0 views

Construccion de un NOM

TuLiP Overview
04. 09. 2007
0 views

TuLiP Overview

tulip
04. 09. 2007
0 views

tulip

HawaiiPresentation
17. 12. 2007
0 views

HawaiiPresentation

ompi tm cas 04 5
23. 10. 2007
0 views

ompi tm cas 04 5

Chapter12
03. 10. 2007
0 views

Chapter12

asian inc
29. 10. 2007
0 views

asian inc

Mat Prod L10
14. 02. 2008
0 views

Mat Prod L10

featurefilm
17. 10. 2007
0 views

featurefilm

EJ Genetic Research
24. 02. 2008
0 views

EJ Genetic Research

badagliacco
24. 02. 2008
0 views

badagliacco

Science and Warfare Lecture 1
26. 02. 2008
0 views

Science and Warfare Lecture 1

AHCIVI 1
27. 02. 2008
0 views

AHCIVI 1

student pressentation mngn
07. 11. 2007
0 views

student pressentation mngn

trucks 4 comm
28. 02. 2008
0 views

trucks 4 comm

bioweapons
04. 03. 2008
0 views

bioweapons

2007EMSVaccinationTr aining
10. 03. 2008
0 views

2007EMSVaccinationTr aining

Mehta diving and the environment
11. 03. 2008
0 views

Mehta diving and the environment

Perform Basis06 A0 en last
25. 03. 2008
0 views

Perform Basis06 A0 en last

wttcsantiago2007
26. 03. 2008
0 views

wttcsantiago2007

Living on Mars
07. 04. 2008
0 views

Living on Mars

lect22 handout
15. 10. 2007
0 views

lect22 handout

pedagogy
04. 09. 2007
0 views

pedagogy

FEE dev IHEP
31. 08. 2007
0 views

FEE dev IHEP

Rong Gen Cai
01. 12. 2007
0 views

Rong Gen Cai

mps break st louis
18. 06. 2007
0 views

mps break st louis

Moving on with Statistics
19. 06. 2007
0 views

Moving on with Statistics

Module 2 TAKS05
19. 06. 2007
0 views

Module 2 TAKS05

microsoft office overview
19. 06. 2007
0 views

microsoft office overview

Math in Middle School
19. 06. 2007
0 views

Math in Middle School

Math Concordance Show
19. 06. 2007
0 views

Math Concordance Show

Mary George
19. 06. 2007
0 views

Mary George

Lower Division
19. 06. 2007
0 views

Lower Division

Lecture Amiens
19. 06. 2007
0 views

Lecture Amiens

lady adalovelace
19. 06. 2007
0 views

lady adalovelace

Kelm
31. 08. 2007
0 views

Kelm

Oct06 CAC Presentation1
18. 06. 2007
0 views

Oct06 CAC Presentation1

NLI 0460
18. 06. 2007
0 views

NLI 0460

nicholas
18. 06. 2007
0 views

nicholas

NCLB Highly Qualified
18. 06. 2007
0 views

NCLB Highly Qualified

NCLB An dE Rate1029
18. 06. 2007
0 views

NCLB An dE Rate1029

MWR 07073
18. 06. 2007
0 views

MWR 07073

mtts product show
18. 06. 2007
0 views

mtts product show

OMSC
18. 06. 2007
0 views

OMSC

PACA 16 de agosto
22. 10. 2007
0 views

PACA 16 de agosto

dh firenze
19. 10. 2007
0 views

dh firenze

gridpp16 servicechallenges
24. 10. 2007
0 views

gridpp16 servicechallenges

lwi
19. 06. 2007
0 views

lwi

VoIPSlides
12. 03. 2008
0 views

VoIPSlides

3 Russia 05
26. 10. 2007
0 views

3 Russia 05

Lynnand Marsha
19. 06. 2007
0 views

Lynnand Marsha

07 0314 k ahuja
28. 09. 2007
0 views

07 0314 k ahuja

PresJMorales
22. 10. 2007
0 views

PresJMorales

Math TEKS K5
19. 06. 2007
0 views

Math TEKS K5

me579 16 internetMC
15. 11. 2007
0 views

me579 16 internetMC

Briars
04. 09. 2007
0 views

Briars

Esm Juny 05 IESE tcm48 42493
01. 10. 2007
0 views

Esm Juny 05 IESE tcm48 42493

CESARE PACIOTTI
10. 10. 2007
0 views

CESARE PACIOTTI

kep engl2007
15. 10. 2007
0 views

kep engl2007

LCG Switzerland Phase 2
19. 10. 2007
0 views

LCG Switzerland Phase 2

stoddart
06. 03. 2008
0 views

stoddart

Ch Kor Symp00
13. 10. 2007
0 views

Ch Kor Symp00

xps seminar jan e
19. 06. 2007
0 views

xps seminar jan e

soda3
03. 01. 2008
0 views

soda3

nys status Report 2006 2007
18. 06. 2007
0 views

nys status Report 2006 2007

JOSB
21. 11. 2007
0 views

JOSB

raffo phdthesis
07. 10. 2007
0 views

raffo phdthesis

parolari
03. 01. 2008
0 views

parolari

bailey
23. 10. 2007
0 views

bailey