The University of Southampton
University of Southampton Institutional Repository

Virtual network embedding under uncertainty: Exact and heuristic approaches

Virtual network embedding under uncertainty: Exact and heuristic approaches
Virtual network embedding under uncertainty: Exact and heuristic approaches
Given a physical substrate network and a collection of requests of virtual networks, the Virtual Network Embedding problem (VNE) calls for the embedding onto the physical substrate of a selection of virtual networks in such a way that the profit is maximized. The embedding corresponds to a virtual-to-physical mapping of nodes and links, subject to capacity constraints. Since, in practical scenarios, node and link demands are typically much smaller than the peak values specified in the virtual network requests, in this work we propose and investigate a robust optimization approach. This allows us to find solutions with a much larger profit which, at the same time, are guaranteed to be feasible with a high probability. To this end, we propose a robust Mixed-Integer Linear Programming (MILP) formulation for VNE, based on the well-known model of Γ-robustness. To solve larger scale instances, for which the exact approach is computationally too demanding, we also propose a MILP-based two-phase heuristic which relies on Γ-robustness.
1-8
IEEE
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Koster, AMCA
4bd4c953-3f43-4815-8609-43dd2a21f895
Tieves, Martin
dfba8a3e-6f1a-46fb-a501-d58cccd6dac1
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Koster, AMCA
4bd4c953-3f43-4815-8609-43dd2a21f895
Tieves, Martin
dfba8a3e-6f1a-46fb-a501-d58cccd6dac1

Coniglio, Stefano, Koster, AMCA and Tieves, Martin (2015) Virtual network embedding under uncertainty: Exact and heuristic approaches. In 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN). IEEE. pp. 1-8 . (doi:10.1109/DRCN.2015.7148978).

Record type: Conference or Workshop Item (Paper)

Abstract

Given a physical substrate network and a collection of requests of virtual networks, the Virtual Network Embedding problem (VNE) calls for the embedding onto the physical substrate of a selection of virtual networks in such a way that the profit is maximized. The embedding corresponds to a virtual-to-physical mapping of nodes and links, subject to capacity constraints. Since, in practical scenarios, node and link demands are typically much smaller than the peak values specified in the virtual network requests, in this work we propose and investigate a robust optimization approach. This allows us to find solutions with a much larger profit which, at the same time, are guaranteed to be feasible with a high probability. To this end, we propose a robust Mixed-Integer Linear Programming (MILP) formulation for VNE, based on the well-known model of Γ-robustness. To solve larger scale instances, for which the exact approach is computationally too demanding, we also propose a MILP-based two-phase heuristic which relies on Γ-robustness.

This record has no associated files available for download.

More information

Published date: 2015

Identifiers

Local EPrints ID: 412336
URI: http://eprints.soton.ac.uk/id/eprint/412336
PURE UUID: 3fa285b8-e250-4755-9e51-10d66ed8b01e
ORCID for Stefano Coniglio: ORCID iD orcid.org/0000-0001-9568-4385

Catalogue record

Date deposited: 17 Jul 2017 13:30
Last modified: 16 Mar 2024 04:24

Export record

Altmetrics

Contributors

Author: AMCA Koster
Author: Martin Tieves

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×