Gabriel Alatorre, N. Mandagere, Yang Song, Heiko Ludwig
{"title":"On selective compression of primary data","authors":"Gabriel Alatorre, N. Mandagere, Yang Song, Heiko Ludwig","doi":"10.1109/CNSM.2015.7367358","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367358","url":null,"abstract":"With the advent of social media, Internet of Things (IoT), widespread use of richer media formats such as video, and generally increased use of mobile devices, volume of online data has seen a rapid increase in recent years. To cope with this data explosion, businesses and cloud providers are scrambling to lower the cost of storing data without sacrificing the quality of their service using space reduction techniques such as compression and deduplication. Capacity savings, however, are achieved at the cost of performance and additional resource overheads. One drawback of compression techniques is the additional computation required to store and fetch data, which may significantly increase response time, i.e., I/O latency. Worse yet, inefficient compression algorithms that fail to compress data satisfactorily suffer from the latency penalty with marginal capacity savings, e.g., deciding to compress data that is encrypted or already compressed. Therefore, from a data center administrator's perspective, we should pick the set of volumes that will yield the most compression space saving with the least latency for a given amount of computation capacity, without exhaustively inspecting the data content of volumes. To fill this void, this paper proposes an approach to manage compression for a very large set of volumes. It maximizes capacity savings and minimizes latency impact without scanning the actual data content (to avoid security concerns). Our pilot deployments show significant capacity savings and performance improvements compared to benchmark compression strategies.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657062","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}
Ji Xue, Feng Yan, R. Birke, L. Chen, T. Scherer, E. Smirni
{"title":"PRACTISE: Robust prediction of data center time series","authors":"Ji Xue, Feng Yan, R. Birke, L. Chen, T. Scherer, E. Smirni","doi":"10.1109/CNSM.2015.7367348","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367348","url":null,"abstract":"We analyze workload traces from production data centers and focus on their VM usage patterns of CPU, memory, disk, and network bandwidth. Burstiness is a clear characteristic of many of these time series: there exist peak loads within clear periodic patterns but also within patterns that do not have clear periodicity. We present PRACTISE, a neural network based framework that can efficiently and accurately predict future loads, peak loads, and their timing. Extensive experimentation using traces from IBM data centers illustrates PRACTISE's superiority when compared to ARIMA and baseline neural network models, with average prediction errors that are significantly smaller. Its robustness is also illustrated with respect to the prediction window that can be short-term (i.e., hours) or long-term (i.e., a week).","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130029443","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}
Niels Soetens, J. Famaey, M. Verstappen, Steven Latré
{"title":"SDN-based management of heterogeneous home networks","authors":"Niels Soetens, J. Famaey, M. Verstappen, Steven Latré","doi":"10.1109/CNSM.2015.7367391","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367391","url":null,"abstract":"In recent years a lot of new consumer devices have been introduced to the home network. Modern home networks usually consists of multiple heterogeneous communication technologies such as Ethernet, Wi-Fi and power-line communications. Today, the user has to manually decide which transmission technology to use as there is no automated optimization across technologies. Load balancing algorithms can improve overall throughput while redundant links also provide the opportunity to switch flows in case of link failures. Current standards either lack real implementation in consumer devices or do not have the flexibility to support all necessary functionality towards creating a convergent hybrid home network. Therefore, we propose an alternative way by using Software-Defined Networking techniques to manage a heterogeneous home network. In this paper we specifically evaluate the ability of OpenFlow-enabled switches to perform link switching both under normal conditions and in case of link failures. Our results show that SDN-based management can be used to improve heterogeneous home networks by utilising redundant links for flow rerouting. However, they also show that improvements are still needed to reduce downtime during link failure or rerouting in case of TCP traffic.","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130077205","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":"Fault-tolerant application placement in heterogeneous cloud environments","authors":"Bart Spinnewyn, B. Braem, Steven Latré","doi":"10.1109/CNSM.2015.7367359","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367359","url":null,"abstract":"The Internet of Things (IoT) has inspired a myriad of real-time applications, such as robotics and human-machine interaction. Many IoT applications have significant computational requirements, while at the same time they demand very low latencies. The cloud can provide the needed resources on-demand, however often fails to meet these timing requirements. Low response time can only be realized by having computational infrastructure in close vicinity. Therefore we investigate to what extent the cloud can be extended in the direct wireless surroundings of the IoT devices. This environment is highly heterogeneous as it comprises a wide variety of devices, connected using a plethora of technologies (both wired and wireless). A direct implication is that, compared to traditional cloud infrastructure, many of those nodes and links are likely to fail. We propose an application placement that can overcome failure-related challenges. We demonstrate that availability-awareness can increase the number of applications that can be hosted simultaneously by 132%. Furthermore we find that an additional increase of 54% can be realized through redundant provisioning of resources.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133440040","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}
Abbas Soltanian, M. A. Salahuddin, H. Elbiaze, R. Glitho
{"title":"A resource allocation mechanism for video mixing as a cloud computing service in multimedia conferencing applications","authors":"Abbas Soltanian, M. A. Salahuddin, H. Elbiaze, R. Glitho","doi":"10.1109/CNSM.2015.7367337","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367337","url":null,"abstract":"Multimedia conferencing is the conversational exchange of multimedia content between multiple parties. It has a wide range of applications (e.g. Massively Multiplayer Online Games (MMOGs) and distance learning). Many multimedia conferencing applications use video extensively, thus video mixing in conferencing settings is of critical importance. Cloud computing is a technology that can solve the scalability issue in multimedia conferencing, while bringing other benefits, such as, elasticity, efficient use of resources, rapid development, and introduction of new applications. However, proposed cloud-based multimedia conferencing approaches so far have several deficiencies when it comes to efficient resource usage while meeting Quality of Service (QoS) requirements. We propose a solution to optimize resource allocation for cloud-based video mixing service in multimedia conferencing applications, which can support scalability in terms of number of users, while guaranteeing QoS. We formulate the resource allocation problem mathematically as an Integer Linear Programming (ILP) problem and design a heuristic for it. Simulation results show that our resource allocation model can support more participants compared to the state-of-the-art, while honoring QoS, with respect to end-to-end delay.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141738","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}