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

Delay updating in Software-Defined Datacenter networks 软件定义数据中心网络中的延迟更新

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

Ting Qu, Deke Guo, Jia Xu, Zhong Liu

{"title":"Delay updating in Software-Defined Datacenter networks","authors":"Ting Qu, Deke Guo, Jia Xu, Zhong Liu","doi":"10.1109/IWQoS.2017.7969122","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969122","url":null,"abstract":"Software-Define Datacenter networks (SDDCs) are constantly changing due to various network update events. A set of involved flows of each update event should be migrated to the feasible paths without congestion. To tackle a single update event, prior methods find and execute a migration sequence so as to transform the initial traffic distribution to the final traffic distribution. However, when handling a queue of multiple update events, the head-of-line blocking problem always appears and considerably lower the efficiency of network update. To tackle this problem, we employ the idea of delay updating which schedules other queued events instead of the blocked head-event, aiming to break the blocking state and provide updating opportunities for other events. We formulate this problem as an optimization problem and propose partial delay updating (PDU) strategy. PDU tackles the queued update events based on their arrival order to preserve the fairness. Moreover, it prefers to just delay those blocked flows, lacking enough bandwidth resources, instead of all flows in the head-event. The evaluation results show that our delay updating strategy achieves 60%–80% reduction in average completion time of update events, compared to FIFO scheduling strategy, in four types of flow size.","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-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293451","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

Towards a Fog-to-Cloud control topology for QoS-aware end-to-end communication 面向面向qos感知的端到端通信的雾到云控制拓扑

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

Vitor Barbosa C. Souza, Alejandro Gómez-Cárdenas, X. Masip-Bruin, E. Marín-Tordera, Jordi García

{"title":"Towards a Fog-to-Cloud control topology for QoS-aware end-to-end communication","authors":"Vitor Barbosa C. Souza, Alejandro Gómez-Cárdenas, X. Masip-Bruin, E. Marín-Tordera, Jordi García","doi":"10.1109/IWQoS.2017.7969140","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969140","url":null,"abstract":"The recent deployment of novel network concepts, such as M2M communication or IoT, has undoubtedly stimulated the placement of a new set of services, leveraging both centralized resources in Cloud Data Centers and distributed resources shared by devices at the edge of the network. Moreover, Fog Computing has been recently proposed having as one of its main assets the reduction of service response time, further enabling the deployment of real-time services. Albeit QoS-aware network researches have been originally focused on data plane issues, the successful deployment of real-time services, demanding very low delay on the allocation of distributed resources, depends on the assessment of the impact of controlling decisions on QoS. Recently, Fog-to-Cloud (F2C) computing has been proposed as a hierarchical layered-architecture relying on a coordinated and distributed management of both Fog and Cloud resources, enabling the distributed and parallel allocation of resources at distinct layers, thus suitably mapping services demands into resources availability. In this paper, we assess the layered management architecture in F2C systems, taking into account its distributed nature. Preliminary results show the tradeoff observed regarding controllers capacity, number of controllers, and number of controller layers in the F2C architecture.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133787517","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}

引用次数: 14

You can hide, but your periodic schedule can't 你可以隐藏，但你的周期计划不能

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

Minghua Ma, Kai Zhao, Kaixin Sui, Lei Xu, Yong Li, Dan Pei

引用次数: 1

A secure cloud storage system based on discrete logarithm problem 基于离散对数问题的安全云存储系统

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

Jian Zhang, Yang Yang, Yanjiao Chen, Fei Chen

{"title":"A secure cloud storage system based on discrete logarithm problem","authors":"Jian Zhang, Yang Yang, Yanjiao Chen, Fei Chen","doi":"10.1109/IWQoS.2017.7969107","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969107","url":null,"abstract":"With the development of cloud storage, data owners no longer physically possess their data and thus how to ensure the integrity of their outsourced data becomes a challenging task. Several protocols have been proposed to audit cloud storage, all of which rely mainly on data block tags to check data integrity. However, their block tag constructions employ cryptographic operations, which makes them computationally complex. In this paper, we investigate a secure cloud storage protocol based on the classic discrete logarithm problem. Our protocol generates data block tags with only basic algebraic operations, which brings substantial computation savings compared with previous work. We also strictly prove that the proposed protocol is secure under a definition which captures the real-world uses of cloud storage. In order to fit more application scenarios, we extend the proposed protocol to support data dynamics by employing an index vector and third-party public auditing by using a random masking number, both of which are efficient and provably secure. At last, theoretical analysis and experimental evaluation are provided to validate the superiority of the proposed protocol.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432045","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

Rethinking transfer optimization in a datacenter: Integrating load balancing with multipath flow control 重新思考数据中心的传输优化:将负载均衡与多路径流控制相结合

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

Zhuzhong Qian, K. Wen, S. Zhang, Xiaoliang Wang, Sanglu Lu

{"title":"Rethinking transfer optimization in a datacenter: Integrating load balancing with multipath flow control","authors":"Zhuzhong Qian, K. Wen, S. Zhang, Xiaoliang Wang, Sanglu Lu","doi":"10.1109/IWQoS.2017.7969132","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969132","url":null,"abstract":"The various flows in production datacenters usually can be classified into two types: bandwidth-hungry and delay-sensitive. To improve their performance, datacenter networks require effective load balancing and flow control protocols, respectively. However, as the two techniques are typically employed separately in current datacenters, they are unable to optimize the network in a coordinated way. In this work, we argue that the adaptive routing, in load balancing sense, and the flow control, in congestion control sense, could be tightly coupled at the transport layer to handle the complex datacenter traffic. We design OmniFlow, a novel transfer protocol which aims to achieve a proper balance between throughput and latency in a datacenter. Firstly, it can simultaneously and precisely measure the queueing latencies on multiple paths between two hosts, which enables it to have more visibility of the path congestion and have better control of the transmission states. Secondly, OmniFlow adaptively integrates the load balancing and flow control modules and shares the same congestion metrics (i.e. queueing latencies) between them. Based on different network conditions, it either dynamically reroutes flows to utilize the bisection bandwidth or proactively adjusts flow rates to bound queueing occupancies. The results of extensive experiments show that OmniFlow can provide both low average and tail latency for small flows without sacrificing the throughput of elephant flows.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116641286","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

Mixing SDN and CCN for content-centric Qos aware smart grid architecture 混合SDN和CCN实现以内容为中心的Qos感知智能电网架构

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

Nour El Houda Ben Youssef, Yosra Barouni, Sofiane Khalfallah, J. Slama, K. Driss

引用次数: 6

Cost-efficient workload scheduling in Cloud Assisted Mobile Edge Computing 云辅助移动边缘计算中经济高效的工作负载调度

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

Xiao Ma, Shan Zhang, Wenzhuo Li, Puheng Zhang, Chuang Lin, Xuemin Shen

{"title":"Cost-efficient workload scheduling in Cloud Assisted Mobile Edge Computing","authors":"Xiao Ma, Shan Zhang, Wenzhuo Li, Puheng Zhang, Chuang Lin, Xuemin Shen","doi":"10.1109/IWQoS.2017.7969148","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969148","url":null,"abstract":"Mobile edge computing is envisioned as a promising computing paradigm with the advantage of low latency. However, compared with conventional mobile cloud computing, mobile edge computing is constrained in computing capacity, especially under the scenario of dense population. In this paper, we propose a Cloud Assisted Mobile Edge computing (CAME) framework, in which cloud resources are leased to enhance the system computing capacity. To balance the tradeoff between system delay and cost, mobile workload scheduling and cloud outsourcing are further devised. Specifically, the system delay is analyzed by modeling the CAME system as a queuing network. In addition, an optimization problem is formulated to minimize the system delay and cost. The problem is proved to be convex, which can be solved by using the Karush-Kuhn-Tucker (KKT) conditions. Instead of directly solving the KKT conditions, which incurs exponential complexity, an algorithm with linear complexity is proposed by exploiting the linear property of constraints. Extensive simulations are conducted to evaluate the proposed algorithm. Compared with the fair ratio algorithm and the greedy algorithm, the proposed algorithm can reduce the system delay by up to 33% and 46%, respectively, at the same outsourcing cost. Furthermore, the simulation results demonstrate that the proposed algorithm can effectively deal with the challenge of heterogeneous mobile users and balance the tradeoff between computation delay and transmission overhead.","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-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130702529","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}

引用次数: 72

When privacy meets economics: Enabling differentially-private battery-supported meter reporting in smart grid 当隐私与经济相结合:在智能电网中启用差异化私有电池支持的电表报告

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

Zijian Zhang, Wenqiang Cao, Zhan Qin, Liehuang Zhu, Zhengtao Yu, K. Ren

{"title":"When privacy meets economics: Enabling differentially-private battery-supported meter reporting in smart grid","authors":"Zijian Zhang, Wenqiang Cao, Zhan Qin, Liehuang Zhu, Zhengtao Yu, K. Ren","doi":"10.1109/IWQoS.2017.7969167","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969167","url":null,"abstract":"Millions of the smart meters, as essential components, are being deployed ubiquitously in the next generation power system. However, the public privacy concerns over the users' power consumption leakage raise, since the smart meters' unintermittent readings contain customers' behavior patterns. To alleviate this problem, the state-of-the-art techniques are common to use a rechargeable battery to hide the actual power consumption. Unfortunately, none of the existing works completely provide a rigorous privacy protection with reasonable cost under real-world battery settings, i.e., achieving the well-known differential privacy guarantee economically using batteries with limited charge/discharge rate and capacity. To attain this goal, this paper proposes a differentially private meter reading report mechanism. The main idea is to first narrow down the domain of the noise distribution parameter, in order to decrease the possibility of violating the battery limits. It also combines a multi-armed bandit algorithm to further reduce the cost as much as possible. In addition, a novel switch mechanism is proposed to prevent the meter from reporting its reading when the battery limitations might be violated. The theoretical analysis provides a formal proof of the privacy guarantee of the proposed scheme. Besides, experimental results show that the privacy protection of the proposed scheme is at least nine times stronger than that of the existing solutions with acceptable extra cost.","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-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114171227","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}

引用次数: 31

Verifiable Ranked Search over dynamic encrypted data in cloud computing 云计算中动态加密数据的可验证排序搜索

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

Qin Liu, X. Nie, Xuhui Liu, Tao Peng, Jie Wu

{"title":"Verifiable Ranked Search over dynamic encrypted data in cloud computing","authors":"Qin Liu, X. Nie, Xuhui Liu, Tao Peng, Jie Wu","doi":"10.1109/IWQoS.2017.7969156","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969156","url":null,"abstract":"Big data has become a hot topic in many areas where the volume and growth rate of data require cloud-based platforms for processing and analysis. Due to open cloud environments with very limited user-side control, existing research suggests encrypting data before outsourcing and adopting Searchable Symmetric Encryption (SSE) to facilitate keyword-based searches on the ciphertexts. However, no prior SSE constructions can simultaneously achieve sublinear search time, efficient update and verification, and on-demand file retrieval, which are all essential to the development of big data. To address this, we propose a Verifiable Ranked Searchable Symmetric Encryption (VRSSE) scheme that allows a user to perform top-K searches on a dynamic file collection while efficiently verifying the correctness of the search results. VRSSE is constructed based on the ranked inverted index, which contains multiple inverted lists that link sets of file nodes relating a specific keyword. For verifiable ranked searches, file nodes are ordered according to their ranks for such a keyword, and information about a node's prior/following neighbor will be encoded with the RSA accumulator. Extensive experiments on real data sets demonstrate the efficiency and effectiveness of our proposed scheme.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872559","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}

引用次数: 18

XpressEth: Concise and efficient converged real-time Ethernet XpressEth:简洁高效的融合实时以太网

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

Kun Qian, Fengyuan Ren, Danfeng Shan, Wenxue Cheng, Bo Wang

{"title":"XpressEth: Concise and efficient converged real-time Ethernet","authors":"Kun Qian, Fengyuan Ren, Danfeng Shan, Wenxue Cheng, Bo Wang","doi":"10.1109/IWQoS.2017.7969129","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969129","url":null,"abstract":"Owing to Ethernet's low cost, high bandwidth and architecture openness, much attention has been paid to develop converged Ethernet to support both time-critical services and conventional communication services on a unified network infrastructure. The greatest challenge here is providing low and deterministic latency for time-critical packets. Recently, the IEEE time sensitive networking task group is launched to address it. However, their framework is complex and unsuitable for commodity switch architecture. In this paper, we propose a concise and efficient converged real-time Ethernet framework called XpressEth, which leverages Dual Preemption mechanism to minimize the delay of time-critical packets, and employs a lightweight Slot Assignment Scheduler to minimize the conflicts among time-critical packets at sources. XpressEth cuts off great burden from both forwarding and scheduling. The simulation results verify that XpressEth can provide ultra-low and deterministic latency for time-critical packets (1.024µ s per hop and zero jitter in 1Gbps network), which is 13× better than time sensitive networking solution, and the side-effect on conventional communication traffic is negligible.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200598","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