QoS-Aware Service Selection in Geographically Distributed Clouds

Similar documents
Virtual Network Embedding with Substrate Support for Parallelization

Heterogeneous Community-based Routing in Opportunistic Mobile Social Networks

A Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs

On the Design and Analysis of Data Center Network Architectures for Interconnecting Dual-Port Servers. Dawei Li and Prof. Jie Wu Temple University

Homing Spread: Community Home-based Multi-copy Routing in Mobile Social Networks

Fault-Aware Flow Control and Multi-path Routing in Wireless Sensor Networks

Networking Cyber-physical Applications in a Data-centric World

Remotely Sensed Image Processing Service Automatic Composition

STLAC: A Spatial and Temporal Locality-Aware Cache and Networkon-Chip

Mutually Exclusive Data Dissemination in the Mobile Publish/Subscribe System

Outsourcing Privacy-Preserving Social Networks to a Cloud

Temporally Adaptive A* Algorithm on Time Dependent Transportation Network

Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning

Correlation based File Prefetching Approach for Hadoop

Clock-Based Proxy Re-encryption Scheme in Unreliable Clouds

Task Scheduling Techniques for Minimizing Energy Consumption and Response Time in Cloud Computing

Live Streaming with Content Centric Networking

Channel Dynamics Matter: Forwarding Node Set Selection in Cognitive Radio Networks

Multi-resource Energy-efficient Routing in Cloud Data Centers with Network-as-a-Service

Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs

Enhancing Quality of Service in Software-Defined Networks

Empirical Evaluation of Latency-Sensitive Application Performance in the Cloud

A SDN Approach to Spectrum Brokerage in Infrastructure-based Cognitive Radio Networks

A Joint Replication-Migration-based Routing in Delay Tolerant Networks

Cooperative Mobile Internet Access with Opportunistic Scheduling

RAIDER: Responsive Architecture for Inter-Domain Economics and Routing

Become a MongoDB Replica Set Expert in Under 5 Minutes:

Efficient Path Finding Method Based Evaluation Function in Large Scene Online Games and Its Application

Research on Heterogeneous Communication Network for Power Distribution Automation

Interactive RGB-D Image Segmentation Using Hierarchical Graph Cut and Geodesic Distance

How Important is Location in Saliency Detection

Energy-aware Scheduling for Frame-based Tasks on Heterogeneous Multiprocessor Platforms

Cost Reduction in Hybrid Clouds for Enterprise Computing

Network-Aware Resource Allocation in Distributed Clouds

Community-Aware Opportunistic Routing in Mobile Social Networks

An Economical and SLO- Guaranteed Cloud Storage Service across Multiple Cloud Service Providers Guoxin Liu and Haiying Shen

A Multi-Tenant Framework for Multimedia Conference System

Social-Aware Routing in Delay Tolerant Networks

Cross Clock-Domain TDM Virtual Circuits for Networks on Chips

Risk-Aware Rapid Data Evacuation for Large- Scale Disasters in Optical Cloud Networks

Easy Ed: An Integration of Technologies for Multimedia Education 1

Optimizing Web Service Composition in Parallel

Backbone Discovery In Thick Wireless Linear Sensor Netorks

Efficient Topology Discovery and Routing in Thick Wireless Linear Sensor Networks

Application Provisioning in Fog Computingenabled Internet-of-Things: A Network Perspective

Throughput and Fairness-Aware Dynamic Network Coding in Wireless Communication Networks

Map Producing and Publishing based on the Digital Workflow

Follow Me Cloud and Virtualization of (Multimedia) Services and Applications: Challenges and Possible Solutions

Introduction to Distributed Systems. INF5040/9040 Autumn 2018 Lecturer: Eli Gjørven (ifi/uio)

Application-Aware Network INTRODUCTION: IT CHANGES EVOLVE THE NETWORK. By Zeus Kerravala -

Design of Distributed Data Mining Applications on the KNOWLEDGE GRID

Switching and Forwarding

Synergy: Quality of Service Support for Distributed Stream Processing Systems

GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction

A Multicast Routing Algorithm for 3D Network-on-Chip in Chip Multi-Processors

An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks

5G Network Slicing: Use Cases & Requirements

Fault Resilience of Structured P2P Systems

Setting the Scene. Reference: draft-arkko-arch-virtualization-01. Arkko, Tantsura, Halpern, Varga + numerous contributors

SD-WAN 101: YOUR ULTIMATE GUIDE TO SD-WAN

On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering

MLS An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer

A Survey on Routing Issues and Associated Protocols for Best-effort Delivery in IP Networks

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007.

Workflow, Planning and Performance Information, information, information Dr Andrew Stephen M c Gough

MULTI-LAYER VIDEO STREAMING WITH HELPER NODES USING NETWORK CODING

September General Characterization Parameters for Integrated Service Network Elements. Status of this Memo

SEA: Stable Resource Allocation in Geographically Distributed Clouds

The Impact of SOA Policy-Based Computing on C2 Interoperation and Computing. R. Paul, W. T. Tsai, Jay Bayne

CSE 4/60373: Multimedia Systems

Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Classes

Query-Sensitive Similarity Measure for Content-Based Image Retrieval

A New Method Of VPN Based On LSP Technology

HCBE: Achieving Fine-Grained Access Control in Cloud-based PHR Systems

Improvement of AODV Routing Protocol with QoS Support in Wireless Mesh Networks

