A sub-graph mapping-based algorithm for virtual network allocation over flexible grid networks.
Angelo Carlier GonzalezEduardo BarraAlejandra BeghelliAriel LeivaPublished in: ICTON (2015)
Keyphrases
- fully connected
- learning algorithm
- dynamic programming
- computer networks
- network parameters
- path length
- spanning tree
- complex networks
- detection algorithm
- random walk
- probabilistic model
- k means
- optimal solution
- random graphs
- maximum flow
- objective function
- graph based algorithm
- neural network
- allocation scheme
- finding the shortest path
- scale free
- cellular networks
- network model
- computational complexity