Minimising Lifecycle Transitions in Service-Oriented Business Processes Roland Ukor and Andy Carpenter School of Computer Science, University of Manchester,

Slides:



Advertisements
Similar presentations
L3S Research Center University of Hanover Germany
Advertisements

©2003, Karl Aberer, EPFL, School of Computer and Communication Sciences Some Requirements for Semantic Web Serivce from CROSSFLOW and OPELIX Karl Aberer.
Research Issues in Web Services CS 4244 Lecture Zaki Malik Department of Computer Science Virginia Tech
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 12 Slide 1 Distributed Systems Design 2.
Preference Elicitation Partial-revelation VCG mechanism for Combinatorial Auctions and Eliciting Non-price Preferences in Combinatorial Auctions.
Principles of Personalisation of Service Discovery Electronics and Computer Science, University of Southampton myGrid UK e-Science Project Juri Papay,
SmartER Semantic Cloud Sevices Karuna P Joshi University of Maryland, Baltimore County Advisors: Dr. Tim Finin, Dr. Yelena Yesha.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
OASIS Reference Model for Service Oriented Architecture 1.0
Service Oriented Architecture
Variability Oriented Programming – A programming abstraction for adaptive service orientation Prof. Umesh Bellur Dept. of Computer Science & Engg, IIT.
Analysis of Software Architectures. What Is Architectural Analysis? Architectural analysis is the activity of discovering important system properties.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Irwin/McGraw-Hill Copyright © 2004 The McGraw-Hill Companies. All Rights reserved Whitten Bentley DittmanSYSTEMS ANALYSIS AND DESIGN METHODS6th Edition.
1 Draft of a Matchmaking Service Chuang liu. 2 Matchmaking Service Matchmaking Service is a service to help service providers to advertising their service.
Retrieval Evaluation. Brief Review Evaluation of implementations in computer science often is in terms of time and space complexity. With large document.
The Relationships Between Classes & Objects Presented by Tim Sweeney.
An Intelligent Broker Approach to Semantics-based Service Composition Yufeng Zhang National Lab. for Parallel and Distributed Processing Department of.
Object-Oriented Databases
SEQUOIAS YR-SOC'07 - Leicester June A NOVEL APPROACH TO WEB SERVICES DISCOVERY Marco Comerio Università di Milano-Bicocca
Supervised by, Mr. Ashraf Yaseen. Overview…. Brief Introduction about Knowledge Acquisition. How it can be achieved?. KA Stages. Model. Problems that.
OWL-S: Semantic Markup for Web Services
Kmi.open.ac.uk Semantic Execution Environments Service Engineering and Execution Barry Norton and Mick Kerrigan.
Near-Duplicate Detection by Instance-level Constrained Clustering Hui Yang, Jamie Callan Language Technologies Institute School of Computer Science Carnegie.
Grid Service Discovery with Rough Sets Maozhen Li, Member, IEEE, Bin Yu, Omer Rana, and Zidong Wang, Senior Member, IEEE IEEE TRANSACTION S ON KNOLEDGE.
Service-oriented architecture. The Basic main concepts –Service-orientation describes an architecture that uses loosely coupled services to support the.
David Chen IMS-LAPS University Bordeaux 1, France
(C) 2009 J. M. Garrido1 Object Oriented Simulation with Java.
Agent Model for Interaction with Semantic Web Services Ivo Mihailovic.
[ §3 : 1 ] 2. Life-Cycle Perspective Overview 2.1 Motivation 2.2 Waterfall Model 2.3 Requirements in Context.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Argumentation and Trust: Issues and New Challenges Jamal Bentahar Concordia University (Montreal, Canada) University of Namur, Belgium, June 26, 2007.
Preferences in semantics-based Web Services Interactions Justus Obwoge
AMPol-Q: Adaptive Middleware Policy to support QoS Raja Afandi, Jianqing Zhang, Carl A. Gunter Computer Science Department, University of Illinois Urbana-Champaign.
Efficient Provisioning of Service Level Agreements for Service Oriented Applications Valeria Cardellini, Emiliano Casalicchio, Vincenzo Grassi, Francesco.
Web Services Based on SOA: Concepts, Technology, Design by Thomas Erl MIS 181.9: Service Oriented Architecture 2 nd Semester,
1 Advanced Software Architecture Muhammad Bilal Bashir PhD Scholar (Computer Science) Mohammad Ali Jinnah University.
21-22 May 2004IMPROQ 2004 / Impact of SW Processes on Quality Workshop 1 Quality for Components: Component and Component- Based Software Quality Issues.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
©Ferenc Vajda 1 Semantic Grid Ferenc Vajda Computer and Automation Research Institute Hungarian Academy of Sciences.
1 UNIT –II Architecting Web Service. 2 Why SOA? – business point of view  Information Technology (IT) workers face many challenges, including: Limited.
1 CHAPTER 2 Decision Making, Systems, Modeling, and Support.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
Introduction to Semantic Web Service Architecture ► The vision of the Semantic Web ► Ontologies as the basic building block ► Semantic Web Service Architecture.
Inheritance in Petri Net Designs. Goals Subtyping - interface inheritance: Can the subclass use or conform to the interface of the superclass?). Projection.
Enabling the Future Service-Oriented Internet (EFSOI 2008) Supporting end-to-end resource virtualization for Web 2.0 applications using Service Oriented.
Repurpose, Compose, Profit— Next Generation SOA Infrastructure William Cox Cox Software Architects LLC Copyright 2008.
Forschungszentrum Informatik, Karlsruhe FZI Research Center for Information Science at the University of Karlsruhe Variance in e-Business Service Discovery.
Independent Insight for Service Oriented Practice Summary: Service Reference Architecture and Planning David Sprott.
16/11/ Semantic Web Services Language Requirements Presenter: Emilia Cimpian
A Mediated Approach towards Web Service Choreography Michael Stollberg, Dumitru Roman, Juan Miguel Gomez DERI – Digital Enterprise Research Institute
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Slide 1 Service-centric Software Engineering. Slide 2 Objectives To explain the notion of a reusable service, based on web service standards, that provides.
© Drexel University Software Engineering Research Group (SERG) 1 The OASIS SOA Reference Model Brian Mitchell.
HNDIT Rapid Application Development
MMM2005The Chinese University of Hong Kong MMM2005 The Chinese University of Hong Kong 1 Video Summarization Using Mutual Reinforcement Principle and Shot.
Introduction to ITIL and ITIS. CONFIDENTIAL Agenda ITIL Introduction  What is ITIL?  ITIL History  ITIL Phases  ITIL Certification Introduction to.
Introduction to Service Orientation MIS 181.9: Service Oriented Architecture 2 nd Semester,
Architecture Interoperability Pasquale Pagano Leonardo Candela CNR-ISTI.
 Copyright 2005 Digital Enterprise Research Institute. All rights reserved. SOA-RM Overview and relation with SEE Adrian Mocan
