virtual network embedding with collocation
play

Virtual Network Embedding with Collocation Benefits and Limitations - PowerPoint PPT Presentation

Jan 04, 2024 •238 likes •884 views

Virtual Network Embedding with Collocation Benefits and Limitations of Pre-Clustering urst 1 , Stefan Schmid 2 , Anja Feldmann 1 Carlo F 1: TU Berlin 2: TU Berlin & Telekom Innovation Laboratories November 12, 2013 Carlo F urst (TU

  1. Virtual Network Embedding with Collocation Benefits and Limitations of Pre-Clustering urst 1 , Stefan Schmid 2 , Anja Feldmann 1 Carlo F¨ 1: TU Berlin 2: TU Berlin & Telekom Innovation Laboratories November 12, 2013 Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 1 / 21

  2. Today’s Datacenters... Multi-tenant virtualized Tenants typically pay for host resources Connectivity is guaranteed Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 2 / 21

  3. Today’s Datacenters... Multi-tenant virtualized Tenants typically pay for host resources Connectivity is guaranteed Problem [Ballani’11]: Studies have shown that the intra-cloud bandwidth can vary by an order of magnitude. ⇒ Unpredictable application performance Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 2 / 21

  4. Remove the uncertainty ? ? Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 3 / 21

  5. Remove the uncertainty Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 3 / 21

  6. Outline Explain model and problem Identify the impact of the collocation option on embedding algorithms Introduce Pre-Clustering - a technique to enable any existing algorithm to generate collocated embeddings Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 4 / 21

  7. Virtual Network Embedding Problem Physical Machine Physical Link Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  8. Virtual Network Embedding Problem Physical Machine - Abstract aggregated "Compute Resource" Physical Link - Bandwidth Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  9. Virtual Network Embedding Problem Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  10. Virtual Network Embedding Problem Virtual Link Virtual Node Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  11. Virtual Network Embedding Problem Virtual Link - Requested Compute Units Virtual Node - Requested Bandwidth Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  12. Virtual Network Embedding Problem Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 5 / 21

  13. What is a ‘good’ mapping? Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 6 / 21

  14. What is a ‘good’ mapping? Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 6 / 21

  15. Existing Solutions Many existing mapping algorithms ViNE [CHOWDHURY, Infocom 2009] SecondNet [GUO, Co-NEXT 2010] Oktopus [BALLANI, Sigcomm 2011] Isomorphism Detection [LISCHKA, Sigcomm 2009] Various Mixed-Integer-Programs . . . Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 7 / 21

  16. Existing Solutions Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 7 / 21

  17. Existing Solutions Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 7 / 21

  18. Collocated Mappings Physical Machine with capacity 2 Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 8 / 21

  19. Collocated Mappings Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 8 / 21

  20. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  21. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  22. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  23. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  24. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  25. Benchmarking Algorithm: LoCo Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  26. Benchmarking Algorithm: LoCo Backtrack on failure Backtrack only over possible start nodes Graph exploration is directed by node / link resource requests Avoid Backtracking by forward checking Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 9 / 21

  27. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  28. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Add Requests Until: Sum of requested node resources = Sum of substrate node resources Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  29. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Measure node utilization Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  30. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Increase time until a Request expires Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  31. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Add Requests Until: ... Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  32. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Substrate Topologies FatTree Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  33. Evaluation Setup ADD REQ1 ADD REQ2 ADD REQ3 REM REQ1 ADD REQ4 STATE Request ... sequence Substrate Topologies FatTree Unmodified Requests Embed. SNet LoCo Algorithm Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 10 / 21

  34. Impact of the collocation option Slight Impact 1.0 ● ● ● ● ● ● 0.8 ● Node Utilization ● 0.6 0.4 0.2 0.0 Loco SecondNet Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 11 / 21

  35. Impact of the collocation option Slight Impact Strong Impact 1.0 1.0 ● ● ● ● ● ● 0.8 ● 0.8 Node Utilization ● 0.6 0.6 0.4 0.4 0.2 0.2 ● ● ● ● ● ● ● ● ● ● ● ● ● ● 0.0 0.0 Loco SecondNet Loco SecondNet Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 11 / 21

  36. Impact of the collocation option Slight Impact Strong Impact Average Impact 1.0 1.0 1.0 ● ● ● ● ● ● 0.8 ● 0.8 0.8 Node Utilization ● ● ● ● 0.6 0.6 0.6 ● 0.4 0.4 0.4 ● ● 0.2 0.2 0.2 ● ● ● ● ● ● ● ● ● ● ● ● ● ● 0.0 0.0 0.0 Loco SecondNet Loco SecondNet Loco SecondNet Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 11 / 21

  37. Can we leverage the benefits of collocation with the existing algorithms?

  38. Pre-Clustering Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 13 / 21

  39. Pre-Clustering Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 13 / 21

  40. Pre-Clustering 4 4 3 1 Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 13 / 21

  41. Pre-Clustering We use: Farhat LoCo OptCut (runtime optimized MIP) Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 13 / 21

  42. LoCo Preclustering Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 14 / 21

  43. LoCo Preclustering Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 14 / 21

  44. LoCo Preclustering 2 Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 14 / 21

  45. OptCut Generates an optimal (w.r.t. the amount of link resources between the merged nodes) Pre-Clustering Substrate is represented by two numbers: ◮ MAX V : The estimated host resources of a node ◮ MAX E : The estimated link resources attached to a node ⇒ run time independent of substrate size and topology Removes symmetry from the problem to speed up the solution process Carlo F¨ urst (TU Berlin) Virtual Network Embedding with Collocation November 12, 2013 15 / 21

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Virtual Network Embedding with Collocation Benefits and Limitations of Pre-Clustering urst 1 ,

Virtual Network Embedding with Collocation Benefits and Limitations of Pre-Clustering urst 1 ,

Virtual Network Embedding with Collocation Benefits and Limitations of Pre-Clustering urst 1 , Stefan Schmid 2 , Anja Feldmann 1 Carlo F 1: TU Berlin 2: TU Berlin & Telekom Innovation Laboratories November 12, 2013 Carlo F urst (TU

1.18k views • 65 slides
Approximating the Virtual Network Embedding Problem: Theory and Practice 2 5 3 AC B 2 2 2

Approximating the Virtual Network Embedding Problem: Theory and Practice 2 5 3 AC B 2 2 2

Approximating the Virtual Network Embedding Problem: Theory and Practice 2 5 3 AC B 2 2 2 2 D 0 3 1 23rd International Symposium on Mathematical Programming 2018 Bordeaux, France Matthias Rost Technische Universitt Berlin,

1.17k views • 90 slides
PageRankVM A PageRank Based Algorithm with Anti-Collocation Constraints for Virtual Machine

PageRankVM A PageRank Based Algorithm with Anti-Collocation Constraints for Virtual Machine

PageRankVM A PageRank Based Algorithm with Anti-Collocation Constraints for Virtual Machine Placement in Cloud Datacenters Zhuozhao Li Haiying Shen Cole Miles University of Virginia July 3, 2018 1 / 19 Virtual Machine Placement In a cloud

772 views • 38 slides
A Decomposi+on-Based Architecture for Distributed Virtual Network

A Decomposi+on-Based Architecture for Distributed Virtual Network

A Decomposi+on-Based Architecture for Distributed Virtual Network Embedding Flavio Esposito Ibrahim Ma2a Advanced Technologies Computer Science Department

812 views • 53 slides
PolyViNE: Pol ic y based Vi rtual N etwork E mbedding Across Multiple Domains Presented by Fady

PolyViNE: Pol ic y based Vi rtual N etwork E mbedding Across Multiple Domains Presented by Fady

PolyViNE: Pol ic y based Vi rtual N etwork E mbedding Across Multiple Domains Presented by Fady and Mosharaf Virtual Network Embedding Mapping of virtual network (VN) requirements onto physical network resources Virtual Node Physical

177 views • 14 slides
Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates. 0 1 3 4 1 1 0 2 5 2

541 views • 18 slides
Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns

Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns

Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates. 0 1 3 4 1 1 0 2 5 2 5

754 views • 18 slides
Network Embedding Social and Technological Networks Rik Sarkar University of Edinburgh, 2019.

Network Embedding Social and Technological Networks Rik Sarkar University of Edinburgh, 2019.

Network Embedding Social and Technological Networks Rik Sarkar University of Edinburgh, 2019. Network Embedding Definition Assignment of a coordinate to each node f(v) gives the coordinates of node v In d dimensional space

543 views • 26 slides
Network 17 th July 2019 Agenda Welcome & introductions Embedding evaluation into practice -

Network 17 th July 2019 Agenda Welcome & introductions Embedding evaluation into practice -

Regional Impact Network 17 th July 2019 Agenda Welcome & introductions Embedding evaluation into practice - training Break Embedding evaluation into practice action planning Creative ways to become a learning organisation London

713 views • 46 slides
IEEE GLOBECOM 2015, San Diego, CA Towards Min-Cost Virtual

IEEE GLOBECOM 2015, San Diego, CA Towards Min-Cost Virtual

IEEE GLOBECOM 2015, San Diego, CA Towards Min-Cost Virtual Infrastructure Embedding AHSN-I-2: Design and Next Generation Network II Ruozhou Yu,

431 views • 5 slides
Virtual Private Networks with tjnc 1 Motjvatjon VPN, Virtual Private Network Extend

Virtual Private Networks with tjnc 1 Motjvatjon VPN, Virtual Private Network Extend

create your own exercise Hugues Fafard, Markus Mller Virtual Private Networks with tjnc 1 Motjvatjon VPN, Virtual Private Network Extend private network over public ones Useful for companies Remote access Network bridging

256 views • 9 slides
Joint Network and Edge-To-Vertex Graph Embedding Ilya Makarov , Ksenia Korovina and L.E. Zhukov

Joint Network and Edge-To-Vertex Graph Embedding Ilya Makarov , Ksenia Korovina and L.E. Zhukov

Joint Network and Edge-To-Vertex Graph Embedding Ilya Makarov , Ksenia Korovina and L.E. Zhukov Our survey We consider new formulation of graph embedding algorithm , while learning nodes and edges vector representation under common

373 views • 22 slides
Survivable and Bandwidth- Guaranteed Embedding of Virtual Clusters in Cloud Data Centers Ruozhou

Survivable and Bandwidth- Guaranteed Embedding of Virtual Clusters in Cloud Data Centers Ruozhou

IEEE INFOCOM 2017 Datacenter Networks 1 Survivable and Bandwidth- Guaranteed Embedding of Virtual Clusters in Cloud Data Centers Ruozhou Yu , Guoliang Xue, and Xiang Zhang Arizona State University Dan Li Tsinghua University 1/25 Outlines q

314 views • 28 slides
Network Embedding Introductory Talk by Akash Anil Research Scholar OSINT Lab Dept. of Computer

Network Embedding Introductory Talk by Akash Anil Research Scholar OSINT Lab Dept. of Computer

Network Embedding Introductory Talk by Akash Anil Research Scholar OSINT Lab Dept. of Computer Science & Engineering Indian Institute of Technology Guwahati September 11, 2019 Akash Anil Network Embedding September 11, 2019 1 / 25

307 views • 29 slides
Virtual Class Enhanced Discriminative Embedding Learning Binghui Chen, Weihong Deng, Haifeng Shen

Virtual Class Enhanced Discriminative Embedding Learning Binghui Chen, Weihong Deng, Haifeng Shen

Virtual Class Enhanced Discriminative Embedding Learning Binghui Chen, Weihong Deng, Haifeng Shen BUPT & DiDi 32nd Conference on Neural Information Processing Systems (NeurIPS), 2018, Montral, Canada. Observation & Motivation

224 views • 11 slides
Optimization-Based Control: Direct Collocation Methods for Trajectory and Policy Optimization CS

Optimization-Based Control: Direct Collocation Methods for Trajectory and Policy Optimization CS

Optimization-Based Control: Direct Collocation Methods for Trajectory and Policy Optimization CS 287: Advanced Robotics, Fall 2019 Guest Lecture Igor Mordatch Overview Previously: Locally optimal control (shooting vs. collocation)

1.54k views • 138 slides
Synchrotron Light Source Rohan Dowd Presented by Eugene Tan Overview Machine overview

Synchrotron Light Source Rohan Dowd Presented by Eugene Tan Overview Machine overview

Vertical Emittance Tuning at the Australian Synchrotron Light Source Rohan Dowd Presented by Eugene Tan Overview Machine overview LOCO method and minimisation technique Minimisation results and Measurements Sextupole

413 views • 16 slides
Weakly-Supervised Temporal Localization via Occurrence Count Learning Julien Schroeter

Weakly-Supervised Temporal Localization via Occurrence Count Learning Julien Schroeter

Weakly-Supervised Temporal Localization via Occurrence Count Learning Julien Schroeter schroeterj1@cardiff.ac.uk Dr Kirill Sidorov Prof David Marshall C ONTEXT Temporal Localization DNN Weakly-Supervised Temporal Localization via Occurrence

1.46k views • 128 slides
CS452/652 Real-Time Programming Course Notes Daniel M. Berry, Cheriton School of Computer

CS452/652 Real-Time Programming Course Notes Daniel M. Berry, Cheriton School of Computer

CS452/652 Real-Time Programming Course Notes Daniel M. Berry, Cheriton School of Computer Science University of Waterloo 2007 Daniel M. Berry Real-Time Programming: Trains Pg. 1 Real-Time Java Java was originally designed to run

883 views • 77 slides
(Non-) Linear Optics studies at IOTA M. Hofer , R. Toms michael.hofer@cern.ch Acknowledgments:

(Non-) Linear Optics studies at IOTA M. Hofer , R. Toms michael.hofer@cern.ch Acknowledgments:

(Non-) Linear Optics studies at IOTA M. Hofer , R. Toms michael.hofer@cern.ch Acknowledgments: S. Antipov, M. Benedikt, F.Carlier, J. Dilly, E. Fol, E.H. Maclean, L. Malina, T.H.B. Persson, J. Coello de Portugal, A. Garcia-Tabares, G.

341 views • 9 slides
Starting, Maintaining and Expanding Ubuntu Hours by iheartubuntu What is an Ubuntu Hour?

Starting, Maintaining and Expanding Ubuntu Hours by iheartubuntu What is an Ubuntu Hour?

Starting, Maintaining and Expanding Ubuntu Hours by iheartubuntu What is an Ubuntu Hour? Ubuntu Hours are simply a local public get together to help promote Ubuntu and it is easy to do Starting a new Ubuntu Hour locate like minded Ubuntu

181 views • 6 slides
PAUL JACKSON ESQ., OBE DOVETAIL GAMES 100% STEAM. HOW DOVETAIL GAMES STEAM-ONLY POLICY HAS

PAUL JACKSON ESQ., OBE DOVETAIL GAMES 100% STEAM. HOW DOVETAIL GAMES STEAM-ONLY POLICY HAS

PAUL JACKSON ESQ., OBE DOVETAIL GAMES 100% STEAM. HOW DOVETAIL GAMES STEAM-ONLY POLICY HAS BUILT THE FOUNDATION FOR A NEW TYPE OF VIDEOGAME BUSINESS Formed as Railsimulator.com in 2009 Developer and publisher of the Worlds #1

645 views • 20 slides
Reduced Order Methods for Environmental Marine Problems by Optimal Flow Control M. Strazzullo, F.

Reduced Order Methods for Environmental Marine Problems by Optimal Flow Control M. Strazzullo, F.

Reduced Order Methods for Environmental Marine Problems by Optimal Flow Control M. Strazzullo, F. Ballarin, R. Mosetti and G. Rozza MathLab, Mathematics Area, SISSA International School for Advanced Studies, Trieste, Italy OGS, National

295 views • 5 slides
Bidimensional Golomb Codes and Lossless Image Compression Pablo Rotondo pabloedrot@gmail.com

Bidimensional Golomb Codes and Lossless Image Compression Pablo Rotondo pabloedrot@gmail.com

Bidimensional Golomb Codes and Lossless Image Compression Pablo Rotondo pabloedrot@gmail.com Universidad de la Rep ublica, Uruguay SP Coding School, 19-30 January, 2015 Golomb Codes Geometric Distribution A random variable X is said to be

252 views • 6 slides

More recommend