TY - GEN
T1 - Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks
AU - Jia, Mike
AU - Liang, Weifa
AU - Huang, Meitian
AU - Xu, Zichuan
AU - Ma, Yu
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Data transfers in contemporary networks depend upon network functions for ensuring data security and system performance. These policies are represented by a service chain that consists of different network functions such as firewalls, Intrusion Detection Systems (IDSs), transcoders, etc. Network Function Virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain. In this paper, we study NFV-enabled unicasting in SDNs with and without end-to-end delay constraints. We aim to maximize the network throughput for a sequence of NFV-enabled unicast requests without the knowledge of future arrivals. We first formulate the problems as novel optimization problems in terms of both computing and bandwidth resource consumptions, and provide a generic optimization framework. We then develop an online algorithm with guaranteed performance without the delay requirement and a heuristic with the delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. The results of the experimental simulations show that the proposed algorithms are promising.
AB - Data transfers in contemporary networks depend upon network functions for ensuring data security and system performance. These policies are represented by a service chain that consists of different network functions such as firewalls, Intrusion Detection Systems (IDSs), transcoders, etc. Network Function Virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain. In this paper, we study NFV-enabled unicasting in SDNs with and without end-to-end delay constraints. We aim to maximize the network throughput for a sequence of NFV-enabled unicast requests without the knowledge of future arrivals. We first formulate the problems as novel optimization problems in terms of both computing and bandwidth resource consumptions, and provide a generic optimization framework. We then develop an online algorithm with guaranteed performance without the delay requirement and a heuristic with the delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. The results of the experimental simulations show that the proposed algorithms are promising.
UR - https://www.scopus.com/pages/publications/85046457457
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85046457457&origin=recordpage
U2 - 10.1109/GLOCOM.2017.8254756
DO - 10.1109/GLOCOM.2017.8254756
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781509050192
VL - 2018-January
T3 - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
SP - 1
EP - 6
BT - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
PB - IEEE
T2 - 2017 IEEE Global Communications Conference, GLOBECOM 2017
Y2 - 4 December 2017 through 8 December 2017
ER -