Dynamic node allocation in Network Virtualization

Abstract : Network virtualization is a new technology that provides a transparent abstraction of the networking resources. The most important challenge in network virtualization is the allocation of the physical substrate network among the pool of the active virtual networks (VNs). Our work in progress aims at allocating the node resources in a virtualized networking infrastructure. We believe that this allocation should be dynamic to lead to higher performance and better utilization of the physical resources. In this paper, we propose two models for dynamic node allocation for multiple VNs. The first model uses game theory and market-based approach in order to better allocate the physical node. The second one proposes a dynamic weighted round robin (WRR) approach where each VN receives a fraction of the physical node according to an estimation of its current number of waiting packets and its weight. Both models use a distributed approach to minimize the packet delays inside the physical router and to fairly allocate the nodes between different VN.
Document type :
Poster communications
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00877580
Contributor : M. Said Seddiki <>
Submitted on : Monday, October 28, 2013 - 8:16:28 PM
Last modification on : Thursday, February 7, 2019 - 5:34:40 PM
Long-term archiving on : Wednesday, January 29, 2014 - 4:50:02 AM

File

Dynamic.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00877580, version 1

Collections

Citation

M. Said Seddiki, Ye-Qiong Song, Mounir Frikha. Dynamic node allocation in Network Virtualization. HPCS - The 2013 International Conference on High Performance Computing & Simulation - 2013, Jul 2013, Helsinki, Finland. 2013. ⟨hal-00877580⟩

Share

Metrics

Record views

795

Files downloads

795