Priority-Aware SFC Provisioning in Fog Computing

被引:0
作者
Siasi, N. [1 ]
Jaesim, A. [2 ]
机构
[1] Univ S Florida, Dept Elect Engn, Tampa, FL 33620 USA
[2] Univ Mt Union, Dept Elect Engn, Alliance, OH USA
来源
2020 IEEE 17TH ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC 2020) | 2020年
关键词
Fog computing; network function virtualization; virtual network functions; service function chaining; load balancing; shortest-path; effective bandwidth;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Fog computing paradigms are proposed to overcome delay limitations associated with cloud computing. This is accomplished by transferring the computational and storage resources, relaying and caching services from the cloud to the edge of the network. This in turn reduces delays and latencies and alleviates overloads at cloud nodes. Furthermore, virtualization technologies such as network function virtualization (NFV) facilitate accessing and sharing fog nodes by various services and applications. When using these technologies, service function chain (SFC) provisioning presents an important factor in providing such applications. Hence this paper presents a first study on SFC provisioning in NFV-based fog networks that takes into account shortest-path and load balancing to achieve efficient resources utilization. Batch requests are sorted based upon various priority-aware criteria, i.e., highest and lowest resources requirements for functions, as well as random sorting. Hence, the goal here is to achieve efficient SFC provisioning while identifying the best sorting technique for mapping batch requests onto the fog nodes.
引用
收藏
页数:6
相关论文
empty
未找到相关数据