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

Choquet integral based QoS-to-QoE mapping for mobile VoD applications 基于Choquet积分的移动VoD应用的qos到qoe映射

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

Yanwei Liu, Jinxia Liu, Zhen Xu, S. Ci

引用次数: 4

Bandwidth-aware delayed repair in distributed storage systems 分布式存储系统的带宽感知延迟修复

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

Jiajie Shen, Jiazhen Gu, Yangfan Zhou, Xin Wang

{"title":"Bandwidth-aware delayed repair in distributed storage systems","authors":"Jiajie Shen, Jiazhen Gu, Yangfan Zhou, Xin Wang","doi":"10.1109/IWQoS.2016.7590386","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590386","url":null,"abstract":"In data storage systems, data are typically stored in redundant storage nodes to ensure storage reliability. When storage nodes fail, with the help of the redundant nodes, the lost data can be restored in new storage nodes. Such a regeneration process may be aborted, since storage nodes may fail during the process. Therefore, reducing the time of regeneration process is a well-known challenge to improve the reliability of storage systems. Delayed repair is a typical repair scheme in real-world storage systems. It reduces the overhead of the regeneration process by recovering multiple node failures simultaneously. How to reduce the regeneration time of delayed repair is yet to be well addressed. Since available bandwidth is flowing in storage systems and the regeneration time is seriously affected by the available bandwidth, we find the key to solve this problem is determining the start time of the regeneration process. Via modeling this problem with Lyaponuv optimization framework, we propose an OMFR scheme to reduce the regeneration time. The experimental results show that OMFR scheme can reduce cumulative regeneration time by up to 78% compared with traditional delayed repair schemes.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"101 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":"121494810","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}

引用次数: 1

Smartphone-assisted smooth live video broadcast on wearable cameras 智能手机辅助可穿戴摄像头流畅的视频直播

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

Jiwei Li, Zhe Peng, Bin Xiao

{"title":"Smartphone-assisted smooth live video broadcast on wearable cameras","authors":"Jiwei Li, Zhe Peng, Bin Xiao","doi":"10.1109/IWQoS.2016.7590439","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590439","url":null,"abstract":"Wearable cameras require connecting to cellular-capable devices (e.g., smartphones) so as to provide live broadcast services for worldwide users when Wi-Fi is unavailable. However, the constantly changing cellular network conditions may substantially slow down the upload of recorded videos. In this paper, we consider the scenario where wearable cameras upload live videos to remote distribution servers under cellular networks, aiming at maximizing the quality of uploaded videos while meeting the delay requirements. To attain the goal, we propose a dynamic video coding approach that utilizes dynamic video recording resolution adjustment on wearable cameras and Lyapunov based video preprocessing on smartphones. Our proposed resolution adjustment algorithm adapts to network condition changes, and reduces the overheads of video preprocessing. Due to the property of Lyapunov optimization framework, our proposed video preprocessing algorithm delivers near-optimal video quality while meeting the upload delay requirements. Our evaluation results show that our approach achieves up to 50% reduction in power consumption on smartphones and up to 60% reduction in average delay, at the cost of slightly compromised video quality.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"74 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":"127380773","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}

引用次数: 5

Reliability in future radio access networks: From linguistic to quantitative definitions 未来无线接入网络的可靠性:从语言到定量定义

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

V. Suryaprakash, Ilaria Malanchini

{"title":"Reliability in future radio access networks: From linguistic to quantitative definitions","authors":"V. Suryaprakash, Ilaria Malanchini","doi":"10.1109/IWQoS.2016.7590410","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590410","url":null,"abstract":"For the first time since the advent of mobile networks, the idea of advancing their pervasiveness by co-opting them into most aspects of daily life has taken hold and this idea is, henceforth, intended to be a mainstay of future networks (5G and beyond). As a result, a term one frequently encounters in the latest literature pertinent to radio access networks is reliability. It is, however, fairly evident that it is mostly used in a colloquial linguistic sense or that, in some cases, it is used synonymously with availability. This work is, to the best of our knowledge, the first to provide a quantitative definition of reliability which stems from its characterization in the dictionary and is based on quantifiable definitions of resilience, availability, and other parameters important to radio access networks. The utility of this quantitative definition is demonstrated by developing a reliability-aware scheduler which takes predictions of the channel quality into account. The scheduler developed here is also compared with the classical proportional fair scheduler in use today. This comparison not only succeeds in highlighting the practicality of the definition provided, but it also shows that the anticipatory reliability-aware scheduler is able to provide an improvement of about 35 - 50% in reliability when compared to a proportional fair scheduler which is common in contemporary use.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"38 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":"127508642","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}

引用次数: 7

Tetris: Optimizing cloud resource usage unbalance with elastic VM 俄罗斯方块:通过弹性虚拟机优化云资源使用不平衡

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

Xiao Ling, Yi Yuan, Dan Wang, Jiahai Yang

