Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
EN
DE
Search
EN
DE
Search
ET6 > Publications

Publications

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

[117345]
Title: Optimal Mapping of Virtual Networks Considering Reactive Reconfiguration. <em>IEEE Cloudnet</em>
Written by: Phuong Nga Tran and Leonardo Casucci and Andreas Timm-Giel
in: <em>in Procedding of IEEE Cloudnet'12</em>. dec (2012).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/67/
ARXIVID:
PMID:

[www]

Note:

Abstract: Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-calledreactivereconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance.

TU Hamburg
Institute of Communication Networks (E-4)
Prof. Dr.-Ing. Andreas Timm-Giel
Am Schwarzenberg-Campus 3, Room E1.058
21073 Hamburg
E-mail : comnets@tuhh.de
Phone : +49 40 42878-3049/3249
Links
Imprint
Data Privacy
Sitemap
ComNetsHH at GitHub