A Markov Reward Model Based Greedy Heuristic for the Virtual Network Embedding Problem.
Francesco BianchiFrancesco Lo PrestiPublished in: MASCOTS (2016)
Keyphrases
- greedy heuristic
- network structure
- np hard
- virtual world
- virtual environment
- minimum weight
- greedy algorithm
- reinforcement learning
- markov chain
- computer networks
- peer to peer
- communication networks
- network model
- network management
- learning algorithm
- augmented reality
- vector space
- wireless sensor networks
- complex networks
- lower bound
- knapsack problem
- long run
- semi markov