{"title":"Tetris: Optimizing cloud resource usage unbalance with elastic VM","authors":"Xiao Ling, Yi Yuan, Dan Wang, Jiahai Yang","doi":"10.1109/IWQoS.2016.7590395","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590395","url":null,"abstract":"Recently, the cloud systems face an increasing number of big data applications. It becomes an important issue for the cloud providers to allocate resources so as to accommodate as many of these big data applications as possible. In current cloud service, e.g., Amazon EMR, a job runs on a fixed cluster. This means that a fixed amount of resources (e.g. CPU, memory) is allocated to the life cycle of this job. We observe that the resources are inefficiently used in such services because of resources usage unbalance. Therefore, we propose a runtime elastic VM approach where the cloud system can increase or decrease the number of CPUs at different time periods for the jobs. There is little change to such services as Amazon EMR, yet the cloud system can accommodate many more jobs. In this paper, we first present a measurement study to show the feasibility and the quantitative impact of adjusting VM configurations dynamically. We then model the task and job completion time of big data applications, which are used for elastic VM adjustment decisions. We validate our models through experiments. We present Tetris, an elastic VM strategy based on cloud system that can better optimize resource utilization to support big data applications. We further implement a Tetris prototype and comprehensively evaluate Tetris on a real private cloud platform using Facebook trace and Wikipedia dataset. We observe that with Tetris, the cloud system can accommodate 31.3% more jobs.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"50 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":"126789310","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}

引用次数: 3

FTDC: A fault-tolerant server-centric data center network FTDC:以服务器为中心的容错数据中心网络

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

Ye Yu, Chen Qian

引用次数: 1

Using recurrent neural networks toward black-box system anomaly prediction 应用递归神经网络进行黑箱系统异常预测

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

Shaohan Huang, Carol J. Fung, Kui Wang, Polo Pei, Zhongzhi Luan, D. Qian

引用次数: 15

LCC-Graph: A high-performance graph-processing framework with low communication costs LCC-Graph:一个具有低通信成本的高性能图形处理框架

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

Yongli Cheng, F. Wang, Hong Jiang, Yu Hua, D. Feng, XiuNeng Wang

{"title":"LCC-Graph: A high-performance graph-processing framework with low communication costs","authors":"Yongli Cheng, F. Wang, Hong Jiang, Yu Hua, D. Feng, XiuNeng Wang","doi":"10.1109/IWQoS.2016.7590434","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590434","url":null,"abstract":"With the rapid growth of data, communication overhead has become an important concern in applications of data centers and cloud computing. However, existing distributed graph-processing frameworks routinely suffer from high communication costs, leading to very long waiting times experienced by users for the graph-computing results. In order to address this problem, we propose a new computation model with low communication costs, called LCC-BSP. We use this model to design and implement a high-performance distributed graph-processing framework called LCC-Graph. This framework eliminates the high communication costs in existing distributed graph-processing frameworks. Moreover, LCC-Graph also minimizes the computation workload of each vertex, significantly reducing the computation time for each superstep. Evaluation of LCC-Graph on a 32-node cluster, driven by real-world graph datasets, shows that it significantly outperforms existing distributed graph-processing frameworks in terms of runtime, particularly when the system is supported by a high-bandwidth network. For example, LCC-Graph achieves an order of magnitude performance improvement over GPS and GraphLab.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"1 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":"133003116","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}

引用次数: 7

Multi-Resource Partial-Ordered Task Scheduling in cloud computing 云计算中的多资源部分有序任务调度

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

Chaokun Zhang, Yong Cui, Rong Zheng, E. Jinlong, Jianping Wu

{"title":"Multi-Resource Partial-Ordered Task Scheduling in cloud computing","authors":"Chaokun Zhang, Yong Cui, Rong Zheng, E. Jinlong, Jianping Wu","doi":"10.1109/IWQoS.2016.7590423","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590423","url":null,"abstract":"In this paper, we investigate the scheduling problem with multi-resource allocation in cloud computing environments. In contrast to existing work that focuses on flow-level scheduling, which treats flows in isolation, we consider dependency among subtasks of applications that imposes a partial order relationship in execution. We formulate the problem of Multi-Resource Partial-Ordered Task Scheduling (MR-POTS) to minimize the makespan. In the first stage, the proposed Dominant Resource Priority (DRP) algorithm decides the collection of subtasks for resource allocation by taking into account the partial order relationship and characteristics of subtasks. In the second stage, the proposed Maximum Utilization Allocation (MUA) algorithm partitions multiple resources among selected subtasks with the objective to maximize the overall utilization. Both theoretical analysis and experimental evaluation demonstrate the proposed algorithms can approximately achieve the minimal makespan with high resource utilization. Specifically, a reduction of 50% in makespan can be achieved compared with existing scheduling schemes.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"59 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":"125865230","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}

引用次数: 9

FDALB: Flow distribution aware load balancing for datacenter networks FDALB:数据中心网络的流量分布感知负载均衡

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

Shuo Wang, Jiao Zhang, Tao Huang, Tian Pan, Jiang Liu, Yun-jie Liu

引用次数: 9