Logo Institut für Kommunikationsnetze (E-4)
Institut für Kommunikationsnetze (E-4)
Logo Institut für Kommunikationsnetze (E-4)
Institut für Kommunikationsnetze (E-4)
EN
DE
Suche
EN
DE
Suche
ET6 > Publications

Publications

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

[117367]
Title: Virtual Network Mapping - An Optimization Problem. <em>Proceedings of the 3rdth International Conference on Mobile Networks and Management (MONAMI 2011)</em>
Written by: Marcio Melo and Jorge Carapinha and Susana Sargento and Luis Torres and Phuong Nga Tran and Ulrich Killat and Andreas Timm-Giel
in: sep (2011).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address: Aveiro, Portugal
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/75/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of di?erent networks with di?erent paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the e?cient embedding of virtual resources into physical ones. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link node formulation is used and the multi-commodity ow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show signi?cant improvements of the virtual network acceptance ratio, in average additional 10\% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network

TU Hamburg
Institut für Kommunikationsnetze (E-4)
Prof. Dr.-Ing. Andreas Timm-Giel
Am Schwarzenberg-Campus 3, Raum E1.058
21073 Hamburg
E-Mail : comnets@tuhh.de
Tel : +49 40 42878-3049/3249
Weiterführende Links
Imprint
Data Privacy
Sitemap