Maxim Claeys, N. Bouten, D. D. Vleeschauwer, Koen De Schepper, W. V. Leekwijck, Steven Latré, F. Turck
{"title":"Deadline-aware TCP congestion control for video streaming services","authors":"Maxim Claeys, N. Bouten, D. D. Vleeschauwer, Koen De Schepper, W. V. Leekwijck, Steven Latré, F. Turck","doi":"10.1109/CNSM.2016.7818405","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818405","url":null,"abstract":"Video streaming services have continuously gained popularity over the last decades, accounting for about 70% of all consumer Internet traffic in 2016. All of these video streaming sessions have strict delivery deadlines in order to avoid playout interruptions, detrimentally impacting the Quality of Experience (QoE). However, the vast majority of this traffic uses TCP at the transport layer, which is known to be far from minimizing the number of deadline-missing streams. By introducing deadline-awareness at the transport layer, video delivery can be optimized by prioritizing specific flows. This paper proposes a deadline-aware congestion control mechanism, based on a parametrization of the traditional TCP New Reno congestion control strategy. By taking into account the available deadline information, the modulation of the congestion window is dynamically adapted to steer the aggressiveness of a considered stream. The proposed approach has been thoroughly evaluated in both a video-on-demand (VoD)-only scenario and a scenario where VoD streams co-exist with live streaming sessions and non-deadline-aware traffic. It was shown that in a video streaming scenario the minimal bottleneck bandwidth can be reduced by 16% on average when using deadline-aware congestion control. In coexistence with other TCP traffic, a bottleneck reduction of 11% could be achieved.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879437","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}
Christian A. Hammerschmidt, Samuel Marchal, R. State, S. Verwer
{"title":"Behavioral clustering of non-stationary IP flow record data","authors":"Christian A. Hammerschmidt, Samuel Marchal, R. State, S. Verwer","doi":"10.1109/CNSM.2016.7818436","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818436","url":null,"abstract":"Automated network traffic analysis using machine learning techniques plays an important role in managing networks and IT infrastructure. A key challenge to the correct and effective application of machine learning is dealing with non-stationary learning data sources and concept drift. Traffic evolves overtime due to new technology, software, services being used, changes in user behavior but also due to changes in network graphs like dynamic IP address assignment. In this paper, we present an automatic online method to detect change-points in network traffic based on IP flow record analysis. This technique is used to segment an observed behavior into smaller consecutive behaviors differing one from another. The segmented traffic is used to learn small communication profile characterizing accurately the activities present between two observed change-points. We validate our method using synthetic data and outline a real-world application to botnet hosts behavior modeling.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129082643","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}
Gabriela F. Cretu-Ciocarlie, C. Corbett, Eric Yeh, Christopher I. Connolly, H. Sanneck, Muhammad Naseer ul Islam, B. Gajic, S. Nováczki, Kimmo Hätönen
{"title":"Diagnosis cloud: Sharing knowledge across cellular networks","authors":"Gabriela F. Cretu-Ciocarlie, C. Corbett, Eric Yeh, Christopher I. Connolly, H. Sanneck, Muhammad Naseer ul Islam, B. Gajic, S. Nováczki, Kimmo Hätönen","doi":"10.1109/CNSM.2016.7818422","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818422","url":null,"abstract":"Diagnosis functionality as a key component for automated Network Management (NM) systems allows rapid, machine-level interpretation of acquired data. In existing work, network diagnosis has focused on building “point solutions” using configuration and performance management, alarm, and topology information from one network. While the use of automated anomaly detection and diagnosis techniques within a single network improves operational efficiency, the knowledge learned by running these techniques across different networks that are managed by the same operator can be further maximized when that knowledge is shared. This paper presents a novel diagnosis cloud framework that enables the extraction and transfer of knowledge from one network to another. It also presents use cases and requirements. We present the implementation details of the diagnosis cloud framework for two specific types of models: topic models and Markov Logic Networks (MLNs). For each, we describe methods for assessing the quality of the local model, ranking models, adapting models to a new network, and performing detection and diagnosis. We performed experiments for the diagnosis cloud framework using real cellular network datasets. Our experiments demonstrate the feasibility of sharing topic models and MLNs.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123867729","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}
A. C. Riekstin, Thomas Dandres, K. Nguyen, R. Samson, M. Cheriet
{"title":"Monitoring and measurement system for green operation of geographically distributed ICT services","authors":"A. C. Riekstin, Thomas Dandres, K. Nguyen, R. Samson, M. Cheriet","doi":"10.1109/CNSM.2016.7818456","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818456","url":null,"abstract":"Despite recent efforts and important results already achieved, the reduction of energy consumption and carbon emissions by Information and Communication Technologies is still far from the expected goals. As the annual growth in traffic is doubling every two years with more and more connections to the Internet, to be energy and carbon-aware it is paramount to implement a Monitoring and Measurement System which supports green strategies in a geographically distributed environment. Such an environment has some specific challenges that must be taken into account, such as the WAN connection, security and latency concerns. On the other hand, it also provides opportunities to reduce operational costs and emissions, improve reliability and resources management etc. This work proposes a framework which is capable of supporting green metrics in network monitoring. The framework comprises temporally differentiated data on emission factors and provides ground information able to support different applications. We have implemented the framework in a nationwide testbed and our experiments show the framework is able to provide the ground information for customizable green metrics, like power/energy, traffic, and carbon equivalent emissions. This framework can be used as a support for a variety of applications which depend on energy and emissions metrics.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166878","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}
Jeremias Blendin, Daniel Herrmann, M. Wichtlhuber, M. Gunkel, Felix Wissel, D. Hausheer
{"title":"Enabling efficient multi-layer repair in elastic optical networks by gradually superimposing SDN","authors":"Jeremias Blendin, Daniel Herrmann, M. Wichtlhuber, M. Gunkel, Felix Wissel, D. Hausheer","doi":"10.1109/CNSM.2016.7818407","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818407","url":null,"abstract":"Multi-layer resilience is one of the prominent new concepts for modern carrier networks; it efficiently combines the advantages of the optical and the packet layer. However, not all features offered by modern optical transport networks can be fully used by the packet layer yet. In case of a fiber cut, an optical protection mechanism restores the original IP topology after a short transient time. But such an optical restoration is expected to use a new, longer light-path, which in turn might affect the optical capacity of the link. Bit-rate flexible optical transceivers are able to utilize the remaining optical capacity efficiently by adapting the network link capacity accordingly. However, the packet layer is not able to cope with fluctuating link capacities; often the policy is to rather shut down the link completely instead of using the remaining capacity. Consequently, this paper proposes a Segment Routing-based approach with superimposed Software-defined Networking (SDN) to allow the IP network to benefit from these new features. The minimally invasive, gradual deployment of the system is investigated, while keeping other proven and resilient technologies and systems unmodified. Using the topology and traffic matrix of a large German carrier the feasibility of such a deployment is evaluated.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588803","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}
Rashid Mijumbi, Sidhant Hasija, S. Davy, A. Davy, B. Jennings, R. Boutaba
{"title":"A connectionist approach to dynamic resource management for virtualised network functions","authors":"Rashid Mijumbi, Sidhant Hasija, S. Davy, A. Davy, B. Jennings, R. Boutaba","doi":"10.1109/CNSM.2016.7818394","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818394","url":null,"abstract":"Network Functions Virtualisation (NFV) continues to gain attention as a paradigm shift in the way telecommunications services are deployed and managed. By separating Network Functions (NFs) from traditional middleboxes, NFV is expected to lead to reduced CAPEX and OPEX, and to more agile services. However, one of the main challenges to achieving these objectives is on how physical resources can be efficiently, autonomously, and dynamically allocated to Virtualised Network Functions (VNFs) whose resource requirements ebb and flow. In this paper, we propose a Graph Neural Network (GNN)-based algorithm which exploits Virtual Network Function Forwarding Graph (VNF-FG) topology information to predict future resource requirements for each Virtual Network Function Component (VNFC). The topology information of each VNFC is derived from combining its past resource utilisation as well as the modelled effect on the same from VNFCs in its neighbourhood. Our proposal has been evaluated using a deployment of a virtualised IP Multimedia Subsystem (IMS), and real VoIP traffic traces, with results showing an average prediction accuracy of 90%. Moreover, compared to a scenario where resources are allocated manually and/or statically, our proposal reduces the average number of dropped calls by at least 27% and improves call setup latency by over 29%.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133320957","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}
T. Tsvetkov, Janne Ali-Tolppa, H. Sanneck, G. Carle
{"title":"A Steiner tree-based verification approach for handling topology changes in self-organizing networks","authors":"T. Tsvetkov, Janne Ali-Tolppa, H. Sanneck, G. Carle","doi":"10.1109/CNSM.2016.7818399","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818399","url":null,"abstract":"In today's Self-Organizing Networks (SONs) we differentiate between closed-loop functions, which have a predefined absolute goal, and such that form an action plan that achieves a high expected utility. Both function types perform changes to Configuration Management (CM) parameters, but only the second type may re-adapt the action plan in order to maximize the utility. A SON verification approach is one member of this particular function class. It is seen as a special type of anomaly detection that divides the network into sets of cells, triggers an anomaly detection algorithm for those sets, and finally generates CM undo actions for the abnormally performing cells. Unfortunately, one of the challenges verification strategies are facing are network topology changes. Typically, cells are switched on or off when energy saving features are enabled. However, enabling or disabling cells can negatively influence a verification mechanism which may create a suboptimal action plan or even blame certain CM changes that actually did not harm performance. In order to overcome this issue, we present an approach that is based on Steiner trees. In graph theory, a Steiner tree is a Minimum Spanning Tree (MST) whose costs can be reduced by adding additional vertexes to the graph. We use this tree to filter out anomalies caused by topology adjustments and such induced by other CM changes. In this paper, we also evaluate the proposed solution in several scenarios. First, in a simulation study we evaluate the functions that are used to build the Steiner tree. Second, we show how it positively affects the network performance when having concurrent CM and topology changes.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133569437","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}
Andreas Blenk, Patrick Kalmbach, Patrick van der Smagt, W. Kellerer
{"title":"Boost online virtual network embedding: Using neural networks for admission control","authors":"Andreas Blenk, Patrick Kalmbach, Patrick van der Smagt, W. Kellerer","doi":"10.1109/CNSM.2016.7818395","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818395","url":null,"abstract":"The allocation of physical resources to virtual networks, i.e., the virtual network embedding (VNE), is still an on-going research field due to its problem complexity. While many solutions for the online VNE problem exist, only few have focused on methods that can be generally applied for optimization of online embeddings. In this paper, we propose an admission control based on a Recurrent Neural Network (RNN) to improve the overall system performance for the online VNE problem. Before running a VNE algorithm to embed a virtual network request, the RNN predicts whether the request will be accepted by the VNE algorithm based on the current state of the substrate and the virtual network request (VNR). The RNN prevents VNE algorithms from spending time on VNRs that are either infeasible or that cannot be embedded in acceptable time. In order to train and operate the RNN efficiently, we additionally propose new representations for substrate networks and virtual network requests. The representations are based on topological and network resource features to represent the substrate network and the VNRs with low computational complexity. Via simulations, we show that our admission control reduces the overall computational time for the online VNE problem by up to 91 % while preserving VNE performance on average. Using our new substrate and request representations, the RNN achieves an accuracy ranging between 89 % and 98 % for different VNE algorithms, substrate sizes, and VNR arrival rates.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131082051","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":"Efficient detection of flow anomalies with limited monitoring resources","authors":"Jalil Moraney, D. Raz","doi":"10.1109/CNSM.2016.7818400","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818400","url":null,"abstract":"Real time detection of flow anomalies is a critical part of wide range of management and security applications in many Cloud and NFV systems. Solutions based on per-flow records have become impossible due to the increasing traffic volumes and the limited available resources such as TCAM entries and fast counters. In this paper we study a novel dynamic control mechanism that allows detecting flow anomalies using only a limited number of counters. Starting from the simple observation that it is impossible to guarantee instantaneous detection of flow anomalies with a limited amount of counters, we study the trade-off between the time required to detect the anomaly and the number of available counters. We implemented the scheme in an OpenFlow enabled switch, where the logic is implemented in the controller, and demonstrate that it can be used to detect a single flow anomaly within large real traffic volume. To further reduce the detection time, we also implemented the scheme logic inside the switch and used the controller only for configuration. This implementation indeed yielded a faster detection and lower monitoring communication overhead while not introducing any significant observable costs at the switch itself.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114322388","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}
V. Aggarwal, A. Mahimkar, Hongyao Ma, Zemin Zhang, S. Aeron, W. Willinger
{"title":"Inferring smartphone service quality using tensor methods","authors":"V. Aggarwal, A. Mahimkar, Hongyao Ma, Zemin Zhang, S. Aeron, W. Willinger","doi":"10.1109/CNSM.2016.7818429","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818429","url":null,"abstract":"Cellular network providers collect and use a wide variety of data for assessing the service quality experienced by their smartphone users. The data is essential for tasks ranging from event detection, problem diagnosis, impact analysis, coverage and capacity planning, load balancing, and performance optimization. For example, service quality measurements and data from drive-by tests provide useful and detailed information about different aspects of quality of service such as dropped calls due to handovers or radio interference. However, a major challenge for effective service quality management in operational setup is the presence of missing or unavailable data. Furthermore, the cellular data is inherently multidimensional, i.e. is a function of several variables such as location, device type, and time. Motivated by recent advances in handling multidimensional data, we propose to use tensor algebraic models and methods for cellular data prediction. The main idea is to model the data as a low rank tensor and use a rank constrained interpolation for data prediction. We focus on two recently proposed algebraic models employing two different notions of tensor rank. We test and compare the performance of the two approaches on real-world data sets collected from an operational cellular network and indicate the regimes in which one method is superior to the other. Based on these observations the proposed algorithm chooses the best of the two approaches using cross-validation.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121272458","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}