{"title":"DynaQoS: Model-free self-tuning fuzzy control of virtualized resources for QoS provisioning","authors":"J. Rao, Yudi Wei, Jiayu Gong, Chengzhong Xu","doi":"10.1109/IWQOS.2011.5931341","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931341","url":null,"abstract":"Cloud elasticity allows dynamic resource provisioning in concert with actual application demands. Feedback control approaches have been applied with success to resource allocation in physical servers. However, cloud dynamics make the design of an accurate and stable resource controller more challenging, especially when response time is considered as the measured output. Response time is highly dependent on the characteristics of workload and sensitive to cloud dynamics. To address the challenges, we extend a self-tuning fuzzy control (STFC) approach, originally developed for response time assurance in web servers to resource allocation in virtualized environments. We introduce mechanisms for adaptive output amplification and flexible rule selection in the STFC approach for better adaptability and stability. Based on the STFC, we further design a two-layer QoS provisioning framework, DynaQoS, that supports adaptive multi-objective resource allocation and service differentiation. We implement a prototype of DynaQoS on a Xen-based cloud testbed. Experimental results on an E-Commerce benchmark show that STFC outperforms popular controllers such as Kalman filter, ARMA and adaptive PI by at least 16% and 37% under both static and dynamic workloads, respectively. Further results with multiple control objectives and service classes demonstrate the effectiveness of DynaQoS in performance-power control and service differentiation.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129253966","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":"Thwarting Spam over Internet Telephony (SPIT) attacks on VoIP networks","authors":"Hemant Sengar, Xinyuan Wang, Arthur Nichols","doi":"10.1109/IWQOS.2011.5931335","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931335","url":null,"abstract":"The threat of voice spam, commonly known as Spam over Internet Telephony (SPIT) is a real and contemporary problem. We present two approaches based on the anomaly detection of the distributions of selected call features (i.e., day and time of calling, call durations etc.) to detect and prevent SPITting over the Internet. The first approach uses Mahalanobis Distance as a summarization tool and it is able to reliably detect individual spam VoIP calls at a microscopic level. The second approach is designed to detect groups of (potentially collaborating) VoIP spam calls at a macroscopic level. By computing entropy of call durations of groups of calls, we are able to build profile of normal calls and reliably detect the deviation from normal human call behavior that are caused by bulk spam calls.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122352976","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":"Adaptive data-driven service integrity attestation for multi-tenant cloud systems","authors":"Juan Du, Xiaohui Gu, Nidhi Shah","doi":"10.1109/IWQOS.2011.5931339","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931339","url":null,"abstract":"Cloud systems provide a cost-effective service hosting infrastructure for application service providers (ASPs). However, cloud systems are often shared by multiple tenants from different security domains, which makes them vulnerable to various malicious attacks. Moreover, cloud systems often host long-running applications such as massive data processing, which provides more opportunities for attackers to exploit the system vulnerability and perform strategic attacks. In this paper, we present AdapTest, a novel adaptive data-driven runtime service integrity attestation framework for multi-tenant cloud systems. AdapTest can significantly reduce attestation overhead and shorten detection delay by adaptively selecting attested nodes based on dynamically derived trust scores. Our scheme treats attested services as black-boxes and does not impose any special hardware or software requirements on the cloud system or ASPs. We have implemented AdapTest on top of the IBM System S stream processing system and tested it within a virtualized computing cluster. Our experimental results show that AdapTest can reduce attestation overhead by up to 60% and shorten the detection delay by up to 40% compared to previous approaches.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116701138","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":"An MDP-based admission control for a QoS-aware service-oriented system","authors":"Marco Abundo, V. Cardellini, F. L. Presti","doi":"10.1109/IWQOS.2011.5931324","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931324","url":null,"abstract":"In this paper, we address the problem of providing a service broker, which offers to prospective users a composite service with a range of different Quality of Service (QoS) classes, with a forward-looking admission control policy based on Markov Decision Processes (MDPs).","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132871707","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":"Initial CWND determination method for fast startup TCP algorithms","authors":"Sho Kodama, M. Shimamura, K. Iida","doi":"10.1109/IWQOS.2011.5931321","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931321","url":null,"abstract":"Since the TCP transmission rate is low during the startup phase, the QoS of various applications is seriously degraded. To improve the TCP transmission rate in the startup phase, many fast startup algorithms have been proposed. In this paper, we evaluate the fundamental performance of fast startup algorithms. Specifically, we focus on the initial window size and Rate-Based Pacing (RBP) start method, which is employed by many of fast startup algorithms. Through the simulation experiments, we first compare the performance of the RBP start method with that of the normal TCP. We then derive a way to set the initial window size for fast startup TCP algorithms.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128175884","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":"Applying stochastic network calculus to 802.11 backlog and delay analysis","authors":"Yue Wang, Tianmei Wang","doi":"10.1109/IWQOS.2011.5931337","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931337","url":null,"abstract":"Stochastic network calculus provides an elegant way to characterize traffic and service processes. However, little effort has been made on applying it to multi-access communication systems such as 802.11. In this paper, we take the first step to apply it to the backlog and delay analysis of an 802.11 wireless local network. We found the derived bounds are very loose in comparison to ns-2 simulation results especially for heavy arriving traffic, indicating that improvements are needed for the current version of stochastic network calculus.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122578816","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":"Evaluating coverage quality through best covered pathes in wireless sensor networks","authors":"Shaojie Tang, Xufei Mao, Xiangyang Li, Guojun Dai","doi":"10.1109/IWQOS.2011.5931351","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931351","url":null,"abstract":"Coverage quality is one critical metric to evaluate the Quality of Service (QoS) provided by wireless sensor net works. In this paper, we address maximum support coverage problem (a.k.a. best case coverage) in wireless sensor networks. Most of the existing work assume that the coverage degree is 1, i.e. every point on the resultant path should fall within the sensing range of at least one sensor node. Here we study the k -coverage problem, in which every point on the resultant path is covered by at least k sensors while optimizing certain objectives. We present tackle this problem under both centralized and distributed setting. The time complexity is bounded by O(k2n log n) where n is the number of deployed sensor nodes. To the best of our knowledge, this is the first work that presents polynomial time algorithms that find optimal k-support paths for a general k.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501541","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":"Architecture and algorithms for virtual routers as a service","authors":"Z. Bozakov","doi":"10.1109/IWQOS.2011.5931325","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931325","url":null,"abstract":"The deployment of virtualized network resources has the potential to spur new business models and increase flexibility for network customers as well as infrastructure operators. It is worthwhile to re-evaluate how to effectively express traditional network elements in the virtualization domain. In this paper we consider network routers and argue that the representation of routing functionality as a service, rather than an isolated virtual resource is better suited in the virtualization context. We present an architecture enabling physical infrastructure operators to provide routing as a service. To this end, distributed forwarding elements are combined to appear a single virtual router instance which routes traffic between a set of customer points of presence. We provide embedding algorithms for virtual router topologies with minimum allocation cost. We consider the customer's geographical attachment to the network, bandwidth demands as well as capacity constraints in the core substrate. Moreover, we present a live-migration approach for the virtual router data plane which allows network operators to quickly adapt resources to changing network demands.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867435","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":"Distributed learning approach for channel selection in Cognitive Radio Networks","authors":"Chowdhury Sayeed Hyder, Li Xiao","doi":"10.1109/IWQOS.2011.5931327","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931327","url":null,"abstract":"Cognitive Radio Network (CRN) is an emerging networking concept that has been introduced to solve the spectrum scarcity problem. There are typically two kinds of users in CRN-primary users (PU) and secondary users (SU). SUs can opportunistically use licensed channels without interfering with the ongoing transmission of PUs. The successful transmission depends mostly on the selection of idle channels by SUs. Hence, channel selection under the aforementioned constraints is a significant research problem.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122033616","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-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows","authors":"R. K. Kalle, Umamaheswari Devi, S. Kalyanaraman","doi":"10.1109/IWQOS.2011.5931315","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931315","url":null,"abstract":"The increasing demand for high-quality streaming video delivered to mobile clients necessitates efficient bandwidth utilization and allocation at not only the wireless channel but also the wired backhaul of broadband wireless networks. In this context, we propose techniques for increasing the link utilization and enhancing the quality-of-experience (QoE) for end users while multiplexing video streams over a wired link. For increasing the link utilization, we present a generic multi-tiered bandwidth estimation and scheduling scheme that can guarantee lower bounds on loss for flows at lower tiers. This scheme can be used for supporting heterogeneous loss classes, differentiated losses for different layers of video streams, or per-flow guarantees using lower aggregate bandwidth than schemes proposed in the literature. For enhancing the end-user QoE, we present a scheme for minimizing correlated losses and improving the smoothness of video quality by minimizing the maximum loss suffered by any logical unit of a stream and also the variability in loss across the length of the stream. In simulations performed using MPEG-4 sources, our loss-minimization approach could lower the maximum loss by a factor of five and the loss variance by more than an order of magnitude. Our multi-tiered scheme could lower the estimated bandwidth and improve statistical multiplexing gains by 10–20% with three classes, 5–20% with two classes, and over 30% in the context of providing deterministic per-flow guarantees.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823271","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}