Throughput Optimization and Delay Guarantee VNF Placement For Mapping SFC Requests in NFV-enabled Networks

Author(s):  
Yi Yue ◽  
Bo Cheng ◽  
Meng Wang ◽  
Biyi Li ◽  
Xuan Liu ◽  
...  
2019 ◽  
Vol 6 (6) ◽  
pp. 10077-10092 ◽  
Author(s):  
Changwei Zhang ◽  
Xinghua Sun ◽  
Jun Zhang ◽  
Xianbin Wang ◽  
Shi Jin ◽  
...  

2011 ◽  
Vol 10 (2) ◽  
pp. 474-483 ◽  
Author(s):  
Tao Cui ◽  
Feng Lu ◽  
Vignesh Sethuraman ◽  
Anil Goteti ◽  
Subramanya P. N. Rao ◽  
...  

2021 ◽  
Vol 48 (3) ◽  
pp. 128-129
Author(s):  
Sounak Kar ◽  
Robin Rehrmann ◽  
Arpan Mukhopadhyay ◽  
Bastian Alt ◽  
Florin Ciucu ◽  
...  

We analyze a data-processing system with n clients producing jobs which are processed in batches by m parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function that arises due to overhead amortization. In practice, throughput optimization relies on numerical searches for the optimal batch size which is computationally cumbersome. In this paper, we model this system in terms of a closed queueing network assuming certain forms of service speedup; a standard Markovian analysis yields the optimal throughput in w n4 time. Our main contribution is a mean-field model that has a unique, globally attractive stationary point, derivable in closed form. This point characterizes the asymptotic throughput as a function of the batch size that can be calculated in O(1) time. Numerical settings from a large commercial system reveal that this asymptotic optimum is accurate in practical finite regimes.


2015 ◽  
Vol 21 (3) ◽  
pp. 453-466 ◽  
Author(s):  
Heyi Tang ◽  
Liu Yang ◽  
Jiang Dong ◽  
Zhonghong Ou ◽  
Yong Cui ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document