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

QuickPoint: Efficiently identifying densest sub-graphs in Online Social Networks for event stream dissemination QuickPoint:有效识别在线社交网络中用于事件流传播的最密集子图

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

Changfu Lin, Hanhua Chen, Hai Jin, Jiangchuan Liu

{"title":"QuickPoint: Efficiently identifying densest sub-graphs in Online Social Networks for event stream dissemination","authors":"Changfu Lin, Hanhua Chen, Hai Jin, Jiangchuan Liu","doi":"10.1109/IWQoS.2016.7590448","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590448","url":null,"abstract":"Efficient event stream dissemination is a challenging problem in large-scale Online Social Network (OSN) systems due to the costly inter-server communications caused by the per-user view data storage. To solve the problem, previous schemes mainly explore the structure of the social graphs to reduce the inter-server traffics. Based on the observation of high cluster coefficient in OSNs, a state-of-the-art social piggyback scheme proves to be effective in saving redundant messages by exploiting an intrinsic hub structure in an OSN graph. Essentially, finding the best hub structure for piggybacking is equivalent to finding a variation of the densest sub-graph. The existing scheme computes the densest sub-graph by iteratively removing the node with the minimum weighted degree. Such a scheme incurs a worst computation cost of O(n2), making it not scalable to large-scale OSN graphs. Using alternative hub structures instead of the densest sub-graph can speed up the piggybacking assignment. They however greatly sacrifice the communication efficiency of the assignment schedule. Different from the existing designs, in this work, we propose the QuickPoint algorithm, which achieves the removal of a fraction of nodes in each iteration in finding the densest sub-graph. We mathematically prove that QuickPoint converges in O(logan)(a > 1) iterations in finding the densest sub-graph for efficient piggyback. We implement QuickPoint in parallel using Pregel, a vertex-centric distributed graph processing platform. Comprehensive experiments using large-scale data from Twitter and Flickr show that our scheme achieves a 38.8× improvement in efficiency compared to the existing schemes.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"39 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":"116611129","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}

引用次数: 10

Enhancing participant selection through caching in mobile crowd sensing 通过移动人群感知中的缓存增强参与者选择

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

Hanshang Li, Ting Li, Fan Li, Weichao Wang, Yu Wang

引用次数: 23

HetSDN: Exploiting SDN for intelligent network usage in heterogeneous wireless networks HetSDN:利用SDN在异构无线网络中实现智能网络的使用

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

Kang-Peng Chen, Ryan Izard, Hongxin Hu, Kuang-Ching Wang, James J. Martin, Juan Deng

{"title":"HetSDN: Exploiting SDN for intelligent network usage in heterogeneous wireless networks","authors":"Kang-Peng Chen, Ryan Izard, Hongxin Hu, Kuang-Ching Wang, James J. Martin, Juan Deng","doi":"10.1109/IWQoS.2016.7590422","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590422","url":null,"abstract":"Mobile devices nowadays can find multiple wireless networks, such as WiFi, 4G/LTE and relay through devices. These networks have different characteristics in terms of coverage, data rate, and price. Meanwhile, mobile applications (and even different TCP/UDP connections) often have diverse and time-variant network needs. Thus, to better use all wireless network resources, it would be ideal to enable a TCP/UDP connection to 1) select the most appropriate network dynamically and 2) migrate between networks transparently. However, existing methods fail to provide both functions in a systematic and efficient way at the TCP/UDP connection level. In this paper, we adopt Software-Defined Networking (SDN) to realize such a feature. We use the features of SDN to realize intelligent network selection that is adaptive to time-variant application needs, network availability, and scheduling commands. To support transparent migration, an intelligent home agent (HA) is designed with the SDN to anchor packets from the mobile device. It can intelligently determine which wireless network a TCP/UDP connection is running over. Finally, our implementation demonstrates the effectiveness and efficiency of the proposed system.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"2 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":"128680902","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}

引用次数: 4

IP lookup using Minimal Perfect Hashing 使用最小完美哈希的IP查找

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

Yuanyuan Zhang, Mingwei Xu, Penghan Chen, Ning Wang

引用次数: 0

DVMP: Incremental traffic-aware VM placement on heterogeneous servers in data centers DVMP:在数据中心的异构服务器上增加流量感知虚拟机位置

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

Dan Li, S. S. A. Rizvi, Fangxin Wang, Wu He

