SlideShare une entreprise Scribd logo
1  sur  39
Télécharger pour lire hors ligne
Optimizing the Tradeoff between
  Discovery, Composition, and
    Execution Cost in Service
         Composition
             Authors:
   Immanuel Trummer, Boi Faltings
Presentation Plan
1. Introduction to Quality-Driven Service
   Composition
2. Tradeoff between Composition Effort and
   Solution Quality
3. Algorithm for Automatically Tuning
   Composition Effort
4. Experimental Evaluation
5. Conclusion
INTRODUCTION TO QUALITY-
DRIVEN SERVICE COMPOSITION
Problem of Quality-Driven
                          Service Composition
                    Transcoding                           Invocation-Cost: 0.15$
Video                                                     Response Time: 0.4 sec
                        WS
                     Candidates:
                       - S1,1                                                                 Compression
                                                              Merging WS
                       - S1,2                                                                    WS
                         …
                                                              Candidates:                      Candidates:
                                                                - S3,1                           - S4,1
                     Translation                                - S3,2                           - S4,2
Text
                         WS                                       …                                …
                     Candidates:
                       - S2,1
                       - S2,2
                         …



Example: «Web Services Selection for Distributed Composition of Multimedia Content», Wagner & Kellerer, 2004
Problem of Quality-Driven
                          Service Composition
                    Transcoding
Video
                        WS
                     Candidates:
                       - S1,1                                                                 Compression
                                                              Merging WS
                       - S1,2                                                                    WS
                         …
                                                              Candidates:                      Candidates:
                                                                - S3,1                           - S4,1
                     Translation                                - S3,2                           - S4,2
Text
                         WS                                       …                                …
                     Candidates:
                       - S2,1                         Goal:
                       - S2,2
                         …
                                                      - Cost < x $ per invocation
                                                      - Minimize response time

Example: «Web Services Selection for Distributed Composition of Multimedia Content», Wagner & Kellerer, 2004
Process in Quality-Driven
          Service Composition



Discovery        Optimization   Execution



     Composition Phase
TRADEOFF BETWEEN COMPOSITION
  EFFORT AND SOLUTION QUALITY
Tradeoff: Composition Effort vs.
       Solution Quality
   Optimize   Heavy load on
               Middleware

        Composition Effort


                  Tradeoff
   Adapt Dynamically!
    Quality of the Solution
              High-Priority
                              Optimize
               Workflows
Tradeoff: Composition Effort vs.
       Solution Quality


      Composition Effort


    Quality of the Solution
Tradeoff: Composition Effort vs.
              Solution Quality
C=
             Composition Effort
  CD            - Discovery Cost
+ CO          - Optimization Cost
           Quality of the Solution
+ CE            - Execution Cost
Tradeoff: Composition Effort vs.
              Solution Quality
C=
             Composition Effort
  CD            - Discovery Cost
+ CO          - Optimization Cost
           Quality of the Solution
+ CE            - Execution Cost
                       Parameter:
                 #Downloaded Services per
                          Task
Dependency: Cost and #Services
Cost




                CO
                  CD

                       #Services
Dependency: Cost and #Services
Cost



          CE

                CO
                  CD

                       #Services
Dependency: Cost and #Services
Cost

                 C

          CE

                     CO
                         CD
               Minimum
                 Cost         #Services
               Where?
ALGORITHM FOR AUTOMATICALLY
TUNING COMPOSITION EFFORT
Sketch of Iterative Algorithm
Round i:

     ∆CD,i                  ∆CO,i                       ∆CE,i
  Discovery             Optimization
 next k services/task
                               Within          ?      Execution
                        current search space




                                                    Condition for
                                                   Next Iteration?
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      ?        ∆CD,i+1

       ∆CO,i      ?        ∆CO,i+1

       ∆CE,i      ?        ∆CE,i+1
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      =        ∆CD,i+1

       ∆CO,i      ?        ∆CO,i+1

       ∆CE,i      ?        ∆CE,i+1
Growth of Search Space for
      Optimization




            Search Space
            Round i
                      Search Space
                      Round i+1
