2020 11th International Conference on Network of the Future (NoF)最新文献

{"title":"Bounded Latency with Bridge-Local Stream Reservation and Strict Priority Queuing","authors":"Alexej Grigorjew, Florian Metzger, T. Hossfeld, Johannes Specht, Franz-Josef Götz, Feng Chen, Jürgen Schmitt","doi":"10.1109/NoF50125.2020.9249224","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249224","url":null,"abstract":"Bridge-local latency computation is often regarded with caution, while new shaping mechanisms and timed gates are developed to achieve deterministic guarantees. However, these new concepts require additional hardware support in the forwarding devices, and many of them are based on assumptions of central control and network-wide information being available. This document presents a per-hop latency bound for individual streams in a class-based network that applies the IEEE 802.1Q strict priority transmission selection algorithm. It does not rely on shaping or timed gates and uses the accumulated latency fields during the reservation process to provide upper bounds with bridge-local information. The presented delay bound is proven formally and then evaluated with respect to its accuracy. It shows that deterministic latency with priority queuing is indeed feasible, and it indicates the required information that must be provided during resource reservation, e.g., to protocols developed in IEEE 802.1Qdd. This document presents a per-hop latency bound for individual streams in a class-based network that applies the IEEE 802.1Q strict priority transmission selection algorithm. It does not rely on shaping or timed gates and uses the accumulated latency fields during the reservation process to provide upper bounds with bridge-local information. The presented delay bound is proven formally and then evaluated with respect to its accuracy. It shows that deterministic latency with priority queuing is indeed feasible, and it indicates the required information that must be provided during resource reservation, e.g., to protocols developed in IEEE 802.1Qdd.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121203851","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}

{"title":"HUMAN - Hierarchical Clustering for Unsupervised Anomaly Detection & Interpretation","authors":"Pavol Mulinka, P. Casas, K. Fukuda, L. Kencl","doi":"10.1109/NoF50125.2020.9249194","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249194","url":null,"abstract":"The automatic detection and interpretation of network traffic anomalies through machine learning is a well-known problem, for which no general solution is available. Both supervised and unsupervised (i.e., anomaly detection) approaches require prior knowledge on the monitoring data, either in terms of normal operation profiles or on the specific anomalies to detect. As a consequence, both approaches have clear limitations when it comes to detecting, and in particular interpreting, previously unseen events. We present HUMAN, a general hierarchical-clustering-based approach for unsupervised network traffic analysis, which can both detect and interpret anomalous behaviors in a completely black-box manner, without relying on ground-truth on the system under analysis. HUMAN can detect and interpret complex patterns in the analyzed data, using a structural approach which exploits hierarchical cluster relationships and correlation among features. We describe the building blocks of HUMAN and explain its functioning in detail, using as case study the detection and interpretation of performance issues in major cloud platforms, through the unsupervised analysis of distributed active cloud latency measurements. The HUMAN approach can be applied to the unsupervised analysis of any kind of nested or hierarchically structured multi-dimensional data, showing the potential of hierarchical clustering for general unsupervised data analytics.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124875572","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}

{"title":"Can Host-Based SDNs Rival the Traffic Engineering Abilities of Switch-Based SDNs?","authors":"Yu Lei, Julian P. Lanson, Remy M. Kaldawy, J. Estrada, Craig A. Shue","doi":"10.1109/NoF50125.2020.9249110","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249110","url":null,"abstract":"The software-defined networking (SDN) paradigm offers significant flexibility for network operators. However, the SDN community has focused on switch-based implementations, which pose several challenges. First, some may require significant hardware costs to upgrade a network. Further, fine-grained flow control in a switch-based SDN results in well-known, fundamental scalability limitations. These challenges may limit the reach of SDN technologies. In this work, we explore the extent to which host-based SDN agents can achieve feature parity with switch-based SDNs. Prior work has shown the potential of host-based SDNs for security and access control. Our study finds that with appropriate preparation, a host-based agent offers the same capabilities of switch-based SDN s in the remaining key area of traffic engineering, even in a legacy managed-switch network. We find the approach offers comparable performance to switch-based SDNs while eliminating the flow table scalability and cost concerns of switch-based SDN deployments. In this work, we explore the extent to which host-based SDN agents can achieve feature parity with switch-based SDNs. Prior work has shown the potential of host-based SDNs for security and access control. Our study finds that with appropriate preparation, a host-based agent offers the same capabilities of switch-based SDN s in the remaining key area of traffic engineering, even in a legacy managed-switch network. We find the approach offers comparable performance to switch-based SDNs while eliminating the flow table scalability and cost concerns of switch-based SDN deployments.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125886750","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}

{"title":"On Routing Scalability in Flat SDN Architectures","authors":"H. Ravuri, M. T. Vega, Jeroen van der Hooft, T. Wauters, Bin Da, F. Turck","doi":"10.1109/NoF50125.2020.9249170","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249170","url":null,"abstract":"The rigidity of traditional network architectures, with tightly coupled control and data planes, impair their ability to adapt to the dynamic requirements of future application domains, such as the Tactile Internet or Holographic-Type Communications. Software-Defined Networking (SDN) architectures, which provide programmability to configure the network, have the potential to provide the required dynamism. However, given its centralized essence, SDN suffers from scalability issues. Therefore, efforts have been made to propose alternative decentralized solutions, such as the flat distributed SDN architecture. Despite its potential, the real applicability and scalability of decentralized SDN solutions are still open research questions. This paper presents a comparative analysis of the effects of different routing approaches on the scalability of flat distributed SDN architectures. Using the Open Network Operating System (ONOS) as our evaluation architecture, we have studied the tradeoff between routing overhead in the control data plane and inter-controller communications for different degrees of decentralization. We have found that routing applications, which only require control-data plane communication for setting the path, benefit more from decentralization than the ones which utilize inter-controller communications and ensure Quality of Service (QoS). Our findings highlight the need for efficient routing mechanisms to deal with inter-controller overhead while lowering the amount of control-data plane communication.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129471607","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}

{"title":"FCSTD: Fog-Cloud Smart Task Distribution by Exploiting the Artificial Neural Networks","authors":"M. Pourkiani, Masoud Abedi","doi":"10.1109/NoF50125.2020.9249167","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249167","url":null,"abstract":"In order to reduce the response time and the Internet bandwidth utilization in combined Fog-Cloud scenarios, we propose Fog-Cloud Smart Task Distribution (FCSTD) method, which intelligently distributes the tasks between the fog and cloud servers with regard to the application requirements. This approach uses Artificial Neural Networks for predicting the response time and the size of the results and then distributes the tasks by considering the predicted amounts. To investigate the performance of FCSTD, we applied it to a real-world case study (which is a delay-sensitive online healthcare application that monitors the health status of people) and analyzed its performance for the distribution of different types of tasks. The achieved results show that FCSTD provides better performance for reducing the Internet bandwidth utilization and response time in comparison to the other proposed methods in the literature.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127916844","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}

{"title":"Importance of Cross-Correlation of QoS metrics in Network Emulators to Evaluate QoE of Video Streaming Applications","authors":"Nafi Ahmad, Abdul Wahab, J. Schormans","doi":"10.1109/NoF50125.2020.9249129","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249129","url":null,"abstract":"Most of the existing studies on mapping of Quality of Service (QoS) to Quality of Experience (QoE) ignores any correlation between the QoS metrics. Network emulators such as NetEm that are used to study various network situations, have similar limitations. NetEm's inability to emulate realistic long-tail packet latency and correlation between QoS metrics may have already resulted in doubtful QoS to QoE functions. In this paper, we analysed real-time cellular QoS metrics data, and observed that there is significant correlation between several QoS parameters. We used them to create bespoke distributions for NetEm using different statistical methods such as maximum likelihood estimation and cumulative distribution functions. These distributions were used to modify NetEm to address the lack of representative packet waiting-time distributions. In addition, the bespoke distributions were also used to provide a way to emulate correlated packet delay and loss in NetEm. This bespoke emulator was then used to observe the impact of correlated delay-loss metric on end user QoE of video streaming applications using PSNR, SSIM and VMAF objective evaluation techniques. The emulation results showed that bespoke emulator gives better QoE compared to default NetEm configuration for same Packet Loss Ratio (PLR). In this paper, we analysed real-time cellular QoS metrics data, and observed that there is significant correlation between several QoS parameters. We used them to create bespoke distributions for NetEm using different statistical methods such as maximum likelihood estimation and cumulative distribution functions. These distributions were used to modify NetEm to address the lack of representative packet waiting-time distributions. In addition, the bespoke distributions were also used to provide a way to emulate correlated packet delay and loss in NetEm. This bespoke emulator was then used to observe the impact of correlated delay-loss metric on end user QoE of video streaming applications using PSNR, SSIM and VMAF objective evaluation techniques. The emulation results showed that bespoke emulator gives better QoE compared to default NetEm configuration for same Packet Loss Ratio (PLR).","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"562 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123152374","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}

{"title":"Accurate Classification for HPC Applications Concerning Traffic Matrix Visual Patterns","authors":"R. Castro, Celio Trois, L. C. E. Bona, M. Martinello","doi":"10.1109/NoF50125.2020.9249204","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249204","url":null,"abstract":"The evolution of computing and networking allowed multiple computers to be interconnected, aggregating their processing powers to form High-Performance Computing (HPC) architectures. Applications running in these computational environments process and communicate huge amounts of information, taking several hours or even days to complete their executions so, understanding their computation and communication demands is essential for management purposes. Moreover, although most of HPC applications are implemented with well-known algorithms that tend to follow a given pattern in computation and communication, the classical methods of traffic analysis have not been accurate to classify them. In this sense, we argue that observing and understanding the visual patterns in these applications' traffic matrices (TMs) can provide an accurate classification method. In this paper, we propose TReco, a framework that maintains a database with visual features extracted from these TMs and applies machine learning techniques to classify the HPC applications that are consuming the network, regardless of the number of computational nodes executing it. In our experiments, we reached accuracy rate over 99.75%.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115181543","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}

{"title":"Multi-Objective Genetic Algorithm for the Joint Optimization of Energy Efficiency and Rule Reduction in Software-Defined Networks","authors":"J. Galán-Jiménez, J. Berrocal, Juan Luis Herrera, Marco Polverini","doi":"10.1109/NoF50125.2020.9249089","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249089","url":null,"abstract":"Although the use of Ternary Content-Addressable Memories (TCAMs) in the flow tables of the Software-Defined Network (SDN) switches increases the efficiency of packets matching procedure, drawbacks such as their large power consumption and the limitation on the number of flow rules that can be installed must be taken into account. This paper tackles the joint problem of power consumption and TCAM size limitation in SDN. By exploiting the Rate Adaptation technique and compression methods, a Multi-Objective Genetic Algorithm is proposed to practically solve it. Simulations on a real network topology show that our proposed solution outperforms other state-of-the-art approaches, both in terms of power saving gains (20% at non-peak TM) and maximum TCAM utilization (5%).","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123388510","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}

{"title":"Performance Benchmarking of Virtualized Network Functions to Correlate Key Performance Metrics with System Activity","authors":"Yogesh Sharma, Michel Gokan Khan, J. Taheri, A. Kassler","doi":"10.1109/NoF50125.2020.9249199","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249199","url":null,"abstract":"Industry is set to enter in a new revolution (Industry 4.0) backed by high inter-connectivity. Therefore, leveraging virtualization technology to deploy networks as virtualized network functions (VNFs) garnered attention. It helps the network operators and service providers to consolidate several VNFs on fewer of-the-shelf servers. This results in reducing the capital and operational expenditures while improving the resource efficiency. However, moving network functions from proprietary devices to standard servers comes with the profound cost of performance degradation. In order to overcome any performance issues to ensure service level agreement (SLA) requirements and before taking the solutions to real world, a sufficient verification and validation of VNFs is required. This is where Network Service benchmarking (NSB) plays a crucial role. NSB identifies any performance compromising bottlenecks by systematically evaluating the capacity of general purpose hardware resources, also know as network function virtualization infrastructure (NFVI), used to host single or multiple VNF instances. This paper presents a benchmarking methodology and framework to extract the correlation among the VNF quality of services (QoS) metrics and NFVI key performance indicators (KPls). For evaluation, VoerEir Touchstone platform is used to execute iPerf based benchmarking application to generate UDP based workload between VNFs. The results demonstrated that CPU utilization and L1- L3 cache memory are statistically correlated with packets dropped (0.43 and 0.47, respectively) and bandwidth utilization (0.99 and 0.92, respectively).","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122090231","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}

{"title":"HoIP Performance for Tactile Internet over 5G Networks: A Teleoperation Case Study","authors":"Wrya Monnet, T. Ali-Yahiya","doi":"10.1109/NoF50125.2020.9249097","DOIUrl":"https://doi.org/10.1109/NoF50125.2020.9249097","url":null,"abstract":"The Tactile Internet (TI) is expected to shift the paradigm of Internet from content delivery to skill delivery. To enable this type of delivery, IEEE 1918.1 working group started working on the standardization of TI for the realization and the deployment of different use cases involving different haptic applications. Indeed, the exchange of haptic signals is time critical, with a delay requirement of 1–10 ms. We propose a conceptual teleoperation system based on 5G new radio (5G NR) as access technology to the network. The control of the proposed system requires a low End-to-End delay (E2E) to guarantee a stable system operation and correct haptic feedback. For this purpose, we employed and studied the performance of haptics over Internet protocol (HoIP) in order to examine its feasibility to ensure a reliable communication over 5G NR in terms of bit rate and E2E delay. We show through numerical analysis and simulations that HolP overhead will not violate the Quality of Service (QoS) requirements. It is proved that, in case of single user scenario and very low SINR, the radio link still support the required data rate and E2E delay.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122786857","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}