A Finite State Mobile Agent Computation Model

An E cient Content Delivery Infrastructure Leveraging the Public Transportation Network

RTP. Prof. C. Noronha RTP. Real-Time Transport Protocol RFC 1889

Part I: Future Internet Foundations: Architectural Issues

Lecture 1 Overview - Data Communications, Data Networks, and the Internet

Routing Protocol with Quality Optimization for Vehicular Ad Hoc Networks

Presenter: Wei Chang4

A Business Aware Transaction Framework for Service Oriented Environments

Considerations on Network Virtualization and Slicing

A Configuration Management Model on the High-speed Networks

CPU Scheduling: Part I ( 5, SGG) Operating Systems. Autumn CS4023

Lecture 19 Shortest Path vs Spanning Tree Max-Flow Problem. October 25, 2009

CLSH: Cluster-based Locality-Sensitive Hashing

Consolidating Complementary VMs with Spatial/Temporalawareness

Semantic SOA - Realization of the Adaptive Services Grid

NETWORK VIRTUALIZATION: PRESENT AND FUTURE

Abstract /08/$ IEEE 601

Self Checking Network Protocols: A Monitor Based Approach

Knowledge Discovery Services and Tools on Grids

End-to-end QoS negotiation in network federations

Advanced Network Design

PCE. Path Computation Element (PCE)

MOVE TO A FLEXIBLE IT MODEL ENTERPRISE DATA CENTER SOLUTIONS.

6th International Workshop on OMNeT++

Low Latency MPEG-DASH System over HTTP 2.0 and WebSocket

Transcription:

WiMAN 2013 QoS-Aware Service Selection in Geographically Distributed Clouds Xin Li *, Jie Wu, and Sanglu Lu * * State Key Laboratory for Novel Software Technology, Nanjing University, China Department of Computer and Information Science, Temple University, USA ICCCN 2013 1

Outline Background and Motivation Problem Statement Our Approach Evaluation 2013/8/5 2

Background Cloud service More and more services are accessible with the growth of cloud computing. Functional simplicity It is functional limited for a single service. How can we effectively utilize the plentiful services? Service composition An effective way to utilize the plentiful services, and compensates for the simplicity of single service. 2013/8/5 3

Service Composition To accomplish an integrated task, many basic processing units are composed to achieve the complicated job. Service (functional) component The basic processing unit An example of service composition for multimedia delivery 2013/8/5 4

Functional Graph functional edge 2013/8/5 5

Motivation The opportunity For service provider: rent the existing single services from various clouds, and provide some complex integrated services to users. The challenge Functional equivalent service instances Service instance: an implementation of a service component Same function but different features, e.g. execution time Cost limitation The quality of service instances 2013/8/5 6

The Problem Problem description Select a set of service instances such that the composed service offers the best quality under given functional graph. An instantiation for the functional graph 2013/8/5 7

The Problem F 1 F 2 F 3 cloud (instance) user We are here! 2013/8/5 8

Instantiation of Functional Graph functional component functional edge abstract level concrete level data flow network link service instance 2013/8/5 9

Abstract Level & Concrete Level 2013/8/5 10

Quality of Service Instance Set How to judge the quality of a set of instances? Quality of an instance set QoS (quality of service) Objective: best quality The minimal expected response time for all users Network model How to measure the network latency between two locations? Network Coordinate System (NCS) 2013/8/5 11

Network Coordinate System (NCS) 2013/8/5 12

Rethink the Problem Objective Minimize the response time Network latency Execution time However, the response time varies User location For users located on different locations, the network latency varies. Functional path selection Given functional graph, there will be multiple functional paths, the response time varies as the path selection. For some user, there is a probability distribution to determine which path will be selected, according to the context. 2013/8/5 13

Delay of Data Flow A data flow is an instantiation of a functional path. The delay of a data flow consists of two parts Network latency For all of the network links (functional edges) Execution time For all service instances (functional component) 2013/8/5 14

Case for One Data Flow 2013/8/5 15

Response Time (1) 2013/8/5 16

Response Time (2) The data flow with minimal delay will be selected to execute the service for given user. 2013/8/5 17

Response Time (3) 2013/8/5 18

Quality of Service Instance Set minimal. 2013/8/5 19

Algorithms Simple case One instance for each functional component General case Multiple instances for each functional component Limitation for the total number of instances 2013/8/5 20

Simple Case 2013/8/5 21

Simple Case - Algorithm Initial (Terminal) component selection Selected in greedy manner, according to the user distribution. The facility location problem. Source Destination (flow selection) From initial component to terminal component The shortest part problem Each instance has an executing time 2013/8/5 22

General Case 2013/8/5 23

General Case - Algorithm 2013/8/5 24

Evaluation Simulation Setup Random algorithm 2013/8/5 25

Result Simple Case 2013/8/5 26

Result General Case The voting algorithm and the random algorithm have the same result, when all instances are selected. (red line) 2013/8/5 27

Conclusion Service selection A set of service instances with guaranteed quality. Quality of selected instances Network latency Data flow delay Response time Algorithm Simple case General case 2013/8/5 28

QoS-Aware Service Selection in Geographically Distributed Clouds Thanks! Xin Li *, Jie Wu, and Sanglu Lu * * State Key Laboratory for Novel Software Technology, Nanjing University, China Department of Computer and Information Science, Temple University, USA ICCCN 2013 29