2009-03-28

Lab seminar

Towards A Maximum-Flow-Based Ser-vice Composition

(for Multiple & Concurrent Service Composition)

Han, Sang Woo

Networked Media Lab.

Dept. of Information and Communications

Gwangju Institute of Science and Technology

Contents

Ph.D. Research Topics Introduction

Motivation Related Work Research Outline

Proposed Service Composition Scheme System Model & Problem Statement Problem Solving Methods

Discussion Summary

Workflow-driven Control and Management Framework for Dynamic Service Composi-tion Hierarchical Abstraction Structure for Programmable

Network and Computing Environments Workflow-driven Dynamic Service Composition Capability-based Service Matchmaking and Negotiation

Ph.D. Research Topics

Mobile multimedia services Live media streaming Personalized internet broadcasting Multi-party video conferencing Full Web Browsing

Challenges QoS support between devices having

heterogeneous network & device capa-bility

Live Content Sharingover Mobile P2P Networks

Mobile P2P Net-

works

Your Content Your FriendsYour Device

Media Con-

sumers

Media Produc-

ers

capability gap

QoS-aware service composi-

tion

BCP (bounded compo-sition probing proto-col)

Hop-by-hop probing processing & optimal composition selection

Not supporting multi-ple composition in same time

[HPDC 04] Spidernet: An integrated peer-to-peer service composition framework

SeSCo (seamless service composition)

Hierarchical service over-lay network configuration

Discovery + matching + coordination

[MSC-WS@ACM MM 05] Seamless Service Com-position (SeSCo) in Pervasive Environments

Goal Multiple & concurrent service composition (modeling)

Challenges Existing schemes does not consider multiple & concurrent service composi-

tion Thus, next composition requests have to be blocked in processing a composi-

tion job composition processing time become longer!

Approach Casting the composition problem into maximum flow network problem

Multiple sources, multiple sinks Possible maximum flow out of certain sources or into all sinks

Expected Result Automated Service Composition Graph (in Polynomial-Time)

Research Outline

Media-Service-Oriented Virtualized Comput-ing & Networking Testbed

Networked Cameras Storage service

Telecommunication service

Video producing service

Web serversReplica facilities

Content servers

Encoding, transcoding, and decoding services

Presence service

Use Case

1) request for interactive broadcasting

Apps portal

2) posting & announce-ment

3) application-on-demand5) quotation6) reservation & payment8) commit

Transcoding service

Video scal-ing service

Text em-bedding service

Multicast connector

service

network services offered by service providers

4) query & negotia-tion

Application #1

7) service path reser-vation & payment

Application #2

Application #3

interactive & personalized broadcasting users

4K cinema

video conferencing

content providers

Service path 1

…

multimedia mashup

Preliminary System Model

Application Testbed Topology

Input: Multiple applications and testbed topology Output: The graphs of service composition for the applications

(DHT-based) Service DiscoveryService Instantiating (ac-

cording to # of apps)

Step 1. Service Finding

Step 2. Configuring Network Unit Capacity Maximum Flow Network

Step 3. Service Paths Finding

Input: Graph G with flow capac-ity c, a source node s, and a sink node t

Output: A flow f from s to t which is a maximum

1. f(u,v) 0 for all edges (u,v)

2. While there is a path p from s to t in Gf, such that cf(u,v)>0 for all edges (u,v)

∈ p:

1. f(u,v) f(u,v) + cf(p)

2. f(v,u) f(v,u) – cf(p)

Service Path FindingUsing Maximum Flow Algorithm

Ford-Fulkerson Algorithm

How to evaluate? To measure service composition processing time per application in large-scale

virtualized computing & networking testbed Need more criteria…

Network capacities consideration System model update using weighted maximum flow algorithm

Adaptive composition Feedback-driven resource/service adaptation

Stabilization in dynamic situation Load balancing

Complex application design Workflow-pattern-based specification

Discussion

Summary

Preliminary system model for multiple & concurrent service composition

Service composition approach based on network op-timization method

Haven’t I done an evaluation yet.

J. Jin and K. Nahrstedt, “Source-based QoS Service Routing in Distrib-uted Service Networks,” in Proc. ICC, Paris, France, 2004.

N. J.A. Harvey, R. E. Ladner, L. Lovász, and T. Tamir, “Semi-matchings for Bipartite Graphs and Load Balancing,” Algorithms and Data Struc-tures, 2003.

L. R. Ford, and D. R. Fulkerson, “Solving the Transportation Problem,” Management Science, Vol. 3, pp. 24-32.

S. Kalasapur, M. Kumar, and B. Shirazi, “Seamless service composition (SeSCo) in pervasive environments,” in Proc. ACM int’l workshop on Multimedia Service Composition, New York, NY, 2005.

X. Gu and K. Nahrstedt, “Distributed Multimedia Service Composition with Statistical QoS Assurances,” IEEE Trans. on Multimedia, Vol. 8, No. 1, Feb. 2006.

References