Pub Date : 2018-06-01DOI: 10.1109/iwqos.2018.8624133
IEEE/ACM IWQoS 2018
IEEE/ACM IWQoS 2018
{"title":"IEEE/ACM IWQoS 2018","authors":"","doi":"10.1109/iwqos.2018.8624133","DOIUrl":"https://doi.org/10.1109/iwqos.2018.8624133","url":null,"abstract":"IEEE/ACM IWQoS 2018","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131304305","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624172
Xiaohui Wei, Yongfang Wang, Shang Gao, Yao Tang
Satisfying spatial-temporal coverage requirement in the interested regions while considering the quality of the sensing data with budget limitation is a major research challenge in mobile crowdsensing. Most existing research in this field focus on the number of sensor readings collected in each covered subarea and do not consider individual differences of participants for contributing to data quality improvement. In this paper, we propose a novel coverage metric, quality coverage, which considers both the spatial coverage and the quality of sensing data and then use task allocation approaches to achieve highly diverse and spatial quality coverage level within a limited budget for different application scenarios.
{"title":"Data Quality Aware Task Allocation Under a Feasible Budget in Mobile Crowdsensing","authors":"Xiaohui Wei, Yongfang Wang, Shang Gao, Yao Tang","doi":"10.1109/IWQoS.2018.8624172","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624172","url":null,"abstract":"Satisfying spatial-temporal coverage requirement in the interested regions while considering the quality of the sensing data with budget limitation is a major research challenge in mobile crowdsensing. Most existing research in this field focus on the number of sensor readings collected in each covered subarea and do not consider individual differences of participants for contributing to data quality improvement. In this paper, we propose a novel coverage metric, quality coverage, which considers both the spatial coverage and the quality of sensing data and then use task allocation approaches to achieve highly diverse and spatial quality coverage level within a limited budget for different application scenarios.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115759975","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQOS.2018.8624146
O. Daniel, Obermaisser Roman
In safety critical communication systems, faulty nodes can monopolize a channel by transmitting untimely messages at random intervals and thus resulting in the failure of the system. This failure is known as a babbling idiot failure. This could be costly and catastrophic for safety critical systems, therefore these failures are avoided in time triggered communication systems by implementing fault tolerant functions such as local or central guardians. Research works evaluating the guardian functionality for real time networks such as Flexray and TTP have been carried out. This work evaluates the guardian functionality of the TTEthernet protocol. TTEthernet enforces a TDMA scheme for time triggered traffic and traffic policing for rate constrained traffic thereby protecting the network against babbling idiot failures. However these guardian functionality was not extensively evaluated. Dependability evaluation by fault injection on the entire TTEthernet communication system as a whole has not been extensively studied. In this paper we exploit a novel fault injection framework to generate babbling idiot failures for the purpose of verifying TTEthernet implementations with respect to fault containment. The framework adopts a novel cut-through approach abstracting the fault injector from both the end systems and switches, thereby facilitating portability and ease of use. This work introduces a fault injection framework to effectively verify babbling idiot fault tolerance of TTEthernet hardware implementations. In addition, it provides a means to evaluate the effect of various network faults on applications running on top the protocol. Test results carried out indicate the effect of babbling idiot messages on the latency and jitter of traffic over the TTEthernet network.
{"title":"Fault Injection Framework for Assessing Fault Containment of TTEthernet Against Babbling Idiot Failures","authors":"O. Daniel, Obermaisser Roman","doi":"10.1109/IWQOS.2018.8624146","DOIUrl":"https://doi.org/10.1109/IWQOS.2018.8624146","url":null,"abstract":"In safety critical communication systems, faulty nodes can monopolize a channel by transmitting untimely messages at random intervals and thus resulting in the failure of the system. This failure is known as a babbling idiot failure. This could be costly and catastrophic for safety critical systems, therefore these failures are avoided in time triggered communication systems by implementing fault tolerant functions such as local or central guardians. Research works evaluating the guardian functionality for real time networks such as Flexray and TTP have been carried out. This work evaluates the guardian functionality of the TTEthernet protocol. TTEthernet enforces a TDMA scheme for time triggered traffic and traffic policing for rate constrained traffic thereby protecting the network against babbling idiot failures. However these guardian functionality was not extensively evaluated. Dependability evaluation by fault injection on the entire TTEthernet communication system as a whole has not been extensively studied. In this paper we exploit a novel fault injection framework to generate babbling idiot failures for the purpose of verifying TTEthernet implementations with respect to fault containment. The framework adopts a novel cut-through approach abstracting the fault injector from both the end systems and switches, thereby facilitating portability and ease of use. This work introduces a fault injection framework to effectively verify babbling idiot fault tolerance of TTEthernet hardware implementations. In addition, it provides a means to evaluate the effect of various network faults on applications running on top the protocol. Test results carried out indicate the effect of babbling idiot messages on the latency and jitter of traffic over the TTEthernet network.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123425931","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624159
Jun Duan, Yuanyuan Yang
Traffic locality is ubiquitously exploited in today's data centers. It allows network resources to be used more efficiently because traffic in data centers is adapted to the underlying network infrastructures. In this paper, we approach this problem from another direction, which is to adapt network infrastructure to the traffic. Towards this direction, we adopt two approaches to boost the efficiency of network resource utilization. First, we improve the topology of Clos-type data center networks by introducing horizontal connections, which facilitates the routing of local traffic. Second, based on the improved topology, we make the network infrastructure to be versatile, in the sense that it can be fitted into the characteristics of the traffic. We name this design as Versatile Clos-type Networks (VCN). We describe the topological architecture of the VCN, design its addressing and routing schemes, and demonstrate its various properties. We also evaluate its performance and compare it with fat-tree, a representative Clos-type data center network architecture. The evaluation results show that the VCN can deliver the same throughput as fat-tree, but use significantly reduced network resources.
{"title":"VCN: Versatile Clos-Type Networks for Traffic Locality in Data Centers","authors":"Jun Duan, Yuanyuan Yang","doi":"10.1109/IWQoS.2018.8624159","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624159","url":null,"abstract":"Traffic locality is ubiquitously exploited in today's data centers. It allows network resources to be used more efficiently because traffic in data centers is adapted to the underlying network infrastructures. In this paper, we approach this problem from another direction, which is to adapt network infrastructure to the traffic. Towards this direction, we adopt two approaches to boost the efficiency of network resource utilization. First, we improve the topology of Clos-type data center networks by introducing horizontal connections, which facilitates the routing of local traffic. Second, based on the improved topology, we make the network infrastructure to be versatile, in the sense that it can be fitted into the characteristics of the traffic. We name this design as Versatile Clos-type Networks (VCN). We describe the topological architecture of the VCN, design its addressing and routing schemes, and demonstrate its various properties. We also evaluate its performance and compare it with fat-tree, a representative Clos-type data center network architecture. The evaluation results show that the VCN can deliver the same throughput as fat-tree, but use significantly reduced network resources.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836230","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}
Pub Date : 2018-06-01DOI: 10.1109/iwqos.2018.8624181
Sponsored by IEEE
IEEE赞助
{"title":"Sponsored by IEEE","authors":"","doi":"10.1109/iwqos.2018.8624181","DOIUrl":"https://doi.org/10.1109/iwqos.2018.8624181","url":null,"abstract":"Sponsored by IEEE","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238907","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}
Pub Date : 2018-06-01DOI: 10.1109/iwqos.2018.8624155
Copyright and Reprint Permission: Abstracting is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law for private use of patrons those articles in this volume that carry a code at the bottom of the first page, provided the per-copy fee indicated in the code is paid through Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923.
版权和转载许可:允许文摘并注明出处。在美国版权法的限制之外，图书馆允许影印本卷中第一页底部带有代码的文章，供用户私人使用，前提是代码中显示的每本费用由版权清算中心支付，地址:222 Rosewood Drive, Danvers, MA 01923。
{"title":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","authors":"","doi":"10.1109/iwqos.2018.8624155","DOIUrl":"https://doi.org/10.1109/iwqos.2018.8624155","url":null,"abstract":"Copyright and Reprint Permission: Abstracting is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law for private use of patrons those articles in this volume that carry a code at the bottom of the first page, provided the per-copy fee indicated in the code is paid through Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128367330","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624139
Xi Chen, Zhenhua Li, Zhenyu Li, Tianyin Xu, Ennan Zhai, Yao Liu, M. Zhao, Yunhao Liu
This paper reveals the performance anomaly (i.e., the decline of delivery speed) when the client upgrades a task from single-source content delivery to multi-source content delivery. This anomaly is mainly caused by two aspects: (1) data sources with different types vary greatly in terms of acceleration reward (AR), and data sources with certain types are particularly easy to become inferior; (2) When the data sources remain fixed for a period of time, the large diversity of participant time (DPT) of data sources disturb the acceleration and the data sources with less participant time are inferior. Combing these insights, we figure out that the multi-source content delivery is limited by the so-called cask effect, i.e., the acceleration effect mainly depends on the inferior data sources.
{"title":"Minimizing the Cask Effect of Multi-Source Content Delivery","authors":"Xi Chen, Zhenhua Li, Zhenyu Li, Tianyin Xu, Ennan Zhai, Yao Liu, M. Zhao, Yunhao Liu","doi":"10.1109/IWQoS.2018.8624139","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624139","url":null,"abstract":"This paper reveals the performance anomaly (i.e., the decline of delivery speed) when the client upgrades a task from single-source content delivery to multi-source content delivery. This anomaly is mainly caused by two aspects: (1) data sources with different types vary greatly in terms of acceleration reward (AR), and data sources with certain types are particularly easy to become inferior; (2) When the data sources remain fixed for a period of time, the large diversity of participant time (DPT) of data sources disturb the acceleration and the data sources with less participant time are inferior. Combing these insights, we figure out that the multi-source content delivery is limited by the so-called cask effect, i.e., the acceleration effect mainly depends on the inferior data sources.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127335657","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624126
Tong Zhang, Fengyuan Ren, Ran Shu, Bo Wang
In recent years, the coflow abstraction has received significant attentions, for its prominent ability to capture application semantics. On this basis, multiple coflow scheduling mechanisms have been proposed to minimize the coflow completion time (CCT). Currently, existing coflow scheduling mechanisms mainly belong to two categories: information-omniscient and information-agnostic. However, in data center applications, there are still quite a few cases in between where incomplete coflow information is known, and such incomplete information makes great contributions to improving the CCT performance. To address such cases, we propose IICS, a coflow scheduling algorithm based on incomplete coflow information. IICS leverages information of a coflow's arrived parts to deduce the coflow's remaining transmission time, and uses it to approximate the Minimum Remaining Time First (MRTF) heuristic. Besides, IICS allocates bandwidth by monopolization and in a maximal manner, which achieves high bandwidth utilization. Extensive simulations under realistic settings show that IICS achieves the average CCT comparable to that of the information-omniscient algorithm and the 99th percentile CCT much smaller than both information-omniscient and information-agnostic algorithms. Furthermore, IICS holds observably higher throughput and is robust to algorithm parameters.
{"title":"Scheduling Coflows with Incomplete Information","authors":"Tong Zhang, Fengyuan Ren, Ran Shu, Bo Wang","doi":"10.1109/IWQoS.2018.8624126","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624126","url":null,"abstract":"In recent years, the coflow abstraction has received significant attentions, for its prominent ability to capture application semantics. On this basis, multiple coflow scheduling mechanisms have been proposed to minimize the coflow completion time (CCT). Currently, existing coflow scheduling mechanisms mainly belong to two categories: information-omniscient and information-agnostic. However, in data center applications, there are still quite a few cases in between where incomplete coflow information is known, and such incomplete information makes great contributions to improving the CCT performance. To address such cases, we propose IICS, a coflow scheduling algorithm based on incomplete coflow information. IICS leverages information of a coflow's arrived parts to deduce the coflow's remaining transmission time, and uses it to approximate the Minimum Remaining Time First (MRTF) heuristic. Besides, IICS allocates bandwidth by monopolization and in a maximal manner, which achieves high bandwidth utilization. Extensive simulations under realistic settings show that IICS achieves the average CCT comparable to that of the information-omniscient algorithm and the 99th percentile CCT much smaller than both information-omniscient and information-agnostic algorithms. Furthermore, IICS holds observably higher throughput and is robust to algorithm parameters.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121543681","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624153
Yuchi Chen, Wei Gong, Jiangchuan Liu, Fangxin Wang, Haitian Pang
Many efforts have been made on sensing ultrasound with commercial-off-the-shelf (COTS) mobile devices in the recent literature. Yet due to the limited sound sample rate, current COTS mobile devices can not directly capture any sound at the frequency over 24 kHz. This issue prevents true ultrasound, of which the frequency is typically over 40 kHz, from benefiting the existing sound sensing applications. In this work, we show that by subtly customizing the sampling process, we can make COTS mobile devices hear the true ultrasound that is typically beyond their capability to fully capture. Particularly, we present a system that enable COTS mobile devices to sense the power spectrum density (PSD) of true ultrasounds, of which the frequency can be as high as 60 kHz.
{"title":"Sensing Power Spectrum Density of True Ultrasounds on Mobile Devices","authors":"Yuchi Chen, Wei Gong, Jiangchuan Liu, Fangxin Wang, Haitian Pang","doi":"10.1109/IWQoS.2018.8624153","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624153","url":null,"abstract":"Many efforts have been made on sensing ultrasound with commercial-off-the-shelf (COTS) mobile devices in the recent literature. Yet due to the limited sound sample rate, current COTS mobile devices can not directly capture any sound at the frequency over 24 kHz. This issue prevents true ultrasound, of which the frequency is typically over 40 kHz, from benefiting the existing sound sensing applications. In this work, we show that by subtly customizing the sampling process, we can make COTS mobile devices hear the true ultrasound that is typically beyond their capability to fully capture. Particularly, we present a system that enable COTS mobile devices to sense the power spectrum density (PSD) of true ultrasounds, of which the frequency can be as high as 60 kHz.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126483864","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}
Pub Date : 2018-06-01DOI: 10.1109/IWQoS.2018.8624183
Zijun Zhang
Adaptive optimization algorithms, such as Adam and RMSprop, have witnessed better optimization performance than stochastic gradient descent (SGD) in some scenarios. However, recent studies show that they often lead to worse generalization performance than SGD, especially for training deep neural networks (DNNs). In this work, we identify the reasons that Adam generalizes worse than SGD, and develop a variant of Adam to eliminate the generalization gap. The proposed method, normalized direction-preserving Adam (ND-Adam), enables more precise control of the direction and step size for updating weight vectors, leading to significantly improved generalization performance. Following a similar rationale, we further improve the generalization performance in classification tasks by regularizing the softmax logits. By bridging the gap between SGD and Adam, we also hope to shed light on why certain optimization algorithms generalize better than others.
{"title":"Improved Adam Optimizer for Deep Neural Networks","authors":"Zijun Zhang","doi":"10.1109/IWQoS.2018.8624183","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624183","url":null,"abstract":"Adaptive optimization algorithms, such as Adam and RMSprop, have witnessed better optimization performance than stochastic gradient descent (SGD) in some scenarios. However, recent studies show that they often lead to worse generalization performance than SGD, especially for training deep neural networks (DNNs). In this work, we identify the reasons that Adam generalizes worse than SGD, and develop a variant of Adam to eliminate the generalization gap. The proposed method, normalized direction-preserving Adam (ND-Adam), enables more precise control of the direction and step size for updating weight vectors, leading to significantly improved generalization performance. Following a similar rationale, we further improve the generalization performance in classification tasks by regularizing the softmax logits. By bridging the gap between SGD and Adam, we also hope to shed light on why certain optimization algorithms generalize better than others.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720800","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：