Node and Link Allocation in Network Virtualization Based on Distributed Constraint Optimization

Virtual Networks (VNs) offer a flexible and economic approach to deploy customer suited networks. However, defining how resources of a physical network are used to support VNs requirements is a NP-hard problem. For this reason, heuristics have been used on mapping of virtual networks. Although heuri...

Full description

Saved in:
Bibliographic Details
Published in:Journal of network and systems management Vol. 26; no. 1; pp. 127 - 146
Main Authors: Gularte, Alexander R., Mendizabal, Odorico M., Barbosa, Raquel M., Adamatti, Diana F.
Format: Journal Article
Language:English
Published: New York Springer US 01.01.2018
Springer Nature B.V
Subjects:
ISSN:1064-7570, 1573-7705
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Virtual Networks (VNs) offer a flexible and economic approach to deploy customer suited networks. However, defining how resources of a physical network are used to support VNs requirements is a NP-hard problem. For this reason, heuristics have been used on mapping of virtual networks. Although heuristics do not ensure the optimal solution, they implement fast solutions and showed satisfactory results. This work presents a modeling of the node and link allocation problem using Distributed Constraint Optimization Problem (DCOP) with factor graphs, which is a formalism widely used in real distributed optimization problems. In our approach, we use the max-sum algorithm to solve the DCOP. Correctness criteria for this approach are discussed and verifications are conducted through model checking.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1064-7570
1573-7705
DOI:10.1007/s10922-017-9410-7