{"title":"DVMP: Incremental traffic-aware VM placement on heterogeneous servers in data centers","authors":"Dan Li, S. S. A. Rizvi, Fangxin Wang, Wu He","doi":"10.1109/IWQoS.2016.7590390","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590390","url":null,"abstract":"As the tremendous momentum cloud computing has grown, the modern data center networks are facing challenge to handle the increasing traffic demand among virtual machines (VMs). Simply adding more switches and links may increase network capacity but at the same time increase the complexity and infrastructure cost. Thus, intelligent VM placement has been proposed to reduce the intra-DC traffic. Prior solutions model the traffic-aware VM placement problem as a Balanced Minimum K-cut Problem (BMKP). However, the assumptions of “once-for-all” VM placement on physical servers with equal VM slots are often not realistic in practical data centers, and thus the naive BMKP model may lead to suboptimal placement solutions. In this work, we revisit the problem by considering the server heterogeneity and propose an incremental traffic-aware VM placement algorithm. Given that the BMKP model cannot be directly applied, we make a number of transformations to re-establish the model. First, by introducing pseudo VM slots on physical servers with less VM slots, we allow the number of available VM slots of each server to be different. Second, pseudo edges with infinite costs are added between existing VMs, and thus previously deployed VMs on the same physical server will still be packed together. Third, a change on the number of pseudo VM slots is applied, so that existing VMs placed on different physical servers will still be separated. In this way, we reduce the problem to a new BMKP problem, which results in a much better solution. The evaluation results show that DVMP can reduce up to 28%, 39% and 55% traffic compared with naive BMKP model, greedy VM placement and random VM placement, respectively.","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":"114922921","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}

引用次数: 2

Self-described buffer: A novel mechanism to improve packet I/O efficiency in Linux 自描述缓冲区:Linux中提高数据包I/O效率的一种新机制

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

Jinli Yan, Lu Tang, Zhigang Sun, Tao Li, Donglai Xu

{"title":"Self-described buffer: A novel mechanism to improve packet I/O efficiency in Linux","authors":"Jinli Yan, Lu Tang, Zhigang Sun, Tao Li, Donglai Xu","doi":"10.1109/IWQoS.2016.7590426","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590426","url":null,"abstract":"Socket buffer (SKB) is the standard data structure for exchanging packets and their control information between NIC driver and protocol stack. The overhead of dynamic SKB management has been considered as the significant bottleneck in packet I/O. Some novel non-SKB mechanisms, such as DPDK, were thus proposed to solve the problem. However, these mechanisms usually cannot be widely adopted in the data path of most packet forwarding applications, due to their incompatibility with SKB. In this paper, a new SKB-compatible mechanism, namely Self-described buffer (SDB), is proposed to improve the efficiency of packet I/O. SDB eliminates SKB allocation/deallocation overhead by offloading SKB management into NIC hardware. It also reduces the overhead of dynamic binding/unbinding operations existed in SKB management by statically binding related information in advance using the free space of Databuf. To evaluate the proposed approach, a SDB-enabled NIC and its driver has been designed and implemented based on FPGA. Experimental results show that the proposed SDB achieves 2× throughput compared with a traditional SKB mechanism in raw packet forwarding, and 34.75% improvement for typical network forwarding applications (e.g. IP forwarding, Bridge forwarding and SDN forwarding) on average.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"40 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":"133977760","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

Multicast routing with uncertain sources in software-defined network 软件定义网络中具有不确定源的组播路由

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

Zhiyao Hu, Deke Guo, Junjie Xie, Bangbang Ren

{"title":"Multicast routing with uncertain sources in software-defined network","authors":"Zhiyao Hu, Deke Guo, Junjie Xie, Bangbang Ren","doi":"10.1109/IWQoS.2016.7590417","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590417","url":null,"abstract":"Multicast is designed to jointly deliver content from a single source to a set of destinations. It can efficiently save the bandwidth consumption and reduce the load on the source. The appearance of SDN provides opportunities to deploy flexible protocols, including multicast and its variants. However, in many important applications, it is not necessary that the source of a multicast transfer has to be in specific location as long as certain constraints are satisfied. Such facts bring a novel multicast with uncertain sources, abbreviated as uncertain multicast. It brings new opportunities and challenges to reduce the bandwidth consumption. In this paper, we focus on the uncertain multicast and construct a forest with the minimum cost (MCF), to enable that each destination reaches to one and only one source. Prior approaches, relying on traditional multicast, remain inapplicable to the MCF problem. Therefore, we propose two (2+ε)-approximation methods, named P-MCF and E-MCF, which can be deployed in SDN controllers. We conduct experiments on our SDN testbed together with large-scale simulations under the random SDN network. All manifest that our MCF approach always occupies less network links and incurs less network cost for an uncertain multicast than the traditional Steiner minimum tree (SMT) of any related multicast, irrespective of the used network topology and the setting of multicast transmissions.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"86 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":"132973923","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

Dynamic flow scheduling for Power-efficient Data Center Networks 高能效数据中心网络的动态流调度

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

Zehua Guo, Shufeng Hui, Yang Xu, H. J. Chao

{"title":"Dynamic flow scheduling for Power-efficient Data Center Networks","authors":"Zehua Guo, Shufeng Hui, Yang Xu, H. J. Chao","doi":"10.1109/IWQoS.2016.7590399","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590399","url":null,"abstract":"Power-efficient Data Center Networks (DCNs) have been proposed to save power of DCNs using OpenFlow. In these DCNs, the OpenFlow controller adaptively turns on and off links and OpenFlow switches to form a minimum-power subnet that satisfies traffic demand. As the subnet changes, flows are scheduled dynamically to routes composed of active switches and links. However, existing flow scheduling schemes could cause undesired results: (1) power inefficiency: due to unbalanced traffic allocation on active routes, extra switches and links may be activated to cater to bursty traffic surges on congested routes, and (2) Quality of Service (QoS) fluctuation: because of the limited flow entry processing ability, switches cannot timely install/delete/update flow entries to properly schedule flows. In this paper, we propose AggreFlow, a dynamic flow scheduling scheme that achieves power efficiency in DCNs and improved QoS using two techniques: Flow-set Routing and Lazy Rerouting. Flow-set Routing achieves load balancing and reduces the number of entry installment on switches by routing flows in a coarse-grained flow-set fashion. Lazy Rerouting maintains load balancing and spreads rerouting operations over a relatively long period of time, reducing the burstiness of entry installment/deletion/update on switches. We built a NS3 based fat-tree network simulation platform to evaluate AggreFlow's performance. The simulation results show AggreFlow reduces power consumption by about 18%, achieves load balancing and improved QoS (i.e., low packet loss rate and reducing the number of processing entries for flow scheduling by 98%), compared with baseline schemes.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"10 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":"134526992","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}

引用次数: 43

On the performance of cloud storage applications with global measurement 基于全局测量的云存储应用性能研究

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

Guangyuan Wu, Fangming Liu, Haowen Tang, Keke Huang, Qixia Zhang, Zhenhua Li, Ben Y. Zhao, Hai Jin

{"title":"On the performance of cloud storage applications with global measurement","authors":"Guangyuan Wu, Fangming Liu, Haowen Tang, Keke Huang, Qixia Zhang, Zhenhua Li, Ben Y. Zhao, Hai Jin","doi":"10.1109/IWQoS.2016.7590449","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590449","url":null,"abstract":"In recent years, Dropbox, Google, and Microsoft have been competing in the market of consumer cloud storage (CCS) services. While once the key comparative metric, storage capacity per user has outgrown the needs of most users. Today, third-party applications based on CCS's RESTful Web APIs are becoming a primary way for users to utilize their expanded storage resources. Unfortunately, there is very little visibility into the performance of these Web APIs, even though they are primary determinants of the end user experience on these storage applications. In this paper, we report results from a comprehensive measurement study of the Web APIs of five popular CCS providers. Our results reveal significant differences and limitations in API performance, which result in performance bottlenecks visible to the user through the storage application. We analyze the underlying system designs of the five providers' Web APIs, and present the performance implications of their different design choices. Our research provides practical guidance for service providers to optimize their API performance, for developers to improve the experience of third-party applications, and for users to pick appropriate services that best match their requirements.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"s1-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":"127192469","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}

引用次数: 13

A decision-tree-based on-line flow table compressing method in Software Defined Networks 软件定义网络中基于决策树的在线流表压缩方法

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

Bing Leng, Liusheng Huang, C. Qiao, Hongli Xu

引用次数: 8