Of 24 lecture 11: ontology – mediation, merging & aligning.
The Role of Semantics and Terminologies in a Service-Oriented Architecture Paul Smits, Michael Lutz European Commission – DG Joint Research Centre Ispra,
BLUETOOTH LOW ENERGY Kieon Seong. Introduction  Chap 1. What is Bluetooth Low Energy? Difference Between Classic Bluetooth Device Types Design Goals.
Service Oriented Architecture (SOA) Prof. Wenwen Li School of Geographical Sciences and Urban Planning 5644 Coor Hall
Tomas Vitvar, Maciej Zaremba, Mathew Moran
Service-centric Software Engineering 1
Software Metrics SAD ::: Fall 2015 Sabbir Muhammad Saleh.
Presentation transcript:

Minimising Lifecycle Transitions in Service-Oriented Business Processes Roland Ukor and Andy Carpenter School of Computer Science, University of Manchester, UK 10 th International BPMDS Workshop, 2009

Introduction SOA based inter-organizational business processes –Service provider – consumer relationship –Outsourced business capabilities e.g. credit rating, shipping. –Web services based interaction –Arbitrarily complex interaction protocols –Services advertised in registries

Example: Order fulfillment process Order Fulfillment Process Credit Check Shipping Agency 1 Agency L1 Shipper 1 Shipper L2 Business Process (of consumer) Business CapabilityService Providers

Service Description in Registries Abstract Service Definitions (ASD) –Functional, Non-functional and Behavioral description –Interface on which process interaction is based Concrete Service Definitions (CSD) –Provider-specific description –Location and access information –Quality of Service (QoS) characteristics

