RNN‐EdgeQL: SFC的自动缩放和放置方法

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Network Management Pub Date : 2022-09-09 DOI:10.1002/nem.2213
Suman Pandey, Minji Choi, Jae-Hyoung Yoo, James Won-Ki Hong
{"title":"RNN‐EdgeQL: SFC的自动缩放和放置方法","authors":"Suman Pandey,&nbsp;Minji Choi,&nbsp;Jae-Hyoung Yoo,&nbsp;James Won-Ki Hong","doi":"10.1002/nem.2213","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>This paper proposes a prediction-based scaling and placement of service function chains (SFCs) to improve service level agreement (SLA) and reduce operation cost. We used a variant of recurrent neural network (RNN) called gated recurrent unit (GRU) for resource demand prediction. Then, considering these predictions, we built an intuitive scale in/out algorithm. We also developed an algorithm that applies Q-Learning on Edge computing environment (EdgeQL) to place these scaled-out VNFs in appropriate locations. The integrated algorithm that combines prediction, scaling, and placement are called RNN-EdgeQL. RNN-EdgeQL (v2) is further improved to achieve application agnostic group level elasticity in the chain, independent of applications installed on the VNFs. We tested our algorithm on two realistic temporal dynamic load models including Internet traffic (Abilene) and an application specific traffic (Wiki) on an OpenStack testbed. The contribution of this article is threefold. First, prediction model prepares the target SFC for the upcoming load. Second, an application agnostic characteristics of the algorithm achieves the group-level elasticity in SFC. Finally, the EdgeQL placement model minimizes the end-to-end path of an SFC in multi-access edge computing (MEC) environment. As a result, RNN-EdgeQL (v2) gives the lowest overall latency, lowest SLA violations, and lowest VNFs requirement, compared to RNN-EdgeQL (v1) and Threshold-Openstack default placement.</p>\n </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 4","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2022-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"RNN-EdgeQL: An auto-scaling and placement approach for SFC\",\"authors\":\"Suman Pandey,&nbsp;Minji Choi,&nbsp;Jae-Hyoung Yoo,&nbsp;James Won-Ki Hong\",\"doi\":\"10.1002/nem.2213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>This paper proposes a prediction-based scaling and placement of service function chains (SFCs) to improve service level agreement (SLA) and reduce operation cost. We used a variant of recurrent neural network (RNN) called gated recurrent unit (GRU) for resource demand prediction. Then, considering these predictions, we built an intuitive scale in/out algorithm. We also developed an algorithm that applies Q-Learning on Edge computing environment (EdgeQL) to place these scaled-out VNFs in appropriate locations. The integrated algorithm that combines prediction, scaling, and placement are called RNN-EdgeQL. RNN-EdgeQL (v2) is further improved to achieve application agnostic group level elasticity in the chain, independent of applications installed on the VNFs. We tested our algorithm on two realistic temporal dynamic load models including Internet traffic (Abilene) and an application specific traffic (Wiki) on an OpenStack testbed. The contribution of this article is threefold. First, prediction model prepares the target SFC for the upcoming load. Second, an application agnostic characteristics of the algorithm achieves the group-level elasticity in SFC. Finally, the EdgeQL placement model minimizes the end-to-end path of an SFC in multi-access edge computing (MEC) environment. As a result, RNN-EdgeQL (v2) gives the lowest overall latency, lowest SLA violations, and lowest VNFs requirement, compared to RNN-EdgeQL (v1) and Threshold-Openstack default placement.</p>\\n </div>\",\"PeriodicalId\":14154,\"journal\":{\"name\":\"International Journal of Network Management\",\"volume\":\"33 4\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2022-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Network Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/nem.2213\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Network Management","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nem.2213","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种基于预测的服务功能链(SFCs)的扩展和布局,以提高服务水平协议(SLA)并降低运营成本。我们使用了一种称为门控递归单元(GRU)的递归神经网络(RNN)变体来预测资源需求。然后,考虑到这些预测,我们构建了一个直观的放大/缩小算法。我们还开发了一种算法,该算法应用边缘计算环境(EdgeQL)上的Q学习来将这些扩展的VNF放置在适当的位置。将预测、缩放和放置相结合的集成算法称为RNN-EdgeQL。RNN-EdgeQL(v2)得到了进一步改进,以实现链中与应用程序无关的组级弹性,独立于安装在VNF上的应用程序。我们在两个现实的时间动态负载模型上测试了我们的算法,包括互联网流量(Abilene)和OpenStack测试平台上的应用程序特定流量(Wiki)。这篇文章的贡献有三个方面。首先,预测模型为即将到来的负载准备目标SFC。其次,该算法的应用程序不可知特性实现了SFC中的组级弹性。最后,EdgeQL布局模型在多访问边缘计算(MEC)环境中最小化了SFC的端到端路径。因此,与RNN-EdgeQL(v1)和Threshold-Openstack默认位置相比,RNN-EdgeSQL(v2)提供了最低的总体延迟、最低的SLA违规和最低的VNF要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RNN-EdgeQL: An auto-scaling and placement approach for SFC

This paper proposes a prediction-based scaling and placement of service function chains (SFCs) to improve service level agreement (SLA) and reduce operation cost. We used a variant of recurrent neural network (RNN) called gated recurrent unit (GRU) for resource demand prediction. Then, considering these predictions, we built an intuitive scale in/out algorithm. We also developed an algorithm that applies Q-Learning on Edge computing environment (EdgeQL) to place these scaled-out VNFs in appropriate locations. The integrated algorithm that combines prediction, scaling, and placement are called RNN-EdgeQL. RNN-EdgeQL (v2) is further improved to achieve application agnostic group level elasticity in the chain, independent of applications installed on the VNFs. We tested our algorithm on two realistic temporal dynamic load models including Internet traffic (Abilene) and an application specific traffic (Wiki) on an OpenStack testbed. The contribution of this article is threefold. First, prediction model prepares the target SFC for the upcoming load. Second, an application agnostic characteristics of the algorithm achieves the group-level elasticity in SFC. Finally, the EdgeQL placement model minimizes the end-to-end path of an SFC in multi-access edge computing (MEC) environment. As a result, RNN-EdgeQL (v2) gives the lowest overall latency, lowest SLA violations, and lowest VNFs requirement, compared to RNN-EdgeQL (v1) and Threshold-Openstack default placement.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Network Management
International Journal of Network Management COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
5.10
自引率
6.70%
发文量
25
审稿时长
>12 weeks
期刊介绍: Modern computer networks and communication systems are increasing in size, scope, and heterogeneity. The promise of a single end-to-end technology has not been realized and likely never will occur. The decreasing cost of bandwidth is increasing the possible applications of computer networks and communication systems to entirely new domains. Problems in integrating heterogeneous wired and wireless technologies, ensuring security and quality of service, and reliably operating large-scale systems including the inclusion of cloud computing have all emerged as important topics. The one constant is the need for network management. Challenges in network management have never been greater than they are today. The International Journal of Network Management is the forum for researchers, developers, and practitioners in network management to present their work to an international audience. The journal is dedicated to the dissemination of information, which will enable improved management, operation, and maintenance of computer networks and communication systems. The journal is peer reviewed and publishes original papers (both theoretical and experimental) by leading researchers, practitioners, and consultants from universities, research laboratories, and companies around the world. Issues with thematic or guest-edited special topics typically occur several times per year. Topic areas for the journal are largely defined by the taxonomy for network and service management developed by IFIP WG6.6, together with IEEE-CNOM, the IRTF-NMRG and the Emanics Network of Excellence.
期刊最新文献
Issue Information Intent-Based Network Configuration Using Large Language Models Issue Information Security, Privacy, and Trust Management on Decentralized Systems and Networks A Blockchain-Based Proxy Re-Encryption Scheme With Cryptographic Reverse Firewall for IoV
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1