Application of Machine Learning Algorithms for Traffic Forecasting in Dynamic Optical Networks with Service Function Chains

IF 1.8 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
D. Szostak, K. Walkowiak
{"title":"Application of Machine Learning Algorithms for Traffic Forecasting in Dynamic Optical Networks with Service Function Chains","authors":"D. Szostak, K. Walkowiak","doi":"10.2478/fcds-2020-0012","DOIUrl":null,"url":null,"abstract":"\n Knowledge about future optical network traffic can be beneficial for network operators in terms of decreasing an operational cost due to efficient resource management. Machine Learning (ML) algorithms can be employed for forecasting traffic with high accuracy. In this paper we describe a methodology for predicting traffic in a dynamic optical network with service function chains (SFC). We assume that SFC is based on the Network Function Virtualization (NFV) paradigm. Moreover, other type of traffic, i.e. regular traffic, can also occur in the network. As a proof of effectiveness of our methodology we present and discuss numerical results of experiments run on three benchmark networks. We examine six ML classifiers. Our research shows that it is possible to predict a future traffic in an optical network, where SFC can be distinguished. However, there is no one universal classifier that can be used for each network. Choice of an ML algorithm should be done based on a network traffic characteristics analysis.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"1 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computing and Decision Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/fcds-2020-0012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 3

Abstract

Knowledge about future optical network traffic can be beneficial for network operators in terms of decreasing an operational cost due to efficient resource management. Machine Learning (ML) algorithms can be employed for forecasting traffic with high accuracy. In this paper we describe a methodology for predicting traffic in a dynamic optical network with service function chains (SFC). We assume that SFC is based on the Network Function Virtualization (NFV) paradigm. Moreover, other type of traffic, i.e. regular traffic, can also occur in the network. As a proof of effectiveness of our methodology we present and discuss numerical results of experiments run on three benchmark networks. We examine six ML classifiers. Our research shows that it is possible to predict a future traffic in an optical network, where SFC can be distinguished. However, there is no one universal classifier that can be used for each network. Choice of an ML algorithm should be done based on a network traffic characteristics analysis.
机器学习算法在业务功能链动态光网络流量预测中的应用
关于未来光网络流量的知识对于网络运营商来说是有益的,因为有效的资源管理降低了运营成本。机器学习(ML)算法可以用于高精度地预测流量。在本文中,我们描述了一种在具有服务功能链(SFC)的动态光网络中预测流量的方法。我们假设SFC基于网络功能虚拟化(NFV)范式。此外,其他类型的流量,即常规流量,也可以出现在网络中。为了证明我们的方法的有效性,我们提出并讨论了在三个基准网络上运行的实验的数值结果。我们检查了六个ML分类器。我们的研究表明,可以预测光网络中的未来流量,从而区分SFC。然而,没有一个通用的分类器可以用于每个网络。ML算法的选择应基于网络流量特性分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Foundations of Computing and Decision Sciences
Foundations of Computing and Decision Sciences COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
2.20
自引率
9.10%
发文量
16
审稿时长
29 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信