2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)最新文献_第7页

Jump-start crowdsensing: A three-layer incentive framework for mobile crowdsensing 启动众筹:移动众筹的三层激励框架

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969168

Yatong Chen, Huangxun Chen, Shuo Yang, Xiaofeng Gao, Fan Wu

{"title":"Jump-start crowdsensing: A three-layer incentive framework for mobile crowdsensing","authors":"Yatong Chen, Huangxun Chen, Shuo Yang, Xiaofeng Gao, Fan Wu","doi":"10.1109/IWQoS.2017.7969168","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969168","url":null,"abstract":"In the past decade, with the rapid development of wireless communication and sensor technology, ubiquitous smartphones equipped with increasingly rich sensors have more powerful computing and sensing abilities. Thus, mobile crowdsensing has received extensive attentions from both industry and academia. Recently, plenty of mobile crowdsensing applications come forth, such as indoor positioning, environment monitoring, transportation, and so on. However, most existing mobile crowdsensing systems lack of vast user bases, and thus urgently need appropriate incentive mechanisms to attract mobile users to guarantee the service quality. In this paper, we propose to incorporate sensing platform and social network applications, which already have large user bases to build a three-layer network model. Thus, we can publicize the sensing platform promptly in large scale, and provide long-term guarantee of data sources. Based on a three-layer network model, we design incentive mechanisms for both intermediaries and the crowdsensing platform, and provide a solution to cope with the problem of user overlapping among intermediaries. We indicate the properties of our proposed incentive mechanisms, including incentive compatibility, individual rationality, and efficiency.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"507 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123422870","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

An efficient kurtosis-based causal discovery method for linear non-Gaussian acyclic data 一种基于峰度的线性非高斯无环数据因果发现方法

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969175

Ruichu Cai, Feng Xie, Wei Chen, Z. Hao

引用次数: 3

A two-way link loss measurement approach for software-defined networks 软件定义网络的双向链路损耗测量方法

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969164

Xinchang Zhang, Yinglong Wang, Jianwei Zhang, Lu Wang, Yanling Zhao

{"title":"A two-way link loss measurement approach for software-defined networks","authors":"Xinchang Zhang, Yinglong Wang, Jianwei Zhang, Lu Wang, Yanling Zhao","doi":"10.1109/IWQoS.2017.7969164","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969164","url":null,"abstract":"Packet loss rate is an important consideration in the Quality of Service (QoS) measurement for a packet-switched network. The software-defined networking (SDN) technique can conveniently monitor flow statistics. However, the packet loss rate of a link or path cannot be directly measured by inquiring the statistics of an ongoing flow at the starting and ending points because it is impossible to accurately compute and control pairwise sampling moments. In this paper, we propose a two-way link-level packet loss measurement solution for software-defined networks. We solve the flow statistics sampling problem mentioned above by inquiring the statistics of a terminated probe flow. We propose a ring-based packet loss probe structure, which contains every measured directed link once and only once. The proposed probe structure effectively avoids the mutual interference between different probe flows, and thereby improves probe accuracy. The ring is implemented based on the flexible flow match capability of SDN. We further study an optimization problem of ring-based packet loss probe structure that strives to minimize the maximum delay of rings. This optimization problem is very complex, and we approximately solve it using a top-down-top graph partition method. A packet loss positioning method, based on flow statistic inquiries and the symmetry design of the probe ring, is also proposed herein.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182501","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

Topology calibration in data centers 数据中心拓扑校准

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969137

Lailong Luo, Deke Guo, Jia Xu, Xueshan Luo

{"title":"Topology calibration in data centers","authors":"Lailong Luo, Deke Guo, Jia Xu, Xueshan Luo","doi":"10.1109/IWQoS.2017.7969137","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969137","url":null,"abstract":"The topology of data centers changes dynamically due to link malpositions, hardware failures or software crushes. However, many topology enabled protocols or applications must know the current topology of data center precisely, which triggers the topology calibration problem. Topology calibration needs to deduce the different nodes and links between two given topologies effectively. Based on the existing method, deriving the different nodes is relatively simple, since they can be uniquely identified by their IP or MAC addresses. On the contrary, picking the different links from the massive links can be costly. Therefore, we envision a method to locate the different links with respect to the following rationales: 1) efficient, the caused storage cost or communication overhead should be low; 2) without priori knowledge, there is no support information, thus the different links should be decoded inversely. However, the existing strategies based on Bloom filter, Hash table, or Search trees fail to achieve the two rationales simultaneously. Thus, we propose graph filter, a space-efficient data structure to represent and deduce the different links in an invertible manner. To this end, the associated encoding, subtracting and decoding algorithms are proposed. The simulations highlight the strength of graph filter reasonably.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127151849","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}

引用次数: 0

Ultra-Fast Bloom Filters using SIMD techniques 使用SIMD技术的超快速布隆过滤器

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969125

Jianyuan Lu, Ying Wan, Yang Li, Chuwen Zhang, Huichen Dai, Yi Wang, Gong Zhang, B. Liu

引用次数: 17

On the measurement of P2P file synchronization: Resilio Sync as a case study 关于P2P文件同步的度量:以Resilio Sync为例研究

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969177

Zhiyuan Peng, Ranga Reddy Pallelra, Haiyang Wang

引用次数: 6

Per-flow counting for big network data stream over sliding windows 对滑动窗口上的大网络数据流进行逐流计数

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969118

You Zhou, Yian Zhou, Shigang Chen, Youlin Zhang

{"title":"Per-flow counting for big network data stream over sliding windows","authors":"You Zhou, Yian Zhou, Shigang Chen, Youlin Zhang","doi":"10.1109/IWQoS.2017.7969118","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969118","url":null,"abstract":"Per-flow counting for big network data streams is a fundamental problem in various network applications such as traffic monitoring, load balancing, capacity planning, etc. Traditional research focused on designing compact data structures to estimate flow sizes from the beginning of the data stream (i.e., landmark window model). However, for many applications, the most recent elements of a stream are more significant than those arrived long time ago, which gives rise to the sliding window model. In this paper, we consider per-flow counting over the sliding window model, and propose two novel solutions, ACE and S-ACE. Instead of allocating a separate data structure for each flow, both solutions utilize the counter sharing idea to reduce memory footprint, so they can be implemented in on-chip SRAMs in modern routers to keep up with the line speed. ACE has to reset the sliding window periodically to give precise estimates, while S-ACE based on a novel segment design can achieve persistently accurate estimates. Our extensive simulations as well as experimental evaluations based on real network traffic trace demonstrate that S-ACE can achieve fast processing speed and high measurement accuracy even with a very tight memory.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123818515","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}

引用次数: 19

Cost-efficient negotiation over multiple resources with reinforcement learning 通过强化学习在多个资源上进行成本高效的协商

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969160

Yu Xu, Jianguo Yao, H. Jacobsen, Haibing Guan

{"title":"Cost-efficient negotiation over multiple resources with reinforcement learning","authors":"Yu Xu, Jianguo Yao, H. Jacobsen, Haibing Guan","doi":"10.1109/IWQoS.2017.7969160","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969160","url":null,"abstract":"Cloud applications can achieve similar performance with diverse multi-resource configurations, allowing cloud service providers to benefit from optimal resource allocation for reducing their operation cost. This paper aims to solve the problem of multi-resource negotiation with considerations of both the service-level agreement (SLA) and the cost efficiency. The performance and resource demand are usually application-dependent, making the optimization problem complicated, especially when the dimension of multi-resource configuration is large. To this end, we use reinforcement learning to solve the optimization problem of multi-resource configuration with simultaneous optimization of the learning efficiency and performance guarantee. The developed prototype named SmartYARN is extended Apache YARN equipped with our learning algorithm which can enable cloud applications to negotiate multiple resources cost-effectively. The extensive evaluations show that SmartYARN performs well in reducing the cost of resource usage while maintaining compliance with the SLA constraints of cloud service simultaneously.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130501867","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}

引用次数: 17

Queueing in the mist: Buffering and scheduling with limited knowledge 雾中的排队:有限知识下的缓冲和调度

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969126

Itamar Cohen, Gabriel Scalosub

{"title":"Queueing in the mist: Buffering and scheduling with limited knowledge","authors":"Itamar Cohen, Gabriel Scalosub","doi":"10.1109/IWQoS.2017.7969126","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969126","url":null,"abstract":"Scheduling and managing queues with bounded buffers are among the most fundamental problems in computer networking. Traditionally, it is often assumed that all the properties of each packet are known immediately upon arrival. However, as traffic becomes increasingly heterogeneous and complex, such assumptions are in many cases invalid. In particular, in various scenarios information about packet characteristics becomes available only after the packet has undergone some initial processing. In this work, we study the problem of managing queues with limited knowledge. We start by showing lower bounds on the competitive ratio of any algorithm in such settings. Next, we use the insight obtained from these bounds to identify several algorithmic concepts appropriate for the problem, and use these guidelines to design a concrete algorithmic framework. We analyze the performance of our proposed algorithm, and further show how it can be implemented in various settings, which differ by the type and nature of the unknown information. We further validate our results and algorithmic approach by a simulation study that provides further insights as to our algorithmic design principles in face of limited knowledge.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203295","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

Generic and agile service function chain verification on cloud 云上通用敏捷的业务功能链验证

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS) Pub Date : 2017-06-01 DOI: 10.1109/IWQoS.2017.7969150

Xiaoli Zhang, Qi Li, Jianping Wu, Jiahai Yang

{"title":"Generic and agile service function chain verification on cloud","authors":"Xiaoli Zhang, Qi Li, Jianping Wu, Jiahai Yang","doi":"10.1109/IWQoS.2017.7969150","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969150","url":null,"abstract":"Network Function Virtualization (NFV) is an emerging technology to enable network functions (NFs) outsourcing on cloud so as to reduce the costs of deploying and maintaining NFs. However, NF outsourcing poses a serious gap between the expected service function chains (SFCs) and the real enforcement because SFC deployment and management on cloud is invisible to NF customers (i.e., enterprises). In this paper, we propose verifiable SFC, i.e., vSFC, the first scheme that allows an enterprise to accurately verify the correct enforcement of SFC in realtime. In particular, different from the-state-of-the-art network function verification schemes, vSFC is generic and agile, which can be deployed on various clouds, while not requiring modifications to any NFs on cloud. vSFC detects a wide range of SFC violations including forwarding path incompliance, flow dropping, and packet injection attacks. To demonstrate the feasibility and performance of vSFC, we implement a vSFC prototype built on top of KVM and conduct experiments with real traces. Our experiment results show that vSFC detects various SFC violations with a negligible overhead.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346395","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}

引用次数: 15