Resource competition in virtual network embedding

DOI10.1080/15326349.2020.1858875zbMath1473.90047OpenAlexW3115372987MaRDI QIDQ4994071

Jing Fu, Chenchen Xing, William Moran, Peter G. Taylor

Publication date: 14 June 2021

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349.2020.1858875

zbMATH Keywords

virtual network embeddingrestless multi-armed bandit problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Internet topics (68M11)

Uses Software

• BRITE

Cites Work

• Unnamed Item
• Asymptotically optimal priority policies for indexable and nonindexable restless bandits
• Virtual network provisioning across multiple substrate networks
• Dynamic priority allocation via restless bandit marginal productivity indices
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Restless bandits, partial conservation laws and indexability
• The Complexity of Optimal Queuing Network Control
• Basics of Applied Stochastic Processes
• On an index policy for restless bandits
• Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
• Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
• Introduction to Queueing

This page was built for publication: Resource competition in virtual network embedding