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.
{"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}
Pub Date : 2016-06-20DOI: 10.1109/IWQoS.2016.7590411
Siyuan Huang, Jin Zhao, Xin Wang
Software-Defined Networking (SDN) has great potentials in changing the fragile and complex enterprise networks. One operational challenge to SDN deployment is the settlement of legacy switches. A hybrid SDN consisting of both SDN and legacy switches may be a tradeoff. Nevertheless most of the current SDN control planes can not handle legacy switches. To overcome this problem, we present HybridFlow, a lightweight control plane for hybrid SDN. HybridFlow can abstract a hybrid network into a logical SDN network and existing SDN control applications can run on it transparently.
{"title":"HybridFlow: A lightweight control plane for hybrid SDN in enterprise networks","authors":"Siyuan Huang, Jin Zhao, Xin Wang","doi":"10.1109/IWQoS.2016.7590411","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590411","url":null,"abstract":"Software-Defined Networking (SDN) has great potentials in changing the fragile and complex enterprise networks. One operational challenge to SDN deployment is the settlement of legacy switches. A hybrid SDN consisting of both SDN and legacy switches may be a tradeoff. Nevertheless most of the current SDN control planes can not handle legacy switches. To overcome this problem, we present HybridFlow, a lightweight control plane for hybrid SDN. HybridFlow can abstract a hybrid network into a logical SDN network and existing SDN control applications can run on it transparently.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"25 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":"127249326","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}
Nowadays, distributed data stores have become a fundamental infrastructure for large-scale Internet services, and they usually replicate data partitions to achieve high scalability and availability. To achieve better performance and availability, many Internet services embrace eventual consistency. However, stronger consistency is always desirable for system correctness. Recent studies [1][2] pay more attention to the convergent causal consistency, which is proved to be one of the strongest consistency models that can be achieved together with high availability in the presence of network partitions [3]. Convergent causal consistency couples the virtues of causal consistency and eventual consistency. As a result, convergent causal consistency not only guarantees that clients observe causality throughout, but also ensures that all replicas converge to the same state, which are critical for implementing reasonable application behaviors.
{"title":"Achieving convergent causal consistency and high availability with asynchronous replication","authors":"Yu Tang, Hailong Sun, Xu Wang, Xudong Liu, Zhenglin Xia","doi":"10.1109/IWQoS.2016.7590407","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590407","url":null,"abstract":"Nowadays, distributed data stores have become a fundamental infrastructure for large-scale Internet services, and they usually replicate data partitions to achieve high scalability and availability. To achieve better performance and availability, many Internet services embrace eventual consistency. However, stronger consistency is always desirable for system correctness. Recent studies [1][2] pay more attention to the convergent causal consistency, which is proved to be one of the strongest consistency models that can be achieved together with high availability in the presence of network partitions [3]. Convergent causal consistency couples the virtues of causal consistency and eventual consistency. As a result, convergent causal consistency not only guarantees that clients observe causality throughout, but also ensures that all replicas converge to the same state, which are critical for implementing reasonable application behaviors.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"163 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":"127423482","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}
In Content-Centric Networks (CCN), multiple routers may cache the same content, which makes it possible to retrieve the content chunks in parallel. In this paper, we propose Multi-Source Request and Transmission mechanism (MSRT) for CCN. We develop a MinMax problem to compute the optimal solution to retrieve all the chunks from multiple sources in the shortest time. We prove that the problem is NP complete and thus design a fully polynomial-time approximation algorithm to solve this problem. However, the previous works on multipath congestion control cannot be directly employed in MSRT. Therefore, we then propose the Half eXplicit Congestion Protocol (HXCP) to control the request/transmission pace in MSRT. To demonstrate the performance of MSRT, we construct comprehensive experiments. The results show that 1) our scheme reduces the content transmission time to at most 80%; 2) our multipath congestion control scheme HXCP effectively avoids congestion, improves the throughput and guarantees the fairness in the multi-source/multipath scenario.
{"title":"MSRT: Multi-Source Request and Transmission in Content-Centric Networks","authors":"Qing Li, Bin Gan, Guangwu Hu, Yong Jiang, Q. Liao, Mingwei Xu","doi":"10.1109/IWQoS.2016.7590398","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590398","url":null,"abstract":"In Content-Centric Networks (CCN), multiple routers may cache the same content, which makes it possible to retrieve the content chunks in parallel. In this paper, we propose Multi-Source Request and Transmission mechanism (MSRT) for CCN. We develop a MinMax problem to compute the optimal solution to retrieve all the chunks from multiple sources in the shortest time. We prove that the problem is NP complete and thus design a fully polynomial-time approximation algorithm to solve this problem. However, the previous works on multipath congestion control cannot be directly employed in MSRT. Therefore, we then propose the Half eXplicit Congestion Protocol (HXCP) to control the request/transmission pace in MSRT. To demonstrate the performance of MSRT, we construct comprehensive experiments. The results show that 1) our scheme reduces the content transmission time to at most 80%; 2) our multipath congestion control scheme HXCP effectively avoids congestion, improves the throughput and guarantees the fairness in the multi-source/multipath scenario.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"45 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113968105","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590404
Hao Wu, B. Liu, Yang Li, Huichen Dai, Weiyi Zhang, Yi Wang
We investigated the cache allocation and replacement problems in CCN within a single ISP and propose the scheme called Tube Caching that can dynamically distribute contents across the forwarding paths based on the energy-related benefit. Through the preliminary evaluations, Tube Caching has been proven to be effective.
{"title":"Tube caching: An effective caching scheme in Content-Centric Networking","authors":"Hao Wu, B. Liu, Yang Li, Huichen Dai, Weiyi Zhang, Yi Wang","doi":"10.1109/IWQoS.2016.7590404","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590404","url":null,"abstract":"We investigated the cache allocation and replacement problems in CCN within a single ISP and propose the scheme called Tube Caching that can dynamically distribute contents across the forwarding paths based on the energy-related benefit. Through the preliminary evaluations, Tube Caching has been proven to be effective.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"30 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":"114055065","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590418
Dongchao Ma, Shuai Zhang, Aiyun Wang, Li Ma
Recent years, a large number of open routing software architectures have emerged, such as XORP, ForCES, Ryu in SDN, reconfigurable platform, and so on. All of these architectures are open and comprising of components. They use components as the smallest resources, through the support of different assembly and release, to construct the complex routing and switching system. This paper take reconfigurable routing platforms for example, proposes a reliability valuating method based on Petri net and Fokker-Plank equations. Through the theory, it can verify the software component robustness ahead of time. Experiments show that the reliability evaluating results are coincident. The method of this paper solved the function robustness testing and reliability estimation problems of asynchronous interacted software in the reconfigurable routing platform with components dynamic loading and unloading. The practical significance is to reduce the workload of the testing staff and provides guidance to the routing software design to a certain extent.
近年来，出现了大量开放路由软件架构，如XORP、ForCES、Ryu in SDN、reconfigurable platform等。所有这些体系结构都是开放的，由组件组成。它们将组件作为最小的资源，通过不同的装配和释放支持，构建复杂的路由交换系统。以可重构路由平台为例，提出了一种基于Petri网和Fokker-Plank方程的可靠性评估方法。通过理论验证，可以提前验证软件构件的鲁棒性。实验结果表明，可靠性评估结果是一致的。该方法解决了可重构路由平台中具有组件动态加载和卸载的异步交互软件的功能鲁棒性测试和可靠性估计问题。实际意义在于减轻测试人员的工作量，并在一定程度上对路由软件设计提供指导。
{"title":"A reliability estimation method for reconfigurable routing and switching software","authors":"Dongchao Ma, Shuai Zhang, Aiyun Wang, Li Ma","doi":"10.1109/IWQoS.2016.7590418","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590418","url":null,"abstract":"Recent years, a large number of open routing software architectures have emerged, such as XORP, ForCES, Ryu in SDN, reconfigurable platform, and so on. All of these architectures are open and comprising of components. They use components as the smallest resources, through the support of different assembly and release, to construct the complex routing and switching system. This paper take reconfigurable routing platforms for example, proposes a reliability valuating method based on Petri net and Fokker-Plank equations. Through the theory, it can verify the software component robustness ahead of time. Experiments show that the reliability evaluating results are coincident. The method of this paper solved the function robustness testing and reliability estimation problems of asynchronous interacted software in the reconfigurable routing platform with components dynamic loading and unloading. The practical significance is to reduce the workload of the testing staff and provides guidance to the routing software design to a certain extent.","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":"133080329","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590437
Wubin Pan, Gaung Cheng, Hua Wu, Yongning Tang
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.
视频流已经成为最流行的移动应用程序之一，并且占据了当今移动网络流量的很大一部分。YouTube是最受欢迎的视频内容提供商之一。因此，了解用户对YouTube视频流媒体服务质量(即体验质量或QoE)的看法对内容提供商及其内容分发网络(CDN)提供商至关重要。尽管各种视频QoE评估方法建议使用不同的关键性能指标(kpi)，但它们本质上都与一个共同的参数有关:比特率。然而，在YouTube采用HTTPS作为自适应视频流方式更好地保护用户隐私和网络安全后，通过典型的深度包检测(DPI)方法无法从加密的视频流量中获得比特率。在本文中，我们通过提出一种基于机器学习的比特率估计(MBE)方法来解析来自IP数据包级别测量的比特率信息来解决这一挑战。为了评估MBE的有效性，我们选择了一家领先电信供应商提出的视频平均意见评分(video Mean Opinion Score, vMOS)作为QoE评估框架，并进行了全面的实验，研究了比特率估计精度对HTTPS YouTube视频流媒体服务的kpi的影响。实验结果表明，从加密视频流流量中实时获取比特率信息是一种可行且高效的方法。
{"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}
Pub Date : 2016-04-26DOI: 10.1109/IWQoS.2016.7590438
Yixin Bao, Xiaoke Wang, Zhi Wang, Chuan Wu, F. Lau
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：