1 / 51

Identity Management and Resource Allocation in the Network Virtualization Environment

Identity Management and Resource Allocation in the Network Virtualization Environment. Mosharaf Chowdhury School of Computer Science University of Waterloo. Network Virtualization. Why Network Virtualization?. Internet is almost ossified

kamal
Télécharger la présentation

Identity Management and Resource Allocation in the Network Virtualization Environment

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Identity Management and Resource Allocation in the Network Virtualization Environment Mosharaf Chowdhury School of Computer Science University of Waterloo

  2. Network Virtualization

  3. Why Network Virtualization? • Internet is almostossified • Lots of band-aids and makeshift solutions (e.g., overlays) • A new architecture (aka clean-slate) is needed • Hard to come up with a one-size-fits-all architecture • Almost impossible to predict what future might unleash • Why not create an all-sizes-fit-into-one architecture instead! • Open and expandable • Coexistence of heterogeneous architectures

  4. What is Network Virtualization? • Transparent abstraction of networking platform and resources • Multiple logical interpretations of the physical characteristics • Multiple virtual networks (VNs) • Additional level of indirection • Indirect access to network resources • Resource partitioning and isolation • Physical and logical • Dynamic provisioning and configuration

  5. Network Virtualization Environment

  6. Challenges Instantiation • Concerned with issues related to successful creation of virtual networks Operations • Deals with operations of virtual networks and virtual components Management • Manages co-existing virtual networks Virtual Network Embedding Identity Management

  7. Identity Management in the Network Virtualization Environment iMark

  8. Motivation • High level of dynamism • Macro Level: Merge/Separate VNs • Micro Level: Add/Join/Migration of end hosts and virtual routers • Mobility • Geographical • Logical • Überhoming • Simultaneously connect to multiple InPs and VNs

  9. Design Principles • Separation of Identity and Location • Inherent support for mobility and Überhoming • Local Autonomy • Flexibility of naming and addressing in different VNs • Defined interfaces and mechanisms for cooperation • Global Identifier Space • Local identifiers have no end-to-end significance

  10. iMark Overview • Concepts • Identifier Spaces • Mappings • Components • Controllers • Adapters

  11. Operations: Macro Level • Federation • Multiple VNs create common administrative domain • Controller network • Hierarchy • Aggregation of mappings in representative controllers • Balanced and unbalanced

  12. Operations: Micro Level • Join • Add mappings • Lookup and Connection Setup • State setup in the network • Leave • Remove mappings • Mobility • Soft handoff

  13. Evaluation Mean Mapping Size Per Controller Mean Lookups Resolved

  14. Intra-domain Resource Allocation through Virtual Network Embedding ViNEYard

  15. Virtual Network Embedding 10 80 55 15 a a A B 10 12 22 b b c c 12 10 90 50 10 10 10 20 C D E F 15 60 85 20 17 25 e e 5 5 G H 17 d d f f 70 65 20 20

  16. Substrate Graph Augmentation ∞ a c ∞ 80 55 15 A B ∞ ∞ 22 ∞ 10 12 a 90 50 10 20 10 12 C D E F 15 b c 60 85 10 17 25 10 10 G H 17 70 65 ∞ ∞ b

  17. D-ViNE and R-ViNE For each VN request: • Augment the substrate graph • Solve the resulting LP • For each virtual node: • Calculate the probability for each meta-node to be selected for the corresponding virtual node • Selection: • D-ViNE: Select the meta-node with the highest probability • R-ViNE: Select a meta-node randomly with the calculated probability • Use MCF to map virtual edges • If the VN request is accepted • Update residual capacities of the substrate resources INITIALIZATION NODE MAPPING LINK MAPPING FINALIZATION

  18. Acceptance Ratio

  19. Revenue Vs Cost Revenue Cost

  20. Resource Utilization Node Utilization Link Utilization

  21. What have we done? What will we do? Summary

  22. Contributions • Survey of Network Virtualization (Submitted + TechReport) • Historical perspective • Categorization of existing projects • Enumeration of open problems • Identity Management Framework (IM’09) • Interoperability with flexibility to support mobility and Überhoming • Virtual Network Embedding Algorithms (INFOCOM’09) • Better embedding quality • Mathematical foundation

  23. Future Work • iMark Prototype Development • Further evaluation • Theoretical Analysis of D-ViNE and R-ViNE • Approximation factors • Economic models • Inter-domain VN embedding

  24. Collaborators • Fida-E Zaheer (iMark) • Muntasir Raihan Rahman (ViNEYard) • Network Virtualization Project Members

  25. Questions? Mosharaf Chowdhury http:// www.mosharaf.com/

  26. Backup Slides

  27. Related Concepts • Virtual Local Area Networks (VLAN) • Virtual Private Networks (VPN) • Active and Programmable Networks • Overlay Networks

  28. Downsides of Overlay Networks • Largely used as narrow fixes for specific problems • No holistic view • Most overlays are designed in the application layer • Cannot support radically different concepts Anderson et al.

  29. What is a Virtual Network (VN)? • A collection of virtual nodes and virtual links forming a virtual topology • Subset of physical topology • Basic entity of the NVE • A virtual node is hosted on a particular physical node • Multiple virtual nodes can coexist • A virtual link spans over a physical path • Includes a portion of the underlying physical resources

  30. Business Model Players Relationships • Infrastructure Providers (InP) • Manage underlying physical networks • Service Providers (SP) • Create and manage virtual networks • Deploy customized end-to-end services • End Users • Buy and use services from different service providers • Brokers • Mediators/Arbiters End User SLA Broker Service Provider EIA NPA SIA Infrastructure Provider IIA

  31. Hierarchy of Roles

  32. Basic Concepts Principles Design Goals Flexibility Manageability Scalability Isolation Stability and Convergence Programmability Heterogeneity Experimental and Deployment Facility Legacy Support • Concurrence • Recursion • Inheritance • Revisitation

  33. What is Network Virtualization? (Revisited) Network virtualization is a networking environment that allows multiple service providers to dynamically compose multipleheterogeneous virtual networks that coexist together in isolation from each other, and to deploy customizedend-to-end services on-the-fly as well as manage them on those virtual networks for the end-users by effectivelysharing and utilizing underlying network resources leased from multiple infrastructure providers.

  34. Classification • Networking technology • Targeted technology for virtualization • Layer of virtualization • Particular layer in the network stack where virtualization is introduced • Architectural domain • Specific problem domain that virtualization addresses • Level of virtualization • Granularity at which virtualization is realized

  35. Existing Projects

  36. Existing Projects (Cont.)

  37. Existing Projects (Cont.)

  38. Major Ongoing Projects

  39. Entities and Identifier Spaces Entities Identifier Spaces IDS_ISP IDS_VN IDS_VR IDS_PR IDS_EH • Service Provider • Virtual Network • Virtual Resource • Infrastructure Provider / Physical Network • Physical Resource • End User

  40. Relationships between Entities

  41. Mappings between Different Identifiers

  42. Sequence Diagram: Join

  43. Sequence Diagram: Lookup

  44. D-ViNE

  45. R-ViNE

  46. Summary of Compared Algorithms

More Related