TY - GEN
T1 - PRAM
T2 - 2017 Symposium on SDN Research, SOSR 2017
AU - Meng, Zili
AU - Bi, Jun
AU - Sun, Chen
AU - Xu, Anmin
AU - Hu, Hongxin
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/4/3
Y1 - 2017/4/3
N2 - We propose PRAM, a priority-aware flow migrating scheme to address the problem of which flows to migrate during dynamic scale in or out of network functions in NFV networks. We introduce the concept of Priority-Weighted Migration Time (PWMT), and use a greedy algorithm to minimize the PWMT, in order to exert the minimum impact on latency-sensitive flows. Simulation results show that PRAM can reduce the PWMT by 5.61× to 18.48× compared with the random strategy.
AB - We propose PRAM, a priority-aware flow migrating scheme to address the problem of which flows to migrate during dynamic scale in or out of network functions in NFV networks. We introduce the concept of Priority-Weighted Migration Time (PWMT), and use a greedy algorithm to minimize the PWMT, in order to exert the minimum impact on latency-sensitive flows. Simulation results show that PRAM can reduce the PWMT by 5.61× to 18.48× compared with the random strategy.
KW - Flow scheduling
KW - Network function virtualization
KW - Network management algorithm
UR - https://www.scopus.com/pages/publications/85018979856
U2 - 10.1145/3050220.3060602
DO - 10.1145/3050220.3060602
M3 - Conference contribution
AN - SCOPUS:85018979856
T3 - SOSR 2017 - Proceedings of the 2017 Symposium on SDN Research
SP - 183
EP - 184
BT - SOSR 2017 - Proceedings of the 2017 Symposium on SDN Research
PB - Association for Computing Machinery, Inc
Y2 - 3 April 2017 through 4 April 2017
ER -