Growth of Search Space for
      Optimization




                  Search Space
                  Round i
                             Search Space
                             Round i+1


        Explored by Inefficient
         Method in Round i+1
Growth of Search Space for
      Optimization




                 Search Space
                 Round i
                            Search Space
                            Round i+1


        Explored by Efficient
        Method in Round i+1
Growth of Search Space for
              Optimization (Cont.)
 t : number of tasks
 k: new services per task and iteration

• Search Space Size in round i:

• Search Space Size in round i+1:

• Size of newly added search space:


     Size of newly added search space grows from round to round
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      =        ∆CD,i+1

       ∆CO,i      ?        ∆CO,i+1

       ∆CE,i      ?        ∆CE,i+1
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      =        ∆CD,i+1

       ∆CO,i               ∆CO,i+1

       ∆CE,i      ?        ∆CE,i+1
Ratio between Size of New and Old
          Search Space




 Ratio diminishes, big improvements unlikely at some point
Diminishing Returns
Cost



          CE




                       #Iterations
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      =        ∆CD,i+1

       ∆CO,i               ∆CO,i+1

       ∆CE,i      ?        ∆CE,i+1
Relation between Cost for Last Round
       and Cost for New Round

               Relation:
       ∆CD,i      =        ∆CD,i+1

       ∆CO,i               ∆CO,i+1

       ∆CE,i               ∆CE,i+1
Sketch of Iterative Algorithm
Round i:

     ∆CD,i                  ∆CO,i                       ∆CE,i
  Discovery             Optimization
 next k services/task
                               Within          ?      Execution
                        current search space




                                                    Condition for
                                                   Next Iteration?
Sketch of Iterative Algorithm
Round i:

     ∆CD,i                  ∆CO,i                   ∆CE,i
  Discovery             Optimization
 next k services/task
                               Within          ?   Execution
                        current search space




         Number of iterations is near-optimal
EXPERIMENTAL EVALUATION
Testbed Overview
• Starting Point:
   – Randomly generated sequential workflows with
     randomly generated quality requirements
• Discovery:
   – Randomly generated service candidates
   – Simulated registry download
• Optimization:
   – Transformation to Integer Linear Programming
     problem
   – Use of IBM CPLEX v12.1
• Verified that our initial assumptions hold
Testbed Cost Function




Represent dynamic context by changing weights
Comparison: with vs. without Tuning

                             10SPT   40SPT    70SPT     With Tuning
                  800%
                  700%
                  600%
Aggregated Cost




                  500%
                  400%
                  300%
                  200%
                  100%
                   0%
                             doe     Doe     dOe      doE       DoE   dOE   DOe
                  Scenario
Comparison: with vs. without Tuning

                             10SPT   40SPT    70SPT     With Tuning
                  800%
                  700%
                  600%
Aggregated Cost




                  500%
                  400%
                  300%
                  200%
                  100%
                   0%
                             doe     Doe     dOe      doE       DoE   dOE   DOe
                  Scenario
Comparison: with vs. without Tuning

                             10SPT   40SPT    70SPT     With Tuning
                  800%
                  700%
                  600%
Aggregated Cost




                  500%
                  400%
                  300%
                  200%
                  100%
                   0%
                             doe     Doe     dOe      doE       DoE   dOE   DOe
                  Scenario
Comparison: with vs. without Tuning

                             10SPT   40SPT    70SPT     With Tuning
                  800%
                  700%
                  600%
Aggregated Cost




                  500%
                  400%
                  300%
                  200%
                  100%
                   0%
                             doe     Doe     dOe      doE       DoE   dOE   DOe
                  Scenario
CONCLUSION
Conclusion
• Tradeoff between Composition Effort and
  Solution Quality in Service Composition
• Iterative Algorithm for Quality-Driven Service
  Composition
• Tuning of Composition Effort  Gains in
  Efficiency
• Iterative scheme is generic

Immanuel.Trummer@epfl.ch

Contenu connexe

En vedette

Practice pert gantt
Practice pert ganttPractice pert gantt
Practice pert ganttHira Farooq
 
ITFT - PROJECT MANAGEMENT
ITFT - PROJECT MANAGEMENTITFT - PROJECT MANAGEMENT
ITFT - PROJECT MANAGEMENTPooja
 
