TY - GEN
T1 - Optimized service function path selection for iot devices using virtual network function performance data
AU - Abeysiriwardhana, W. A.Shanaka
AU - Wijekoon, Janaka
AU - Nishi, Hiroaki
N1 - Funding Information:
ACKNOWLEDGMENT This work was supported by Technology Foundation of the RD & project Des“ ign of Information and Communication Platform for Future Smart Community Services” by the Ministry of Internal Affairs and Communications of Japan, grants from the Project of the Bio -oriented Technology Research Advancement Institution, NARO （ the research project for the future agricultural production utilizing artificial intelligence), and MEXT/JSPS KAKENHI Grant (B) Number JP16H04455 and JP17H01739, respectively .
PY - 2019/5/17
Y1 - 2019/5/17
N2 - Software defined networking (SDN) and network function virtualization (NFV) are proposed as software based applications to cater to smart services requirements of smart communities. The services are linked together to support different sets of clients using service function chaining (SFC). Service functions (SFs) in an SFC must be distributed among available computing resources by creating a service function path (SFP) allowing resource management and optimal SF execution. This paper proposes a novel SFP allocation algorithm considering the computation capabilities of hardware resources while minimizing the completion time of SFCs. The proposed algorithm shows 10% performance increment compared to recently developed algorithms such as nearly optimal service function path and optimal service function selection algorithms.
AB - Software defined networking (SDN) and network function virtualization (NFV) are proposed as software based applications to cater to smart services requirements of smart communities. The services are linked together to support different sets of clients using service function chaining (SFC). Service functions (SFs) in an SFC must be distributed among available computing resources by creating a service function path (SFP) allowing resource management and optimal SF execution. This paper proposes a novel SFP allocation algorithm considering the computation capabilities of hardware resources while minimizing the completion time of SFCs. The proposed algorithm shows 10% performance increment compared to recently developed algorithms such as nearly optimal service function path and optimal service function selection algorithms.
KW - Internet of Things
KW - Network Function Virtualization
KW - Service Function Chaining
KW - Software Defined Networking
KW - Virtual Network Function
UR - http://www.scopus.com/inward/record.url?scp=85066741859&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066741859&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2019.8718150
DO - 10.1109/ICOIN.2019.8718150
M3 - Conference contribution
AN - SCOPUS:85066741859
T3 - International Conference on Information Networking
SP - 165
EP - 170
BT - 33rd International Conference on Information Networking, ICOIN 2019
PB - IEEE Computer Society
T2 - 33rd International Conference on Information Networking, ICOIN 2019
Y2 - 9 January 2019 through 11 January 2019
ER -