2021 12th International Conference on Network of the Future (NoF)最新文献

A Framework to boost the potential of network-in-a-box solutions 一个框架，用于提升盒中网络解决方案的潜力

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609861

CÃ©sar Baena, Sergio Fortes Rodriguez, O. S. Peñaherrera-Pulla, R. Barco

引用次数: 5

A Performance Study of Flow-Based Monitoring in Internet of Vehicles 基于流量的车联网监控性能研究

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609951

Mingyuan Zang, L. Dittmann, Ying Yan

引用次数: 1

Message from the NoF 2021 Chairs 非2021年主席的信息

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/nof52522.2021.9609829

引用次数: 0

A Framework Integrating FPGAs in VNF Networks VNF网络中fpga集成框架

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609941

M. Ewais, Juan Camilo Vega, A. Leon-Garcia, P. Chow

{"title":"A Framework Integrating FPGAs in VNF Networks","authors":"M. Ewais, Juan Camilo Vega, A. Leon-Garcia, P. Chow","doi":"10.1109/NoF52522.2021.9609941","DOIUrl":"https://doi.org/10.1109/NoF52522.2021.9609941","url":null,"abstract":"Future telecommunications networks require more throughput and lower latency. The slowdown of Moore’s Law forces one to think beyond traditional CPU servers to satisfy these needs. FPGAs have been shown to provide exceptional throughput and latency, but they currently lack support for many of the orchestration and reconfiguration tools required by telecommunications networks, namely exposing a standard configuration API for SDN applications to control, and having the ability for tools such as Kubernetes to provision and reuse these compute resources.We propose an FPGA Framework for Interactive VNF Environments, or FFIVE for short. We utilize the framework for the creation of FPGA-based containers allowing them to be deployed by Kubernetes and virtually connected via VXLAN. This enables us to migrate the FPGA as needed in the virtual network, allowing for quick image substitution as usage changes. We also enable the use of RESTful APIs to control, reprogram, and manage an FPGA making it usable by SDN applications. Essentially, our framework makes the deployment and management of FPGA-based containers in telecom analogous to their CPU counterparts but with the improved bandwidth, efficiency, and latency provided by FPGAs. Comparing the network stack and chaining of our approach with conventional multi-threaded CPU server implementations, we offer 59-fold to 175-fold throughput increase and a 97.5% reduction of latency for networking and chaining. We are also able to reduce the latency of a real-world firewall VNF by 92.3%.","PeriodicalId":314720,"journal":{"name":"2021 12th International Conference on Network of the Future (NoF)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115266634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Accelerating Packet Classification via Direct Dependent Rules 通过直接依赖规则加速包分类

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609820

Takashi Fuchino, Takashi Harada, Ken Tanaka

{"title":"Accelerating Packet Classification via Direct Dependent Rules","authors":"Takashi Fuchino, Takashi Harada, Ken Tanaka","doi":"10.1109/NoF52522.2021.9609820","DOIUrl":"https://doi.org/10.1109/NoF52522.2021.9609820","url":null,"abstract":"Packet classification is used to determine the behavior of incoming packets in network devices. The development of algorithms for packet classification that can be applied in a widespread manner to firewalls is required, given the prevalence of Internet threats and the need for effective communication. As it is achieved using linear search on a classification rule list, a large number of rules leads to longer communication latency. To decrease the latency, a problem known as optimal rule ordering (ORO) has been formalized, which aims to identify the ordering of rules that minimizes the classification latency caused by packet classification, while preserving the classification policy.Because ORO is known to be NP–hard, various heuristics for ORO have been proposed.Certain algorithms with time complexities of O(n2) exist that cannot sufficiently reduce the latency. Algorithms that can reduce the latency have time complexities of O(n3).To decide the position where rules should be placed, most heuristic algorithms for ORO calculate evaluations that take into account of packets that match the rule and the constraints of reordering. This calculation is the bottleneck of time complexities for reordering algorithms, and there is a trade-off relationship with the reordering accuracy. Thus in this paper, we propose O(n2) method that uses the average number of not only the rule to be evaluated but also the rules that are depended by it. Furthermore, we demonstrate the effectiveness of our method by comparing it with other O(n2) methods using ClassBench, which is a benchmark for packet classification algorithms.","PeriodicalId":314720,"journal":{"name":"2021 12th International Conference on Network of the Future (NoF)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125173315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Improving East/Westbound SDN Connectivity via Enhanced Availability 通过增强可用性改善东西向SDN连接

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609898

Dorabella Santos, João P. Vidal, Teresa Gomes, Lúcia Martins

{"title":"Improving East/Westbound SDN Connectivity via Enhanced Availability","authors":"Dorabella Santos, João P. Vidal, Teresa Gomes, Lúcia Martins","doi":"10.1109/NoF52522.2021.9609898","DOIUrl":"https://doi.org/10.1109/NoF52522.2021.9609898","url":null,"abstract":"The control plane in software-defined networking (SDN) is composed by a logically centralized set of controllers which acts as the brain of the SDN network. These controllers need to be connected through east/westbound interfaces in order to have a synchronized view of the network and therefore it is a key issue to guarantee the intercontroller connectivity for a proper network behaviour.In the present work, the problem of controller placement under QoS constraints with the additional requirement of having the intercontroller connectivity with a given availability at minimum cost is addressed as a bi-objective problem. This problem is NP-complete and to tackle it a heuristic approach is proposed based on the problem decomposition into sub-problems. In a previous heuristic to solve a less general problem, a similar strategy was followed based on the assumption that a Steiner tree connecting the controllers is the set of links that should be upgraded to achieve the required availability. In this paper a more general sub-graph is considered for intercontroller availability improvement, and an additional optimization level is also considered to address this more general problem.To assess the performance of the proposed heuristic a baseline heuristic to serve as a benchmark is also proposed.","PeriodicalId":314720,"journal":{"name":"2021 12th International Conference on Network of the Future (NoF)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121758022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

[NoF 2021 Front cover] [2021年版封面]

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/nof52522.2021.9609863

引用次数: 0

On the Performance of 5G for Cloud- and Edge-based Emergency Services in Smart Cities 5G在智慧城市云和边缘应急服务中的性能研究

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609822

Gonçalo Perna, Rodrigo Rosmaninho, H. Sampaio, P. Rito, Miguel Luís, S. Sargento

引用次数: 2

A Network and Computing Resource Management Method based on Population Prediction in Mobile Networks 移动网络中基于人口预测的网络与计算资源管理方法

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609894

K. Shiomoto, Tatsuya Otoshi, Masayuki Murata

{"title":"A Network and Computing Resource Management Method based on Population Prediction in Mobile Networks","authors":"K. Shiomoto, Tatsuya Otoshi, Masayuki Murata","doi":"10.1109/NoF52522.2021.9609894","DOIUrl":"https://doi.org/10.1109/NoF52522.2021.9609894","url":null,"abstract":"Existing traffic prediction methods are based on previously collected traffic patterns. The measured data is used to train and create a model, and the model predicts future traffic patterns. However, mobile traffic accounts for the majority of network congestion, and it is challenging to predict. Timely forecasting of exact mobile traffic is complicated due to complex spatio-temporal patterns of user demand. Even though we can obtain an accurate estimate of population in a target area, the number of active users cannot be accurately determined, and the traffic generated from a target area cannot be accurately estimated. In this study, we aimed at reducing the gap between population estimates, and the number of active mobile users in an area. Here, we have proposed a Bayesian model to represent the relationship between population and network and computing resources. The parameters that govern the Bayesian network are estimated from the collected data. We demonstrated that the proposed method reduced relative prediction error to 0.24, whereas the seasonal autoregressive integrated moving average (SARIMA) model had an error of 0.56.","PeriodicalId":314720,"journal":{"name":"2021 12th International Conference on Network of the Future (NoF)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123266294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

An Outlook on using Packet Sampling in Flow-based C2 TLS Malware Traffic Detection 基于流量的C2 TLS恶意流量检测中数据包采样技术的展望

2021 12th International Conference on Network of the Future (NoF) Pub Date : 2021-10-06 DOI: 10.1109/NoF52522.2021.9609889

Carlos Novo, J. M. Silva, Ricardo Morla

引用次数: 1