Time-Cost Trade off (Project Management)
Time-Cost Trade off (Project Management)Time-Cost Trade off (Project Management)
Time-Cost Trade off (Project Management)S. Ali Hasheminejad
 
Cpa & pert charts
Cpa & pert chartsCpa & pert charts
Cpa & pert chartsGolban Oana
 
Time cost trade off
Time cost trade offTime cost trade off
Time cost trade offsanddrap
 
Ch23-Software Engineering 9
Ch23-Software Engineering 9Ch23-Software Engineering 9
Ch23-Software Engineering 9Ian Sommerville
 
Program Evaluation and Review Technique
Program Evaluation and Review TechniqueProgram Evaluation and Review Technique
Program Evaluation and Review TechniqueRaymund Sanchez
 
Planning tools and techniques management
Planning tools and techniques managementPlanning tools and techniques management
Planning tools and techniques managementfizza tanvir
 
Project Management:Life Cycle & Phases.
Project Management:Life Cycle & Phases.Project Management:Life Cycle & Phases.
Project Management:Life Cycle & Phases.Ashutosh Mishra
 
Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Abhishek Pachisia
 
Work breakdown structure ppt
Work breakdown structure pptWork breakdown structure ppt
Work breakdown structure pptnazi2020
 

En vedette (15)

Practice pert gantt
Practice pert ganttPractice pert gantt
Practice pert gantt
 
ITFT - PROJECT MANAGEMENT
ITFT - PROJECT MANAGEMENTITFT - PROJECT MANAGEMENT
ITFT - PROJECT MANAGEMENT
 
Time-Cost Trade off (Project Management)
Time-Cost Trade off (Project Management)Time-Cost Trade off (Project Management)
Time-Cost Trade off (Project Management)
 
Cpa & pert charts
Cpa & pert chartsCpa & pert charts
Cpa & pert charts
 
Time cost trade off
Time cost trade offTime cost trade off
Time cost trade off
 
Ch23-Software Engineering 9
Ch23-Software Engineering 9Ch23-Software Engineering 9
Ch23-Software Engineering 9
 
Time cost-trade-off
Time cost-trade-offTime cost-trade-off
Time cost-trade-off
 
Program Evaluation and Review Technique
Program Evaluation and Review TechniqueProgram Evaluation and Review Technique
Program Evaluation and Review Technique
 
Planning tools and techniques management
Planning tools and techniques managementPlanning tools and techniques management
Planning tools and techniques management
 
Project Management:Life Cycle & Phases.
Project Management:Life Cycle & Phases.Project Management:Life Cycle & Phases.
Project Management:Life Cycle & Phases.
 
Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)
 
Project management and project life cycle
Project management and project life cycleProject management and project life cycle
Project management and project life cycle
 
Pert2
Pert2Pert2
Pert2
 
Work breakdown structure ppt
Work breakdown structure pptWork breakdown structure ppt
Work breakdown structure ppt
 
Project management
Project managementProject management
Project management
 

Similaire à Optimizing the Tradeoff between Discovery, Composition, and Execution Cost in Service Composition

11 transport-system
11 transport-system11 transport-system
11 transport-systemsanganiraju
 
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.A
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.AImplementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.A
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.ARay KHASTUR
 
S-CUBE LP: Using Data Properties in Quality Prediction
S-CUBE LP: Using Data Properties in Quality PredictionS-CUBE LP: Using Data Properties in Quality Prediction
S-CUBE LP: Using Data Properties in Quality Predictionvirtual-campus
 
Chris Fleece Detailed Resume
Chris Fleece Detailed ResumeChris Fleece Detailed Resume
Chris Fleece Detailed Resumecfleece
 
Exploiting Distributional Semantic Models in Question Answering
Exploiting Distributional Semantic Models in Question AnsweringExploiting Distributional Semantic Models in Question Answering
Exploiting Distributional Semantic Models in Question AnsweringPierpaolo Basile
 
Rapier Ecobuild Presentation
Rapier Ecobuild PresentationRapier Ecobuild Presentation
Rapier Ecobuild Presentationmocathe1st
 

