{"title":"Latency-Aware Traffic Grooming for Dynamic Service Chaining in Metro Networks","authors":"Leila Askari, F. Musumeci, M. Tornatore","doi":"10.1109/ICC.2019.8761290","DOIUrl":null,"url":null,"abstract":"Optical metro networks are currently evolving in response to the new requirements of emerging 5G services. Network Function Virtualization (NFV) is being leveraged as a platform to dynamically provision these services on top of Virtual Network Functions (VNFs), and central offices in metro areas are being upgraded to host processing units that can host the needed to provision services with stringent-latency and high-bandwidth requirements closer to users (i.e., edge computing). By concatenating these VNFs in a specific order and route traffic among them, operators generate a so-called “Service Chain“(SC). Considering the fact that, new 5G services have bandwidth requirements typically with sub-wavelength granularity, traffic grooming is required to achieve efficient network resources utilization. Since grooming affects the end-to-end latency of provisioned services, we investigate how to perform latency-aware traffic grooming, and we propose an algorithm for dynamic SC provisioning, that considers the latency requirements of each SC to decide about if grooming shall be allowed at intermediate network nodes. Our proposed algorithm tries to minimize the blocked bandwidth as well as number of nodes to host VNFs in the network (NFV-nodes) considering the nodes computational capacity, links bandwidth and end-to-end latency constraints. Results obtained from numerical evaluation show that, our algorithm is able to reduce the number of NFV-nodes up to 50%, while keeping amount of blocked bandwidth below a specific threshold.","PeriodicalId":402732,"journal":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2019.8761290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Optical metro networks are currently evolving in response to the new requirements of emerging 5G services. Network Function Virtualization (NFV) is being leveraged as a platform to dynamically provision these services on top of Virtual Network Functions (VNFs), and central offices in metro areas are being upgraded to host processing units that can host the needed to provision services with stringent-latency and high-bandwidth requirements closer to users (i.e., edge computing). By concatenating these VNFs in a specific order and route traffic among them, operators generate a so-called “Service Chain“(SC). Considering the fact that, new 5G services have bandwidth requirements typically with sub-wavelength granularity, traffic grooming is required to achieve efficient network resources utilization. Since grooming affects the end-to-end latency of provisioned services, we investigate how to perform latency-aware traffic grooming, and we propose an algorithm for dynamic SC provisioning, that considers the latency requirements of each SC to decide about if grooming shall be allowed at intermediate network nodes. Our proposed algorithm tries to minimize the blocked bandwidth as well as number of nodes to host VNFs in the network (NFV-nodes) considering the nodes computational capacity, links bandwidth and end-to-end latency constraints. Results obtained from numerical evaluation show that, our algorithm is able to reduce the number of NFV-nodes up to 50%, while keeping amount of blocked bandwidth below a specific threshold.