2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)最新文献_第6页

Improving revenue for reliability-aware VDC embedding in a software-defined data center 提高在软件定义数据中心中嵌入可靠性感知VDC的收益

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590413

Xuemin Wen, Yanni Han, Ting Yu, Xin Chen, Zhen Xu

引用次数: 4

Traffic big data based path planning strategy in public vehicle systems 基于交通大数据的公共车辆系统路径规划策略

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590400

M. Zhu, Xiao-Yang Liu, Meikang Qiu, R. Shen, W. Shu, Minyou Wu

引用次数: 15

Efficient and proactive V2V information diffusion using Named Data Networking 使用命名数据网络的高效和主动的V2V信息扩散

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590391

Yang Wang, Hengchang Liu, Liusheng Huang, J. Stankovic

引用次数: 9

Selecting most informative contributors with unknown costs for budgeted crowdsensing 选择最具信息性且成本未知的贡献者进行预算众测

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590447

Shuo Yang, Fan Wu, Shaojie Tang, Tie Luo, Xiaofeng Gao, L. Kong, Guihai Chen

{"title":"Selecting most informative contributors with unknown costs for budgeted crowdsensing","authors":"Shuo Yang, Fan Wu, Shaojie Tang, Tie Luo, Xiaofeng Gao, L. Kong, Guihai Chen","doi":"10.1109/IWQoS.2016.7590447","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590447","url":null,"abstract":"Mobile crowdsensing has become a novel and promising paradigm in collecting environmental data. A critical problem in improving the QoS of crowdsensing is to decide which users to select to perform sensing tasks, in order to obtain the most informative data, while maintaining the total sensing costs below a given budget. The key challenges lie in (i) finding an effective measure of the informativeness of users' data, (ii) learning users' sensing costs which are unknown a priori, and (iii) designing efficient user selection algorithms that achieve low-regret guarantees. In this paper, we build Gaussian Processes (GPs) to model spatial locations, and provide a mutual information-based criteria to characterize users' informativeness. To tackle the second and third challenges, we model the problem as a budgeted multi-armed bandit (MAB) problem based on stochastic assumptions, and propose an algorithm with theoretically proven low-regret guarantee. Our theoretical analysis and evaluation results both demonstrate that our algorithm can efficiently select most informative users under stringent constraints.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115024348","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}

引用次数: 23

MCTCP: Congestion-aware and robust multicast TCP in Software-Defined networks MCTCP:软件定义网络中的拥塞感知和鲁棒多播TCP

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590433

Tingwei Zhu, F. Wang, Yu Hua, D. Feng, Yong Wan, Qingyu Shi, Yanwen Xie

{"title":"MCTCP: Congestion-aware and robust multicast TCP in Software-Defined networks","authors":"Tingwei Zhu, F. Wang, Yu Hua, D. Feng, Yong Wan, Qingyu Shi, Yanwen Xie","doi":"10.1109/IWQoS.2016.7590433","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590433","url":null,"abstract":"Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, raising new requirements for multicast transport in terms of efficiency and robustness. Existing reliable multicast solutions, which suffer from low robustness and inefficiency in either host-side protocols or multicast routing, are not suitable for data centers. In order to address the problems of inefficiency and low robustness, we present a sender-initiated, efficient, congestion-aware and robust reliable multicast solution mainly for small groups in SDN-based data centers, called MCTCP. The main idea behind MCTCP is to manage the multicast groups in a centralized manner, and reactively schedule multicast flows to active and low-utilized links, by extending TCP as the host-side protocol and managing multicast groups in the SDN-controller. The multicast spanning trees are calculated and adjusted according to the network status to perform a better allocation of resources. Our experiments show that, MCTCP can dynamically bypass the congested and failing links, achieving high efficiency and robustness. As a result, MCTCP outperforms the state-of-the-art reliable multicast schemes. Moreover, MCTCP improves the performance of data replication in HDFS compared with the original and TCP-SMO based ones, e.g., achieves 101% and 50% improvements in terms of bandwidth, respectively.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603537","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}

引用次数: 20

Zebra: Demand-aware erasure coding for distributed storage systems Zebra:用于分布式存储系统的需求感知擦除编码

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590388

Jun Li, Baochun Li

{"title":"Zebra: Demand-aware erasure coding for distributed storage systems","authors":"Jun Li, Baochun Li","doi":"10.1109/IWQoS.2016.7590388","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590388","url":null,"abstract":"Erasure coding has been increasingly replacing replication in distributed storage systems, thanks to its lower storage overhead with the same level of failure tolerance. However, with lower storage overhead, the reconstruction overhead of erasure codes can increase significantly as well. Under the ever-changing workload, in which the data access can be highly skewed, it is difficult to achieve a well trade-off between the storage overhead and the reconstruction overhead. In this paper, we propose Zebra, a framework that encodes data into multiple tiers by their demand. Given the overall storage overhead and the number of failures to tolerate, Zebra determines the parameters of erasure coding in each tier by solving a geometric programming problem. Based on the demand of data, Zebra can dynamically assign data into the corresponding tiers to minimize the overall reconstruction overhead, and achieve a flexible tradeoff between the storage overhead and the reconstruction overhead in multiple tiers, such that hot data can enjoy less overhead of reconstruction and cold data can be stored with lower storage overhead. When demand changes, Zebra can adjust itself accordingly with a marginal amount of network transfer.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116391","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}

引用次数: 8

FICUS: Fast Incremental Consistent Update in SDN based on relation graph 基于关系图的SDN快速增量一致性更新

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590421

Qing Li, Lei Wang, Yong Jiang, Guangwu Hu, Mingwei Xu, Q. Liao

引用次数: 2

Real-time detection of performance anomalies for cloud services 实时检测云服务性能异常

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590412

Olumuyiwa Ibidunmoye, Thijs Metsch, E. Elmroth

引用次数: 12

Demystifying the energy efficiency of Network Function Virtualization 揭秘网络功能虚拟化的能源效率

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590429

Zhifeng Xu, Fangming Liu, Tao Wang, Hong Xu

引用次数: 36

Truthful incentive mechanism for vehicle-based nondeterministic crowdsensing 基于车辆的不确定性群体感知的真实激励机制

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-06-20 DOI: 10.1109/IWQoS.2016.7590452

Chang Hu, Mingjun Xiao, Liusheng Huang, Guoju Gao

{"title":"Truthful incentive mechanism for vehicle-based nondeterministic crowdsensing","authors":"Chang Hu, Mingjun Xiao, Liusheng Huang, Guoju Gao","doi":"10.1109/IWQoS.2016.7590452","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590452","url":null,"abstract":"Nowadays, vehicles have shown great potential in crowdsensing. To guarantee a good Quality of Service (QoS), stimulating enough vehicles to participate in crowdsensing is very necessary. In this paper, we focus on the incentive mechanism design in the vehicle-based nondeterministic crowdsensing. Different from existing works, we take into consideration that each vehicle performs sensing tasks along some trajectories with different probabilities, and each task must be successfully performed with a joint probability no less than a threshold. Designing an incentive mechanism for such a nondeterministic crowdsensing system is challenging, which contains a non-trivial set cover problem with non-linear constraints. To solve the problem, we propose a truthful incentive mechanism based on reverse auction, including an approximation algorithm to select winning bids with a nearly minimum social cost, and a payment algorithm to determine the payments for all participants. Through theoretical analysis, we prove that our incentive mechanism is truthful and individual rational, and we give an approximation ratio of the winning bid selection algorithm. In addition, we conduct extensive simulations, based on a real vehicle trace, to validate the performances of the proposed incentive mechanism.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516049","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}

引用次数: 16