Similaire à Optimizing the Tradeoff between Discovery, Composition, and Execution Cost in Service Composition (9)

11 transport-system
11 transport-system11 transport-system
11 transport-system
 
Solido Pvt Corner Package Datasheet
Solido Pvt Corner Package DatasheetSolido Pvt Corner Package Datasheet
Solido Pvt Corner Package Datasheet
 
Mobide2010
Mobide2010Mobide2010
Mobide2010
 
Cad Power
Cad PowerCad Power
Cad Power
 
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.A
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.AImplementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.A
Implementation of Forward Scheduling (GOS Factor) on BSC 6600 CDMA EvDO Rev.A
 
S-CUBE LP: Using Data Properties in Quality Prediction
S-CUBE LP: Using Data Properties in Quality PredictionS-CUBE LP: Using Data Properties in Quality Prediction
S-CUBE LP: Using Data Properties in Quality Prediction
 
Chris Fleece Detailed Resume
Chris Fleece Detailed ResumeChris Fleece Detailed Resume
Chris Fleece Detailed Resume
 
Exploiting Distributional Semantic Models in Question Answering
Exploiting Distributional Semantic Models in Question AnsweringExploiting Distributional Semantic Models in Question Answering
Exploiting Distributional Semantic Models in Question Answering
 
Rapier Ecobuild Presentation
Rapier Ecobuild PresentationRapier Ecobuild Presentation
Rapier Ecobuild Presentation
 

Plus de Achille Peternier

Hardware-aware thread scheduling: the case of asymmetric multicore processors
Hardware-aware thread scheduling: the case of asymmetric multicore processorsHardware-aware thread scheduling: the case of asymmetric multicore processors
Hardware-aware thread scheduling: the case of asymmetric multicore processorsAchille Peternier
 
MVisio: A Computer Graphics Platform for Virtual Reality, Science and Education
MVisio: A Computer Graphics Platform for Virtual Reality, Science and EducationMVisio: A Computer Graphics Platform for Virtual Reality, Science and Education
MVisio: A Computer Graphics Platform for Virtual Reality, Science and EducationAchille Peternier
 
Brainstorming on Web Technologies and the Pipeorgan Database
Brainstorming on Web Technologies and the Pipeorgan DatabaseBrainstorming on Web Technologies and the Pipeorgan Database
Brainstorming on Web Technologies and the Pipeorgan DatabaseAchille Peternier
 
S: a Scripting Language for High-Performance RESTful Web Services
S: a Scripting Language for High-Performance RESTful Web ServicesS: a Scripting Language for High-Performance RESTful Web Services
S: a Scripting Language for High-Performance RESTful Web ServicesAchille Peternier
 
Overseer: Low-Level Hardware Monitoring and Management for Java
Overseer: Low-Level Hardware Monitoring and Management for JavaOverseer: Low-Level Hardware Monitoring and Management for Java
Overseer: Low-Level Hardware Monitoring and Management for JavaAchille Peternier
 
Cost-Optimal Outsourcing of Applications into the Clouds
Cost-Optimal Outsourcing of Applications into the CloudsCost-Optimal Outsourcing of Applications into the Clouds
Cost-Optimal Outsourcing of Applications into the CloudsAchille Peternier
 
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...Achille Peternier
 

Plus de Achille Peternier (7)

Hardware-aware thread scheduling: the case of asymmetric multicore processors
Hardware-aware thread scheduling: the case of asymmetric multicore processorsHardware-aware thread scheduling: the case of asymmetric multicore processors
Hardware-aware thread scheduling: the case of asymmetric multicore processors
 
MVisio: A Computer Graphics Platform for Virtual Reality, Science and Education
MVisio: A Computer Graphics Platform for Virtual Reality, Science and EducationMVisio: A Computer Graphics Platform for Virtual Reality, Science and Education
MVisio: A Computer Graphics Platform for Virtual Reality, Science and Education
 
Brainstorming on Web Technologies and the Pipeorgan Database
Brainstorming on Web Technologies and the Pipeorgan DatabaseBrainstorming on Web Technologies and the Pipeorgan Database
Brainstorming on Web Technologies and the Pipeorgan Database
 
