Min Chen, and Yuhong Yan Concordia University, Montreal, Canada Presentation at ICWS 2012 June 24-29, 2012, Hawaii (Honolulu), USA Redundant Service Removal.

Slides:



Advertisements
Similar presentations
L3S Research Center University of Hanover Germany
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Refining High Performance FORTRAN Code from Programming Model Dependencies Ferosh Jacob University of Alabama Department of Computer Science
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs Jianping Li Department of Mathematics Yunnan University Jointed by M.X. Chen.
Correlation Search in Graph Databases Yiping Ke James Cheng Wilfred Ng Presented By Phani Yarlagadda.
1 Constraint operations: Simplification, Optimization and Implication.
Mahadevan Subramaniam and Bo Guo University of Nebraska at Omaha An Approach for Selecting Tests with Provable Guarantees.
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
A Robust System Architecture For Mining Semi-structured Data By Aby M Mathew CSE
BUSINESS PROCESS DESIGN: TOWARDS SERVICE-BASED GREEN INFORMATION SYSTEMS Barbara Pernici, Danilo Ardagna, Cinzia Cappiello Politecnico di Milano
Fast Matching Algorithms for Repetitive Optimization Sanjay Shakkottai, UT Austin Joint work with Supratim Deb (Bell Labs) and Devavrat Shah (MIT)
Linear-Time Reconstruction of Zero-Recombinant Mendelian Inheritance on Pedigrees without Mating Loops Authors: Lan Liu, Tao Jiang Univ. California, Riverside.
Hierarchical Constraint Satisfaction in Spatial Database Dimitris Papadias, Panos Kalnis And Nikos Mamoulis.
Dean H. Lorenz, Danny Raz Operations Research Letter, Vol. 28, No
The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
Linear Programming – Max Flow – Min Cut Orgad Keller.
NON-FUNCTIONAL PROPERTIES IN SOFTWARE PRODUCT LINES: A FRAMEWORK FOR DEVELOPING QUALITY-CENTRIC SOFTWARE PRODUCTS May Mahdi Noorian
Math – Getting Information from the Graph of a Function 1.
Social Network Analysis via Factor Graph Model
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Rohit Aggarwal, Kunal Verma, John Miller, Willie Milnor Large Scale Distributed Information Systems (LSDIS) Lab University of Georgia, Athens Presented.
C HU H AI C OLLEGE O F H IGHER E DUCATION D EPARTMENT O F C OMPUTER S CIENCE Preparation of Final Year Project Report Bachelor of Science in Computer Science.
A Framework for Distributed Model Predictive Control
1 On Querying Historical Evolving Graph Sequences Chenghui Ren $, Eric Lo *, Ben Kao $, Xinjie Zhu $, Reynold Cheng $ $ The University of Hong Kong $ {chren,
Wancai Zhang, Hailong Sun, Xudong Liu, Xiaohui Guo.
Distributed QoS Evaluation for Real- World Web Services Zibin Zheng, Yilei Zhang, and Michael R. Lyu July 07, 2010 Department of Computer.
E-Commerce Lab, CSA, IISc 1 A Combinatorial Procurement Auction for QOS-Aware Web Services Composition Megha Mohabey, Y. Narahari Computer Science and.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
Querying Structured Text in an XML Database By Xuemei Luo.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Xiao Liu CS3 -- Centre for Complex Software Systems and Services Swinburne University of Technology, Australia Key Research Issues in.
Implementation of “A New Two-Phase Sampling Based Algorithm for Discovering Association Rules” Tokunbo Makanju Adan Cosgaya Faculty of Computer Science.
A Novel Local Patch Framework for Fixing Supervised Learning Models Yilei Wang 1, Bingzheng Wei 2, Jun Yan 2, Yang Hu 2, Zhi-Hong Deng 1, Zheng Chen 2.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Automata Based Method for Domain Specific Languages Definition Ulyana Tikhonova PhD student at St. Petersburg State Politechnical University, supervised.
Presented By Dr. Mohsen Alardhi College of Technological Studies, Kuwait April 19 th,2009.
Task Graph Scheduling for RTR Paper Review By Gregor Scott.
Constraint Systems Laboratory 11/26/2015Zhang: MS Project Defense1 OPRAM: An Online System for Assigning Capstone Course Students to Sponsored Projects.
A Use Case Based Approach to Feature Models’ Construction Bo Wang, Wei Zhang, Haiyan Zhao, Zhi Jin, Hong Mei Key Laboratory of High Confidence Software.
VLDB2005 CMS-ToPSS: Efficient Dissemination of RSS Documents Milenko Petrovic Haifeng Liu Hans-Arno Jacobsen University of Toronto.
WSP: A Network Coordinate based Web Service Positioning Framework for Response Time Prediction Jieming Zhu, Yu Kang, Zibin Zheng and Michael R. Lyu The.
QoS Supported Clustered Query Processing in Large Collaboration of Heterogeneous Sensor Networks Debraj De and Lifeng Sang Ohio State University Workshop.
Surviving Failures in Bandwidth Constrained Datacenters Authors: Peter Bodik Ishai Menache Mosharaf Chowdhury Pradeepkumar Mani David A.Maltz Ion Stoica.
Towards Interoperability Test Generation of Time Dependent Protocols: a Case Study Zhiliang Wang, Jianping Wu, Xia Yin Department of Computer Science Tsinghua.
Pipelining and Retiming
COSC 5341 High-Performance Computer Networks Presentation for By Linghai Zhang ID:
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 A self-organizing map for adaptive processing of structured.
Improving Support Vector Machine through Parameter Optimized Rujiang Bai, Junhua Liao Shandong University of Technology Library Zibo , China { brj,
C HU H AI C OLLEGE O F H IGHER E DUCATION D EPARTMENT O F C OMPUTER S CIENCE Preparation of Final Year Project Report Bachelor of Science in Computer Science.
A Clustering-based QoS Prediction Approach for Web Service Recommendation Shenzhen, China April 12, 2012 Jieming Zhu, Yu Kang, Zibin Zheng and Michael.
1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Copyright © 2011, Quality-Driven Cross-Layer Optimized Video Delivery over LTE IEEE Communications Magazine, FEB 2010 Speaker: 劉姿瑾 Date: 25,
Topological relations from metric refinements Egenhofer, M. J. and Dube, M. P ACM SIGSPATIAL GIS '09 Presenter : Murat Demiray Narrative : Mustafa Karamavus.
On Combining Multi-formalism Knowledge to Select Models for Model Transformation Testing Sagar Sen (1 st year PhD student), Benoit Baudry, Jean-Marie Mottu.
Composing semantic Web services under constraints E.Karakoc, P.Senkul Journal: Expert Systems with Applications 36 (2009)
The number of procedures by type and data about rev/costs. The summary section, includes a change area, which shows the difference between the current.
Exact Algorithms via Monotone Local Search
Coverage-Directed Differential Testing of JVM Implementations
Web Development Services in USA Web Development Services in USA
Notes Over 2.1 Function {- 3, - 1, 1, 2 } { 0, 2, 5 }
Cause and Effect Graphing
DATA CACHING IN WSN Mario A. Nascimento Univ. of Alberta, Canada
An Adaptive Middleware for Supporting Time-Critical Event Response
Student name Student ID Degree program Area of specialization
On the Designing of Popular Packages
Student name Student ID Degree program
Lecture 38 Constrained Optimization
Student name Student ID Degree program Area of specialization
Presentation transcript:

Min Chen, and Yuhong Yan Concordia University, Montreal, Canada Presentation at ICWS 2012 June 24-29, 2012, Hawaii (Honolulu), USA Redundant Service Removal in QoS-aware Service Composition

Outline Background Motivation Redundant Service Removal in QoS-aware Service Composition Analysis of redundant service removal Model redundant service removal problem Redundant service removal algorithm Experiment Conclusion 2

Web Service Composition (WSC) problem : (W, D in, D out ) Composition Query: (D in, D out ) Service model Background 3 w = (in(w), out(w))

Background QoS criteria Response time Throughput Execution cost 4

QoS-aware service composition Composition Query: (D in, D out,Q) Objective: achieve both functional goals and QoS optimization The solution Service model: 5 Background w = (in(w), out(w), Q(w))

QoS-aware service composition It is widely studied in Web Service Challenge (WSC) competition. Using WSC data set, several systematic algorithms have been proposed for single QoS criterion. 6 Background

Motivation In the context of QoS-aware service composition, a solution with optimal response time (or throughput) may be not cost-optimized Redundant services may be found in the solution Removing redundant services Keeping response time (or throughput) still optimal Reducing the total execution cost of a solution. 7

A Motivating Example 8

9

Case 1: Service W 4 is removed 10

A Motivating Example Case 2: Service W 5 is removed 11

Analysis of redundant service removal Extended Direct Acyclic Graph (EDAG) An EDAG example: 12 Redundant Service Removal in QoS-aware Service Composition

Analysis of redundant service removal Key parameters: Example: 13 Redundant Service Removal in QoS-aware Service Composition

Analysis of redundant service removal Discovery of redundant services (Case 1) Example: 14 Redundant Service Removal in QoS-aware Service Composition

Analysis of redundant service removal Discovery of redundant services (Case 2) Example: 15 Redundant Service Removal in QoS-aware Service Composition

Model redundant service removal problem Variables and domains : 16 Redundant Service Removal in QoS-aware Service Composition

Model redundant service removal problem Objective function: is the minimum total cost of the solution Constrains: the solution needs to satisfy after redundancy removal 1)Initial inputs constraint: 17 Redundant Service Removal in QoS-aware Service Composition

Model redundant service removal problem Constrains: 2)Goal constraint: 3)Service invokable constraint: 4)Key outputs constraint: 18 Redundant Service Removal in QoS-aware Service Composition

Model redundant service removal problem Constraints: 5)Constraint on response time or throughput Constraint on response time Constraint on throughput 19 Redundant Service Removal in QoS-aware Service Composition

20 Redundant Service Removal in QoS-aware Service Composition Redundant service removal algorithm

Experiment Objective Compare our results with another redundancy removal method Removing redundant services from solutions with optimal response time Removing redundant services from solutions with optimal throughput Set up: Select a dataset Run our algorithms to remove redundant services Compare the results 21

22 Experiment

Conclusion Our proposed algorithm: optimizes the solution obtained by QoS-aware service composition methods taking advantage of redundancy removal Our proposed algorithm: model redundant service removal problem as a integer optimization problem 23

Thank you ! 24