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

High-throughput anycast routing and congestion-free reconfiguration for SDNs sdn的高吞吐量任播路由和无拥塞重构

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

Hongli Xu, Xiangyang Li, Liusheng Huang, Jianxin Wang, Bing Leng

{"title":"High-throughput anycast routing and congestion-free reconfiguration for SDNs","authors":"Hongli Xu, Xiangyang Li, Liusheng Huang, Jianxin Wang, Bing Leng","doi":"10.1109/IWQoS.2016.7590419","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590419","url":null,"abstract":"In this work, we focus on designing high-throughput anycast mechanisms in a software Defined Network (SDN), as anycast routing serves as a fundamental building block for many services. Specifically, we investigate two main challenges for efficient implementation of a SDN-based anycast system: high throughput anycast routing (HTAR) and congestion-free anycast reconfiguration (CFAR). For the first challenge, we design an anycast routing (ARFU) algorithm, based on the fully polynomial time approximation scheme and the single-source unsplittable flow routing method. We prove that ARFU produces a route that can achieve a throughput at least 1/2(1+ξ) of the optimum, where ξ > 0 is an arbitrarily small constant. We then propose an anycast reconfiguration algorithm with transitive configurations, called ARTC, for congestion-free. This algorithm tries to find a routing reconfiguration procedure consisting of at most T ≥ 1 transitive configurations while meeting all the flow demands. When traffic demands can not be satisfied, ARTC maximizes the minimum throughput using one transitive configuration. Our simulations demonstrate high-efficiency of our algorithms.","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":"128771630","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

HybridFlow: A lightweight control plane for hybrid SDN in enterprise networks HybridFlow:用于企业网络混合SDN的轻量级控制平面

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

Siyuan Huang, Jin Zhao, Xin Wang

引用次数: 13

Achieving convergent causal consistency and high availability with asynchronous replication 通过异步复制实现聚合因果一致性和高可用性

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

Yu Tang, Hailong Sun, Xu Wang, Xudong Liu, Zhenglin Xia

引用次数: 2

MSRT: Multi-Source Request and Transmission in Content-Centric Networks 内容中心网络中的多源请求和传输

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

Qing Li, Bin Gan, Guangwu Hu, Yong Jiang, Q. Liao, Mingwei Xu

引用次数: 1

Tube caching: An effective caching scheme in Content-Centric Networking 管缓存:在以内容为中心的网络中有效的缓存方案

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

Hao Wu, B. Liu, Yang Li, Huichen Dai, Weiyi Zhang, Yi Wang

引用次数: 1

A reliability estimation method for reconfigurable routing and switching software 一种可重构路由交换软件可靠性估计方法

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

Dongchao Ma, Shuai Zhang, Aiyun Wang, Li Ma

引用次数: 0

Towards QoE assessment of encrypted YouTube adaptive video streaming in mobile networks 移动网络中加密YouTube自适应视频流的QoE评估

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

Wubin Pan, Gaung Cheng, Hua Wu, Yongning Tang

{"title":"Towards QoE assessment of encrypted YouTube adaptive video streaming in mobile networks","authors":"Wubin Pan, Gaung Cheng, Hua Wu, Yongning Tang","doi":"10.1109/IWQoS.2016.7590437","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590437","url":null,"abstract":"Video streaming has become one of the most prevalent mobile applications, and takes a huge portion of the traffic on mobile networks today. YouTube is one of the most popular and volume-dominant video content providers. Understanding the user perception on the quality (i.e., Quality of Experience or QoE) of YouTube video streaming services is thus paramount for the content provider as well as its content delivery network (CDN) providers. Although various video QoE assessment approaches proposed to use different Key Performance Indicators (KPIs), they are all essentially related to a common parameter: Bitrate. However, after YouTube adopted HTTPS as its adaptive video streaming method to better protect user privacy and network security, bitrate cannot be obtained anymore from encrypted video traffic via typical deep packet inspection (DPI) method. In this paper, we tackle this challenge by proposing a machine learning based bitrate estimation (MBE) approach to parse bitrate information from IP packet level measurement. For evaluating the effectiveness of MBE, we have chosen video Mean Opinion Score (vMOS) proposed by a leading telecom vendor, as the QoE assessment framework, and have conducted comprehensive experiments to study the impact of bitrate estimation accuracy on its KPIs for HTTPS YouTube video streaming service. Experimental results show that MBE is a feasible and highly effective approach to obtain in real time the bitrate information from encrypted video streaming traffic.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"67 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":"133207662","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}

引用次数: 29

Online influence maximization in non-stationary Social Networks 非平稳社交网络中的在线影响力最大化

2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS) Pub Date : 2016-04-26 DOI: 10.1109/IWQoS.2016.7590438

Yixin Bao, Xiaoke Wang, Zhi Wang, Chuan Wu, F. Lau

{"title":"Online influence maximization in non-stationary Social Networks","authors":"Yixin Bao, Xiaoke Wang, Zhi Wang, Chuan Wu, F. Lau","doi":"10.1109/IWQoS.2016.7590438","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590438","url":null,"abstract":"Social networks have been popular platforms for information propagation. An important use case is viral marketing: given a promotion budget, an advertiser can choose some influential users as the seed set and provide them free or discounted sample products; in this way, the advertiser hopes to increase the popularity of the product in the users' friend circles by the world-of-mouth effect, and thus maximizes the number of users that information of the production can reach. There has been a body of literature studying the influence maximization problem. Nevertheless, the existing studies mostly investigate the problem on a one-off basis, assuming fixed known influence probabilities among users, or the knowledge of the exact social network topology. In practice, the social network topology and the influence probabilities are typically unknown to the advertiser, which can be varying over time, i.e., in cases of newly established, strengthened or weakened social ties. In this paper, we focus on a dynamic non-stationary social network and design a randomized algorithm, RSB, based on multi-armed bandit optimization, to maximize influence propagation over time. The algorithm produces a sequence of online decisions and calibrates its explore-exploit strategy utilizing outcomes of previous decisions. It is rigorously proven to achieve an upper-bounded regret in reward and applicable to large-scale social networks. Practical effectiveness of the algorithm is evaluated using real-world datasets, which demonstrates that our algorithm outperforms previous stationary methods under non-stationary conditions.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126575964","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}

引用次数: 20