Paper Info
Title
Using DCOP to Solve Virtual Network Allocation Problems
Abstract
Virtual Networks (VN) offer a flexible and economic approach to deploy customer suited networks. However, defining how resources of a physical network are used to support VNs demands is a NP-hard problem. For this reason, heuristics have been proposed for providing satisfactory allocation of resources in an efficient way. This work presents a modeling of the VN allocation problem using Distributed Constraint Optimization Problem (DCOP) with factor graphs. The max-sum algorithm is employed to solve the DCOP. Correctness criteria for this approach are discussed and verifications going to be conducted through model checking.
Year
DOI
Venue
2013
10.1109/WEIT.2013.17
Theoretical Computer Science
Keywords
Field
DocType
solve virtual network allocation,virtual networks,economic approach,vns demand,correctness criterion,factor graph,constraint optimization problem,np-hard problem,satisfactory allocation,max-sum algorithm,vn allocation problem,graph theory,virtualisation,formal verification,resource allocation,computer networks
Virtual network,Virtualization,Approximation algorithm,Mathematical optimization,Model checking,Computer science,Correctness,Theoretical computer science,Distributed algorithm,Heuristics,Resource allocation,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
3
Authors
4
Name
Order
Citations
PageRank
Alexander R. Gularte100.34
Odorico Machado Mendizabal2135.35
Raquel de Miranda Barbosa301.35
Diana F. Adamatti41813.61