{"title":"Experiments or simulation? A characterization of evaluation methods for in-memory databases","authors":"Karsten Molka, G. Casale","doi":"10.1109/CNSM.2015.7367360","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367360","url":null,"abstract":"The recent growth of interest for in-memory databases poses the question on whether established prediction methods such as response surfaces and simulation are effective to describe the performance of these systems. In particular, the limited dependence of in-memory technologies on the disk makes methods such as simulation more appealing than in the past, since disks are difficult to simulate. To answer this question, we study an in-memory commercial solution, SAP HANA, deployed on a high-end server with 120 physical cores. First, we apply experimental design methods to generate response surfaces that describe database performance as a function of workload and hardware parameters. Next, we develop a class-switching queueing network model to predict in-memory database performance under similar scenarios. By comparing the applicability of the two approaches to modeling multi-tenancy, we find that both queueing and response surface models yield mean prediction errors in the range 5%-22% with respect to mean memory occupancy and response times, but the accuracy for the latter deteriorates in response surfaces as the number of experiments are reduced, whereas simulation is effective in all cases. This suggests that simulation can be very effective in performance prediction for in-memory database management.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685220","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":"Recommending ticket resolution using feature adaptation","authors":"Wubai Zhou, Tao Li, L. Shwartz, G. Grabarnik","doi":"10.1109/CNSM.2015.7367333","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367333","url":null,"abstract":"In recent years, IT Service Providers have been rapidly introducing automation to their service delivery model. Driven by market pressure to reduce cost and maintain quality of services, they are looking for technologies that will allow rapid progress towards attainment of truly automated service delivery. Software monitoring systems are designed to actively collect and signal event occurrences and, when necessary, automatically generate incident tickets. Repeating events generate similar tickets, which in turn have a vast number of repeated problem resolutions likely to be found in earlier tickets. In our work, we develop techniques to recommend an appropriate resolution for incoming events by making use of similarities between the events and historical resolutions of similar events. The traditional KNN (K Nearest Neighbor) algorithm has been first applied to recommend resolutions for incoming tickets. Massive heterogeneous applications as well as various monitoring software are running on clients' servers to accomplish required tasks and to monitor system health via different metrics. It leads to generation of correlated tickets that have different symptom descriptions but similar resolutions. Furthermore, change of servers' environments can also induce similar situations in which ticket descriptions differ before and after change but could have similar resolutions. These correlated tickets cause performance degradation in ticket resolution recommendation. Therefore, we propose using SCL (structural corresponding learning) based feature adaptation to uncover feature mapping in different time intervals. Moreover, to put more insights into the periodic regularities existing in our ticket datasets, we apply our algorithm on tickets grouped by different time interval granularities. Extensive empirical evaluations on real-world ticket data sets demonstrate the effectiveness and efficiency of our proposed methods.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130647961","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":"Dynamically adaptive policies for dynamically adaptive telecommunications networks","authors":"S. Meer, J. Keeney, Liam Fallon","doi":"10.1109/CNSM.2015.7367357","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367357","url":null,"abstract":"New technologies are changing the world of communication networks and even more so their management. Cloud computing and predictive analytics have removed the need for specialized compute hardware and created products that continuously search for and find insights in management data. Virtualization of networks and network functions, SDN and NFV, are beginning to be mature enough for production networks resulting in much more flexible and dynamic networks. IoT and M2M traffic and new customer demands are driving new thinking and demands for 5G networks. Almost every aspect in the control and management of networks has seen new dimensions of flexibility and dynamicity, with the notable exception of the policies that drive them. This paper discusses the need to add adaptiveness to classic policies, describes a novel approach for adaptive policies, shows how adaptive policies will form part of future network frameworks and architectures, and finally discusses early use cases developed for mobile operators.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132029305","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":"Modeling the impact of QoS pricing on ISP integrated services and OTT services","authors":"Wei Dai, Ji Won Baek, S. Jordan","doi":"10.1109/CNSM.2015.7367343","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367343","url":null,"abstract":"We are concerned with whether a vertically integrated broadband and content provider can unreasonably advantage itself over competing content providers, either by selling quality-of-service (QoS) to content providers at unreasonably high prices, or by refusing to provide access to QoS to competing content. We address this question by modeling the competition between one such vertically integrated provider and one over-the-top (OTT) content provider. We analytically determine when the broadband provider will sell QoS and when the OTT content provider or users will purchase QoS. We characterize the optimal QoS and video service prices. The ISP's market share increases with the difference in the value of the two video services and decreases with the difference in the corresponding costs. Numerical results illustrate the effect of QoS price on content price, and the variation of market share and profit with QoS price. The ISP may sell QoS to users at a lower price than when QoS is sold to the OTT provider.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128771198","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":"A fast algorithm for detecting anomalous changes in network traffic","authors":"Tingshan Huang, H. Sethu, Nagarajan Kandasamy","doi":"10.1109/CNSM.2015.7367366","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367366","url":null,"abstract":"Anomalies in communication network traffic caused by malware or denial-of-service attacks manifest themselves in structural changes in the covariance matrix of traffic features. Real-time detection of anomalies in high-dimensional data demands a very efficient algorithm to identify these changes in a compact low-dimensional representation. This paper presents an efficient algorithm for the rapid detection of structural differences between two covariance matrices, as measured by the maximum possible angle between the subspaces specified by subsets of the two sets of principal components of the matrices. We show that our algorithm achieves a significantly lower computational complexity compared to a naive approach. Finally, we apply our results to real traffic traces from Internet backbone links and show that our approach offers a substantial reduction in the computational overhead of anomaly detection.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123089190","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":"Towards HSS as a virtualized service for 5G networks","authors":"H. Alipour, F. Belqasmi, M. Abu-Lebdeh, R. Glitho","doi":"10.1109/CNSM.2015.7367351","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367351","url":null,"abstract":"Home Subscriber Server (HSS) is the main database of the current generation's cellular communications systems. It contains subscriber-related information, such as the authentication information and the list of services to which each user is subscribed. The anticipated tremendous increase in the number of subscribers, services and devices (M2M) in 5G networks brings new challenges with regard to HSS provisioning. It calls for more scalability and elasticity regarding information storage, access and management. The current method for increasing the number of HSSs deployed is certainly not the most cost efficient solution. On the other hand, advanced virtualization techniques can aid in tackling the challenges while enabling a smooth migration to 5G. This paper proposes a new architecture for a scalable and elastic HSS using virtualization. The new architecture enables easy and rapid deployment of new HSS instances at a minimal cost, while increasing efficiency of the use of resources. The paper presents the architecture, demonstrates its use via a case scenario, describes the implemented proof of concept prototype and evaluates the performance results.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121696278","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}
Julius Rückert, Jeremias Blendin, Rhaban Hark, D. Hausheer
{"title":"DYNSDM: Dynamic and flexible software-defined multicast for ISP environments","authors":"Julius Rückert, Jeremias Blendin, Rhaban Hark, D. Hausheer","doi":"10.1109/CNSM.2015.7367347","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367347","url":null,"abstract":"A number of today's over-the-top (OTT) services could greatly benefit from a scalable and efficient network-layer multicast support on the Internet. IP multicast showed to not meet these requirements and, thus, is not available for this purpose. Content Delivery Networks emerged as global alternative but usually end at the border of ISP networks. Software-Defined Multicast (SDM) is proposed in a previous work by the authors, enabling ISP-internal network-layer multicast delivery of OTT traffic. While it coins fundamental concepts, it does not detail the ISP-internal traffic and service management and leaves important questions unanswered. To this end, DYNSDM is proposed in this paper, detailing the multicast planning and management, proposing a novel network-layer multi-tree mechanism to distribute traffic on links inside the ISP network, and introducing mechanisms to handle group and network dynamics. DYNSDM was prototypically evaluated, showing its high traffic efficiency, good scalability, and superior traffic distribution characteristics.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122808145","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":"Demonstrating topoS: Theorem-prover-based synthesis of secure network configurations","authors":"C. Diekmann, Andreas Korsten, G. Carle","doi":"10.1109/CNSM.2015.7367384","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367384","url":null,"abstract":"In network management, when it comes to security breaches, human error constitutes a dominant factor. We present our tool topoS which automatically synthesizes low-level network configurations from high-level security goals. The automation and a feedback loop help to prevent human errors. Except for a last serialization step, topoS is formally verified with Isabelle/HOL, which prevents implementation errors. In a case study, we demonstrate topoS by example. For the first time, the complete transition from high-level security goals to both firewall and SDN configurations is presented.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852379","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":"Design and evaluation of elastic media resource allocation algorithms using CloudSim extensions","authors":"R. Xavier, Hendrik Moens, B. Volckaert, F. Turck","doi":"10.1109/CNSM.2015.7367377","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367377","url":null,"abstract":"With the maturity of Cloud computing comes research into converting a range of traditionally best effort programs into cloud-enabled services. One such service currently under investigation in the Elastic Media Distribution (EMD) project, is how to enable qualitative, reliable and scalable realtime media collaboration services using proven Cloud technology. While existing best-effort solutions provide plenty of features, they do not provide the quality guarantees and reliability required for critical services in globally distributed corporations. On the other hand, some pricey dedicated solutions do offer these low-delay, reliable cooperation services, but without the benefits that clouds can bring in terms of scalability. In this paper we describe results attained in the EMD project on novel resource provisioning algorithms for a mixture of end-to-end Audio/Video streams with file-based transfers, allowing for configurable tradeoffs between service response time and cost. We extended the CloudSim simulator with models allowing us to simulate collaborative interactive sessions (more specifically educational real-time collaboration), and evaluated the performance of our proposed provisioning heuristics. The results show that the proposed dynamic algorithm allows for automated cost-performance tradeoff by reducing average total Virtual Machine (VM) cost by a maximum of 58% compared to more naive approaches, while keeping average time for clients to join a meeting in line.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131427026","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}
R. Riggio, Abbas Bradai, T. Rasheed, Julius Schulz-Zander, S. Kukliński, T. Ahmed
{"title":"Virtual network functions orchestration in wireless networks","authors":"R. Riggio, Abbas Bradai, T. Rasheed, Julius Schulz-Zander, S. Kukliński, T. Ahmed","doi":"10.1109/CNSM.2015.7367346","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367346","url":null,"abstract":"Network Function Virtualization (NFV) is emerging as one of the most innovative concepts in the networking landscape. By migrating network functions from dedicated mid-dleboxes to general purpose computing platforms, NFV can effectively reduce the cost to deploy and to operate large networks. However, in order to achieve its full potential, NFV needs to encompass also the radio access network allowing Mobile Virtual Network Operators to deploy custom resource allocation solutions within their virtual radio nodes. Such requirement raises several challenges in terms of performance isolation and resource provisioning. In this work we formalize the Virtual Network Function (VNF) placement problem for radio access networks as an integer linear programming problem and we propose a VNF placement heuristic. Moreover, we also present a proof-of-concept implementation of an NFV management and orchestration framework for Enterprise WLANs. The proposed architecture builds upon a programmable network fabric where pure forwarding nodes are mixed with radio and packet processing nodes leveraging on general computing platforms.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133587191","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}