Service Selection Activities Initiation and Analysis –Determine business capabilities to outsource. Discovery –Find services with required capabilities Ranking and Selection –Based on QoS metrics (e.g. cost, availability) Performance Monitoring

Service Selection and Process Lifecycle

QoS based Selection in Operation Phase Selects a CSD from discovered CSDs: –Case 1: Based on the same ASD for which the process is designed to interact. –Case 2: Based on a different ASD from that for which the process is designed to interact.

Case 2: Selection of different CSD Drivers –Performance –Context-Aware Selection Issues –Potential data and behavioral incompatibilities –Can occur for multiple instances at the same time

Addressing Compatibility Issues Direct application of compatibility notions –Bi-similarity, Behavioral congruence, Behavioral inheritance, etc –Can result in smaller than desired set of service candidates –Candidates with “good” QoS may not make the shortlist

Addressing Compatibility Issues Mediator-based compatibility –Resolves data and behavioral incompatibility using mediators –Based on incrementally defined knowledge base –Mediators can be semi-automatically generated and are reusable –Allows for manual resolution of syntactic and semantic gaps –Triggers transient lifecycle transitions –Comes at a “notional cost” Process Mediator Protocol Service

Mediator-based Compatibility Determining the “notional cost” –Structural complexity –Syntactic and structural gap: e.g. graph edit distances –Semantic gap: differences in meaning of concepts used –Policy-based constraints: e.g. delivery before payment vs. payment before delivery.

Relative Compatibility Based Selection Objective: Minimize transient lifecycle transitions –Using mediator-based compatibility Based on two principles: –Ignore marginal QoS improvements for candidates requiring mediators –Design least costly mediator with maximal impact

Ignore Marginal QoS Improvements Given a process that requires n capabilities {c 1..c n } There are two categories of candidates for each c i : –K i 0 : Candidates requiring no mediation or for which mediators already exist –K i 1 : Candidates requiring mediation but no mediator exists –All candidates K i = K i 0 U K i 1 A candidate k in K i 1 is only selected if it provides better QoS than all candidates in K i 0 enough to justify the “notional cost” of the required mediator.

Ignore Marginal QoS Improvements A candidate k  K i 1 is only selected if: –it provides better QoS than all candidates in K i 0 enough to justify the “notional cost” of the required mediator. Implementation –bias the utility of each candidate in the objective function based on the “notional cost” (cost med ij ) normalized to a value in the range [0,1]. –max Σ Σ u ij. (1 – cost med ij ). x ij u ij is the computed utility of candidate k ij  K i, and x ij = 1 if k ij is selected for c i, otherwise 0. –(1 – cost med ij ) will be neutral for candidates in K i 0

Least Costly Mediator with Maximal Impact If a candidate to be selected requires mediation, then –Design least costly mediator with maximal impact For each c i, –Let P i represent the set of protocols for all candidates in K i, where P ij is the protocol for candidate k ij

Horizontal Protocol Compatibility Two protocols P ij and P ik are horizontally compatible w.r.t. a process BP, if: –A mediator M can be designed so that BP can safely interact with services that use P ij and P ik respectively. BP M M P ij P ik Services

Least Costly Mediator with Maximal Impact If a candidate to be selected requires mediation, then –Design least costly mediator with maximal impact For each c i, –For each P ij  P i, let H ij  P i represent horizontally compatible protocols. –For each p  2 Hij, a candidate mediator M p can be designed that will support all P ik  p –Each candidate M p has a “notional cost” and coverage (e.g. |p| or weighted by no of services using protocols in |p|). –Selection of a mediator to generate can be formulated as an optimization problem based on cost and coverage.

Ongoing Work Implementation Evaluate different models for determining notional cost of constructing mediators. Modify the bias factor to take horizontal compatibility into consideration.

Conclusion Dynamic service selection is a driver of lifecycle transitions These transitions may be costly, but can be minimized using two principles for service selection and mediator design: –Ignore marginal QoS improvements –Design least costly mediators with maximal impact

Thank you!

Service Ranking and Selection Service Selection Problem is a tuple (C, Q, C Q,Q C,R) –C is the set of required capabilities –Q is the set of QoS metrics –C Q : C -> 2 Q defines the set of QoS metrics used to select a service for each c i  C. –Q C is a set of linear constraints on the QoS metrics –R is a registry containing ASDs and CSDs For each c i, –each candidate is associated with values for each m in C Q (c i )