Slicing of Network Resources in Future Internet Service Providers Based on Daytime

R. Gomes, Arthur Urbano, Francisco R. P. da Ponte, L. Bittencourt, E. Madeira
{"title":"Slicing of Network Resources in Future Internet Service Providers Based on Daytime","authors":"R. Gomes, Arthur Urbano, Francisco R. P. da Ponte, L. Bittencourt, E. Madeira","doi":"10.1109/ISCC.2018.8538725","DOIUrl":null,"url":null,"abstract":"Nowadays, the Internet is part of our lives, as an essential way of communication and information. However, it suffers from limitations that prevent guarantees of Quality of Service (QoS) to the users. Thus, Internet Service Providers (ISPs) need to evolve, adding new technologies and management strategies, such as Network Virtualization (NV), Software Defined Network (SDN) and Network Function Virtualization (NFV), resulting in the Future Internet Service Providers (FISPs). FISPs slice their network resources among clients and delivered services, where an algorithm to define the structure of each slice is crucial to support Quality of Service (QoS) and resource utilization. Therefore, FISPs should consider the elastic resource utilization of the clients within periods of time through the day. In this context, this paper presents the Per Time Calculation (PETIC) algorithm to define slices based on the daytime bandwidth requirements of the clients. Numerical results suggest that the proposed algorithm defines more suitable slices than existing approaches.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2018.8538725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Nowadays, the Internet is part of our lives, as an essential way of communication and information. However, it suffers from limitations that prevent guarantees of Quality of Service (QoS) to the users. Thus, Internet Service Providers (ISPs) need to evolve, adding new technologies and management strategies, such as Network Virtualization (NV), Software Defined Network (SDN) and Network Function Virtualization (NFV), resulting in the Future Internet Service Providers (FISPs). FISPs slice their network resources among clients and delivered services, where an algorithm to define the structure of each slice is crucial to support Quality of Service (QoS) and resource utilization. Therefore, FISPs should consider the elastic resource utilization of the clients within periods of time through the day. In this context, this paper presents the Per Time Calculation (PETIC) algorithm to define slices based on the daytime bandwidth requirements of the clients. Numerical results suggest that the proposed algorithm defines more suitable slices than existing approaches.
基于白天的未来互联网服务提供商网络资源切片
如今,互联网是我们生活的一部分,作为沟通和信息的重要方式。然而,它也受到一些限制,无法保证对用户的服务质量(QoS)。因此,互联网服务提供商(isp)需要不断发展,增加新的技术和管理策略,如网络虚拟化(NV)、软件定义网络(SDN)和网络功能虚拟化(NFV),从而形成未来互联网服务提供商(fisp)。FISPs在客户端和交付的服务之间对其网络资源进行切片,其中定义每个切片结构的算法对于支持服务质量(QoS)和资源利用率至关重要。因此,FISPs应该考虑客户端的弹性资源在一天中的时间段内的使用情况。在此背景下,本文提出了基于客户端白天带宽需求的Per Time Calculation (PETIC)算法来定义片。数值结果表明,该算法比现有方法定义了更合适的切片。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信