S: a Scripting Language for High-Performance RESTful Web Services
S: a Scripting Language for High-Performance RESTful Web ServicesS: a Scripting Language for High-Performance RESTful Web Services
S: a Scripting Language for High-Performance RESTful Web Services
 
Overseer: Low-Level Hardware Monitoring and Management for Java
Overseer: Low-Level Hardware Monitoring and Management for JavaOverseer: Low-Level Hardware Monitoring and Management for Java
Overseer: Low-Level Hardware Monitoring and Management for Java
 
Cost-Optimal Outsourcing of Applications into the Clouds
Cost-Optimal Outsourcing of Applications into the CloudsCost-Optimal Outsourcing of Applications into the Clouds
Cost-Optimal Outsourcing of Applications into the Clouds
 
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...
Shepherd: Node Monitors for Fault-Tolerant Distributed Process Execution in O...
 

Dernier

Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfAijun Zhang
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
OpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureOpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureEric D. Schabell
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Commit University
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1DianaGray10
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024D Cloud Solutions
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesHow to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesThousandEyes
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding TeamAdam Moalla
 

Dernier (20)

Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdf
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
OpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureOpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability Adventure
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesHow to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team
 

Optimizing the Tradeoff between Discovery, Composition, and Execution Cost in Service Composition

  • 1. Optimizing the Tradeoff between Discovery, Composition, and Execution Cost in Service Composition Authors: Immanuel Trummer, Boi Faltings
  • 2. Presentation Plan 1. Introduction to Quality-Driven Service Composition 2. Tradeoff between Composition Effort and Solution Quality 3. Algorithm for Automatically Tuning Composition Effort 4. Experimental Evaluation 5. Conclusion
  • 3. INTRODUCTION TO QUALITY- DRIVEN SERVICE COMPOSITION
  • 4. Problem of Quality-Driven Service Composition Transcoding Invocation-Cost: 0.15$ Video Response Time: 0.4 sec WS Candidates: - S1,1 Compression Merging WS - S1,2 WS … Candidates: Candidates: - S3,1 - S4,1 Translation - S3,2 - S4,2 Text WS … … Candidates: - S2,1 - S2,2 … Example: «Web Services Selection for Distributed Composition of Multimedia Content», Wagner & Kellerer, 2004
  • 5. Problem of Quality-Driven Service Composition Transcoding Video WS Candidates: - S1,1 Compression Merging WS - S1,2 WS … Candidates: Candidates: - S3,1 - S4,1 Translation - S3,2 - S4,2 Text WS … … Candidates: - S2,1 Goal: - S2,2 … - Cost < x $ per invocation - Minimize response time Example: «Web Services Selection for Distributed Composition of Multimedia Content», Wagner & Kellerer, 2004
  • 6. Process in Quality-Driven Service Composition Discovery Optimization Execution Composition Phase
  • 7. TRADEOFF BETWEEN COMPOSITION EFFORT AND SOLUTION QUALITY
  • 8. Tradeoff: Composition Effort vs. Solution Quality Optimize Heavy load on Middleware Composition Effort Tradeoff Adapt Dynamically! Quality of the Solution High-Priority Optimize Workflows
  • 9. Tradeoff: Composition Effort vs. Solution Quality Composition Effort Quality of the Solution
  • 10. Tradeoff: Composition Effort vs. Solution Quality C= Composition Effort CD - Discovery Cost + CO - Optimization Cost Quality of the Solution + CE - Execution Cost
  • 11. Tradeoff: Composition Effort vs. Solution Quality C= Composition Effort CD - Discovery Cost + CO - Optimization Cost Quality of the Solution + CE - Execution Cost Parameter: #Downloaded Services per Task
  • 12. Dependency: Cost and #Services Cost CO CD #Services
  • 13. Dependency: Cost and #Services Cost CE CO CD #Services
  • 14. Dependency: Cost and #Services Cost C CE CO CD Minimum Cost #Services Where?
  • 16. Sketch of Iterative Algorithm Round i: ∆CD,i ∆CO,i ∆CE,i Discovery Optimization next k services/task Within ? Execution current search space Condition for Next Iteration?
  • 17. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i ? ∆CD,i+1 ∆CO,i ? ∆CO,i+1 ∆CE,i ? ∆CE,i+1
  • 18. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i = ∆CD,i+1 ∆CO,i ? ∆CO,i+1 ∆CE,i ? ∆CE,i+1
  • 19. Growth of Search Space for Optimization Search Space Round i Search Space Round i+1
  • 20. Growth of Search Space for Optimization Search Space Round i Search Space Round i+1 Explored by Inefficient Method in Round i+1
  • 21. Growth of Search Space for Optimization Search Space Round i Search Space Round i+1 Explored by Efficient Method in Round i+1
  • 22. Growth of Search Space for Optimization (Cont.) t : number of tasks k: new services per task and iteration • Search Space Size in round i: • Search Space Size in round i+1: • Size of newly added search space: Size of newly added search space grows from round to round
  • 23. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i = ∆CD,i+1 ∆CO,i ? ∆CO,i+1 ∆CE,i ? ∆CE,i+1
  • 24. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i = ∆CD,i+1 ∆CO,i ∆CO,i+1 ∆CE,i ? ∆CE,i+1
  • 25. Ratio between Size of New and Old Search Space Ratio diminishes, big improvements unlikely at some point
  • 26. Diminishing Returns Cost CE #Iterations
  • 27. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i = ∆CD,i+1 ∆CO,i ∆CO,i+1 ∆CE,i ? ∆CE,i+1
  • 28. Relation between Cost for Last Round and Cost for New Round Relation: ∆CD,i = ∆CD,i+1 ∆CO,i ∆CO,i+1 ∆CE,i ∆CE,i+1
  • 29. Sketch of Iterative Algorithm Round i: ∆CD,i ∆CO,i ∆CE,i Discovery Optimization next k services/task Within ? Execution current search space Condition for Next Iteration?
  • 30. Sketch of Iterative Algorithm Round i: ∆CD,i ∆CO,i ∆CE,i Discovery Optimization next k services/task Within ? Execution current search space Number of iterations is near-optimal
  • 32. Testbed Overview • Starting Point: – Randomly generated sequential workflows with randomly generated quality requirements • Discovery: – Randomly generated service candidates – Simulated registry download • Optimization: – Transformation to Integer Linear Programming problem – Use of IBM CPLEX v12.1 • Verified that our initial assumptions hold
  • 33. Testbed Cost Function Represent dynamic context by changing weights
  • 34. Comparison: with vs. without Tuning 10SPT 40SPT 70SPT With Tuning 800% 700% 600% Aggregated Cost 500% 400% 300% 200% 100% 0% doe Doe dOe doE DoE dOE DOe Scenario
  • 35. Comparison: with vs. without Tuning 10SPT 40SPT 70SPT With Tuning 800% 700% 600% Aggregated Cost 500% 400% 300% 200% 100% 0% doe Doe dOe doE DoE dOE DOe Scenario
  • 36. Comparison: with vs. without Tuning 10SPT 40SPT 70SPT With Tuning 800% 700% 600% Aggregated Cost 500% 400% 300% 200% 100% 0% doe Doe dOe doE DoE dOE DOe Scenario
  • 37. Comparison: with vs. without Tuning 10SPT 40SPT 70SPT With Tuning 800% 700% 600% Aggregated Cost 500% 400% 300% 200% 100% 0% doe Doe dOe doE DoE dOE DOe Scenario
  • 39. Conclusion • Tradeoff between Composition Effort and Solution Quality in Service Composition • Iterative Algorithm for Quality-Driven Service Composition • Tuning of Composition Effort  Gains in Efficiency • Iterative scheme is generic Immanuel.Trummer@epfl.ch

Notes de l'éditeur

  1. QoS-Driven Composition starts from an abstract workflow template like the one I show hereExample explanationFor every task there is a set of candidate services available, same functionality, different QoS such as …Can make abstract workflow executable by assigning tasks to concrete servicesNon-functional properties of whole workflow are determined by service selectionsGoal of QoS-Driven Service Composition is to find an assignment which respects certain minimum quality requirements while optimizing othersExample GoalNP-hard
  2. QoS-Driven Composition starts from an abstract workflow template like the one I show hereExample explanationFor every task there is a set of candidate services available, same functionality, different QoS such as …Can make abstract workflow executable by assigning tasks to concrete servicesNon-functional properties of whole workflow are determined by service selectionsGoal of QoS-Driven Service Composition is to find an assignment which respects certain minimum quality requirements while optimizing othersExample GoalNP-hard
  3. Services in registry -&gt; begin by retrieving corresponding services from the registryOptimization: Algorithms used include ILP, Gas, …Executed by the middlewareAfter assigning tasks to concrete services, the workflow can be executed (not part of composition)
  4. In the context of QoS-Driven composition: 2 things importantQuality of Solution=Executable WorkflowBut also: Effort of composition, like running time (since composition requests may arrive with high frequency and one expects them to be answered without delay)Many publicastionsUnfortunately: Often cannot optimise for bothIf I want high quality, must increase composition effortIntrinsic tradeoff between themFocus of our work: Dynamically tune this tradeoffExampleHow do we tune?
  5. We associate a cost with every processing phase, the total cost as sum of individual costWe want to minimize this total costThe way in which individual costs are calculated may depend on the context and on the specific composition requestIf the middleware is overloaded then every second of composition time gets more expensiveOn the other hand, if the composed workflow has to process large amounts of data, the cost of a suboptimal solution increases for this composition requestMost of the time we assume that they are proportional to the needed run time, but generic approach
  6. We want to tune the tradeoff between composition effort and solution qualityNeed a parameter to tuneSpecific parameters vs. Generic parameter, has influence on all three phasesNot forced to download all services per taskIncrease parameter  …Lets look at a graphical representation for clarification
  7. AchsesCurbesDevelopment
  8. Total cost as sum that we want to minimizeWant to choose #services in order to reach global optimumBut it may be problematic to choose the optimal value in advanceIn particular: assuming that the variety of the workflow templates is not too restricted, how to estimate the development of execution cost without performing any discovery and optimization?Seems not possible in the general case =&gt; so we wont choose in advance and adopt an iterative approach instead
  9. SketchDownload next k service candidates for every taskSearch approximately optimal mapping with the current candidatesLook at result in order to decide whether to perform new iteration or to terminate composition and executeWe accumulate discovery and composition cost in every round – so … - but decrease execution cost, too - … negativeBut now we need a condition that tells us whether to perform new iteration or to stopIn order to formulate this condition we must use the changes in cost incured in last iteration to conclude on the cost changes to expect in the next one(look at what happened in the last round in order to predict what is going to happen in the next one)Lets look …
  10. Same number of services …Assume: download rate remains stable from one round to the nextLets look at optimizationCorrelated with size of search space
  11. This is the general formula for the size of the search spaceNow we assume that we use an efficient method which only looks at the newly added part of the search spaceBut also the size of the newly added search space grows from round to round, …
  12. And therefore we can conclude that the optimization cost will also tend to grow from round to round
  13. In average we assume here that the improvements tend to diminish, will come back to this point in the experimental evaluation
  14. We assume that the development of cost looks like thisSo the absolute value of the delta of the execution cost diminishes with growing number of iterations
  15. Wanted to find condition for executing next iteration or not
  16. The condition is: If the cost incurred in the last iteration do not exceed the improvements in execution cost, perform next iterationWith this condition, the number of iterations that is performed is in a distance of 1 to the optimum one which we proved in the paper
  17. We created a test suite in order to evaluate the assumptions we made in the beginning about the development of composition and execution cost and in order to prove that our algorithm performs better than static approaches
  18. We simulated different contexts associated with different weights and compared our self-tuning algorithm to static approaches that always download the same number of services per taskHere we show an extract from our experimental results, we averaged over 100 test cases for the figureaxes
  19. For every static method there is one scenario where it achieves at least 188% of the cost of our algorithm
  20. 188 %Shows benefits of dynamically adjusting composition effort
  21. Let me come to the conclusion