Pub Date : 2016-06-20DOI: 10.1109/IWQoS.2016.7590420
Ke Liu, Zhuang Wang, Jack Y. B. Lee, Mingyu Chen, Lixin Zhang
Mobile data networks exhibit highly variable data rates and stochastic non-congestion-related packet loss. These challenges result in key performance bottlenecks in current Transmission Control Protocol (TCP) implementations: bandwidth inefficiency and large end-to-end delay. This work addresses these challenges by first developing a Sliding Interval based Rate Adaptation (SIRA) that tracks bandwidths with a fixed time interval and applies them to its transmission rate periodically. Extensive experiments confirmed that SIRA achieves 96.3% bandwidth utilization and reduces the average queueing delay by a factor of 1.37, compared to TCP CUBIC, the preferred variant for Internet servers. However, the resultant end-to-end delay is still much larger for interactive applications, thus we complement SIRA with two heuristic rate compensation algorithms (SIRA-H) given that the bandwidth does not vary significantly in long time scales. Specifically, SIRA-H first reduces the transmission rate of SIRA if the estimated RTT is above a prefigured threshold. Meanwhile, it computes the amount of unsent data that would be transmitted if SIRA were used, and compensates the rate reduction with those unsent data as if their ACKs were received, when the queue is detected to be empty. We evaluated SIRA-H through a combination of trace-driven emulations and real-world experiments, and showed that it reduces the 95th percentile queueing delay by a factor of over 3.9, while maintains a similar throughput compared to the original SIRA. In comparison to state of the art protocols such as Sprout and Verus, SIRA-H also reduces the 95th percentile queueing delay by a factor of over 0.8.
{"title":"Adaptive rate control over mobile data networks with heuristic rate compensations","authors":"Ke Liu, Zhuang Wang, Jack Y. B. Lee, Mingyu Chen, Lixin Zhang","doi":"10.1109/IWQoS.2016.7590420","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590420","url":null,"abstract":"Mobile data networks exhibit highly variable data rates and stochastic non-congestion-related packet loss. These challenges result in key performance bottlenecks in current Transmission Control Protocol (TCP) implementations: bandwidth inefficiency and large end-to-end delay. This work addresses these challenges by first developing a Sliding Interval based Rate Adaptation (SIRA) that tracks bandwidths with a fixed time interval and applies them to its transmission rate periodically. Extensive experiments confirmed that SIRA achieves 96.3% bandwidth utilization and reduces the average queueing delay by a factor of 1.37, compared to TCP CUBIC, the preferred variant for Internet servers. However, the resultant end-to-end delay is still much larger for interactive applications, thus we complement SIRA with two heuristic rate compensation algorithms (SIRA-H) given that the bandwidth does not vary significantly in long time scales. Specifically, SIRA-H first reduces the transmission rate of SIRA if the estimated RTT is above a prefigured threshold. Meanwhile, it computes the amount of unsent data that would be transmitted if SIRA were used, and compensates the rate reduction with those unsent data as if their ACKs were received, when the queue is detected to be empty. We evaluated SIRA-H through a combination of trace-driven emulations and real-world experiments, and showed that it reduces the 95th percentile queueing delay by a factor of over 3.9, while maintains a similar throughput compared to the original SIRA. In comparison to state of the art protocols such as Sprout and Verus, SIRA-H also reduces the 95th percentile queueing delay by a factor of over 0.8.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"13 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":"115000684","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.7590431
Lei Zhang, Feng Wang, Jiangchuan Liu, Xiaoqiang Ma
Nowadays technology advances of wireless networking and mobile devices have made anytime anywhere data access become readily available. This also enables crowdsourced content capturing and sharing, especially for such multimedia data as video. One example is Twitter's Vine, which mainly target mobile devices, allowing users to create ultra-short video clips and instantly share with their followers. In this paper, we take an initial study on this new generation of mobile instant video clip sharing service and explore the potentials towards its further enhancement. We closely investigate its unique mobile interface, featured user behaviors with screen scrolling, revealing the key differences between Vine-enabled anytime anywhere data access patterns and that of traditional counterparts. We then examine the scheduling policy to maximize the user watching experience as well as the cost efficiency. We show that the generic scheduling problem involves two subproblems, namely, pre-fetching scheduling and watch-time download scheduling, and develop effective solutions towards both of them. The superiority of our solution is demonstrated by extensive trace-driven simulations. To the best of our knowledge, this is the first work on modeling and optimizing the view experience of the instant video clip sharing service on mobile devices.
{"title":"On mobile instant video clip sharing with screen scrolling","authors":"Lei Zhang, Feng Wang, Jiangchuan Liu, Xiaoqiang Ma","doi":"10.1109/IWQoS.2016.7590431","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590431","url":null,"abstract":"Nowadays technology advances of wireless networking and mobile devices have made anytime anywhere data access become readily available. This also enables crowdsourced content capturing and sharing, especially for such multimedia data as video. One example is Twitter's Vine, which mainly target mobile devices, allowing users to create ultra-short video clips and instantly share with their followers. In this paper, we take an initial study on this new generation of mobile instant video clip sharing service and explore the potentials towards its further enhancement. We closely investigate its unique mobile interface, featured user behaviors with screen scrolling, revealing the key differences between Vine-enabled anytime anywhere data access patterns and that of traditional counterparts. We then examine the scheduling policy to maximize the user watching experience as well as the cost efficiency. We show that the generic scheduling problem involves two subproblems, namely, pre-fetching scheduling and watch-time download scheduling, and develop effective solutions towards both of them. The superiority of our solution is demonstrated by extensive trace-driven simulations. To the best of our knowledge, this is the first work on modeling and optimizing the view experience of the instant video clip sharing service on mobile devices.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"9 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":"117060729","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.7590425
Bowu Zhang, Jinho Hwang, Timothy Wood
Network function virtualization (NFV) and Software Defined Networks (SDN) separate and abstract network functions from underlying hardware, creating a flexible virtual networking environment that reduces cost and allows policy-based decisions. One of the biggest challenges in NFV-SDN is to map the required virtual network functions (VNFs) to the underlying hardware in substrate networks in a timely manner. In this paper, we formulate the VNF placement problem via Graph Pattern Matching, with an objective function that can be easily adapted to fit various applications. Previous work only considers off-line VNF placement as it is time consuming to find an appropriate mapping path while considering all software and hardware constraints. To reduce this time, we investigate the feasibility and effectiveness of path-precomputing, where paths are calculated prior to placement. Our approach enables online VNF placement in SDNs, allowing VNF requests to be processed as they arrive. An online placement approach (OPA) is proposed to place VNF requests on substrate networks. To the best of our knowledge, this is the first work in the literature that considers the online chaining VNF placement in SDNs. In addition, we present an application of OPA over cost minimization. Simulation results demonstrate that our online approach provides competitive performance compared with off-line algorithms.
{"title":"Toward online virtual network function placement in Software Defined Networks","authors":"Bowu Zhang, Jinho Hwang, Timothy Wood","doi":"10.1109/IWQoS.2016.7590425","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590425","url":null,"abstract":"Network function virtualization (NFV) and Software Defined Networks (SDN) separate and abstract network functions from underlying hardware, creating a flexible virtual networking environment that reduces cost and allows policy-based decisions. One of the biggest challenges in NFV-SDN is to map the required virtual network functions (VNFs) to the underlying hardware in substrate networks in a timely manner. In this paper, we formulate the VNF placement problem via Graph Pattern Matching, with an objective function that can be easily adapted to fit various applications. Previous work only considers off-line VNF placement as it is time consuming to find an appropriate mapping path while considering all software and hardware constraints. To reduce this time, we investigate the feasibility and effectiveness of path-precomputing, where paths are calculated prior to placement. Our approach enables online VNF placement in SDNs, allowing VNF requests to be processed as they arrive. An online placement approach (OPA) is proposed to place VNF requests on substrate networks. To the best of our knowledge, this is the first work in the literature that considers the online chaining VNF placement in SDNs. In addition, we present an application of OPA over cost minimization. Simulation results demonstrate that our online approach provides competitive performance compared with off-line 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":"128508838","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.7590414
Shuai Zhao, Zhu Li, D. Medhi
Instantaneous low delay on-demand video streaming with a very low start up and channel switching delay is highly desirable for users. The dominant over-the-top (OTT) solutions like DASH, which is based on HTTP and/or WebSocket, suffer from a slow start of the underlying TCP transport while the typical coding structure of the DASH content introduces additional delays. In this work, we address these issues with a new low delay transport based on a WebRTC data channel along with a new content side packetization scheme based on a new QoE metric driven DASH sub-representation to facilitate a fast start, with an agile and fine granular rate adaptation. Simulations on both NS-3 and the GENI testbed demonstrate the effectiveness of this approach. This can serve as a basis for a further peer assisted low delay over-the-top (OTT) solution for an instantaneous live video streaming solution.
{"title":"Low delay streaming of DASH content with WebRTC data channel","authors":"Shuai Zhao, Zhu Li, D. Medhi","doi":"10.1109/IWQoS.2016.7590414","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590414","url":null,"abstract":"Instantaneous low delay on-demand video streaming with a very low start up and channel switching delay is highly desirable for users. The dominant over-the-top (OTT) solutions like DASH, which is based on HTTP and/or WebSocket, suffer from a slow start of the underlying TCP transport while the typical coding structure of the DASH content introduces additional delays. In this work, we address these issues with a new low delay transport based on a WebRTC data channel along with a new content side packetization scheme based on a new QoE metric driven DASH sub-representation to facilitate a fast start, with an agile and fine granular rate adaptation. Simulations on both NS-3 and the GENI testbed demonstrate the effectiveness of this approach. This can serve as a basis for a further peer assisted low delay over-the-top (OTT) solution for an instantaneous live video streaming solution.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"13 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":"128694945","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.7590416
Yuan Yang, Mingwei Xu, Qi Li
Multi-link failures in the Internet may incur heavy packet loss and degrade the network performance. Existing approaches have been proposed to address this issue by enabling routing protections. However, the effectiveness and efficiency issues of these approaches are not well addressed. In particular, it has not been answered that whether label-free routing can provide full protection against arbitrary multi-link failures in any networks. We propose a model for interface-specific-routing (ISR) which can be seen as a general label-free routing. We present that there exist some networks in which no ISR can be constructed to protect the routing against any k-link failures (k ≥ 2). To improve the protection effectiveness with little overhead in such cases, we propose a tunneling on demand (TOD) approach in this paper. With our approach, most failures can be covered by ISR, and tunneling is activated only when failures cannot be detoured around by ISR. We develop algorithms to compute ISR properly so as to minimize the number of activated tunnels, and compute the protection tunnels if necessary. We prove that TOD can protect routing against any single-link failures and dual-link failures. We evaluate TOD by simulations with real world topologies. The results show that TOD can achieve a protection ratio higher than 98% with small tunneling overhead for multi-link failures, better than existing tunnel-free approach whose protection ratio is 85% to 95%.
{"title":"Tunneling on demand: A lightweight approach for IP fast rerouting against multi-link failures","authors":"Yuan Yang, Mingwei Xu, Qi Li","doi":"10.1109/IWQoS.2016.7590416","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590416","url":null,"abstract":"Multi-link failures in the Internet may incur heavy packet loss and degrade the network performance. Existing approaches have been proposed to address this issue by enabling routing protections. However, the effectiveness and efficiency issues of these approaches are not well addressed. In particular, it has not been answered that whether label-free routing can provide full protection against arbitrary multi-link failures in any networks. We propose a model for interface-specific-routing (ISR) which can be seen as a general label-free routing. We present that there exist some networks in which no ISR can be constructed to protect the routing against any k-link failures (k ≥ 2). To improve the protection effectiveness with little overhead in such cases, we propose a tunneling on demand (TOD) approach in this paper. With our approach, most failures can be covered by ISR, and tunneling is activated only when failures cannot be detoured around by ISR. We develop algorithms to compute ISR properly so as to minimize the number of activated tunnels, and compute the protection tunnels if necessary. We prove that TOD can protect routing against any single-link failures and dual-link failures. We evaluate TOD by simulations with real world topologies. The results show that TOD can achieve a protection ratio higher than 98% with small tunneling overhead for multi-link failures, better than existing tunnel-free approach whose protection ratio is 85% to 95%.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"101 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":"124625165","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.7590408
Jun-Na Zhang, Shangguang Wang, Qibo Sun, Fangchun Yang
Given a service composition, it is challenging but important to have a runtime adaptation, due to the complicated execution environment and evolving feature of Web service. In this paper, we present a runtime adaptive service composition approach, taking execution time minimization and revenue maximization into consideration. Based on dynamic programming, we deduce the optimal policy. Through this policy, orchestrator selects one concrete service for per task on runtime. The experimental results show that the proposed approach outperforms previous approach.
{"title":"Tradeoff between executing time and revenue for runtime service composition","authors":"Jun-Na Zhang, Shangguang Wang, Qibo Sun, Fangchun Yang","doi":"10.1109/IWQoS.2016.7590408","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590408","url":null,"abstract":"Given a service composition, it is challenging but important to have a runtime adaptation, due to the complicated execution environment and evolving feature of Web service. In this paper, we present a runtime adaptive service composition approach, taking execution time minimization and revenue maximization into consideration. Based on dynamic programming, we deduce the optimal policy. Through this policy, orchestrator selects one concrete service for per task on runtime. The experimental results show that the proposed approach outperforms previous approach.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"55 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":"134270224","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.7590445
Yuncheng Wu, Yao Wu, Hui Peng, Juru Zeng, Hong Chen, Cuiping Li
Density estimation can construct an estimate of the probability density function from the observed data. However, such a function may compromise the privacy of individuals. A notable paradigm for offering strong privacy guarantees in data analysis is differential privacy. In this paper, we propose DPGMM, a parametric density estimation algorithm using Gaussian mixtures model (GMM) under differential privacy. GMM is a well-known model that could approximate any distribution and can be solved via Expectation-Maximization (EM) algorithm. The main idea of DPGMM is to add two extra steps after getting the estimated parameters in the M step of each iteration. The first step is the noise adding step, which injects calibrated noise to the estimated parameters according to their L1-sensitivities and privacy budgets. The second step is the post-processing step, which post-processes those noisy parameters that might break their intrinsic characteristics. Extensive experiments using both real and synthetic datasets evaluate the performance of DPGMM, and demonstrate that the proposed method outperforms a state-of-art approach.
{"title":"Differentially private density estimation via Gaussian mixtures model","authors":"Yuncheng Wu, Yao Wu, Hui Peng, Juru Zeng, Hong Chen, Cuiping Li","doi":"10.1109/IWQoS.2016.7590445","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590445","url":null,"abstract":"Density estimation can construct an estimate of the probability density function from the observed data. However, such a function may compromise the privacy of individuals. A notable paradigm for offering strong privacy guarantees in data analysis is differential privacy. In this paper, we propose DPGMM, a parametric density estimation algorithm using Gaussian mixtures model (GMM) under differential privacy. GMM is a well-known model that could approximate any distribution and can be solved via Expectation-Maximization (EM) algorithm. The main idea of DPGMM is to add two extra steps after getting the estimated parameters in the M step of each iteration. The first step is the noise adding step, which injects calibrated noise to the estimated parameters according to their L1-sensitivities and privacy budgets. The second step is the post-processing step, which post-processes those noisy parameters that might break their intrinsic characteristics. Extensive experiments using both real and synthetic datasets evaluate the performance of DPGMM, and demonstrate that the proposed method outperforms a state-of-art approach.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"78 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":"133929061","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.7590393
Yi Wang, Dongzhe Tai, Ting Zhang, Bin Liu
The fast path, as the cache of exact-match rules in the slow path, is applied in software-based OpenFlow switches to improve the forwarding performance. A microflow in the fast path is the specification of its corresponding rules in the slow path, i.e., every field is explicit in a microflow. A rule can generate multiple microflows in the fast path, and a microflow can be generated from multiple rules since there are multiple flow tables in an OpenFlow switch. Due to the many-to-many mapping relationship between the microflows and the rules, the update consistency between the slow path and the fast path becomes a big challenge in software switches, e.g., Open vSwitch (OVS). In this paper, we propose a cache-based scheme (named FlowShadow) to achieve high update performance while keeping update consistency in OVS. In order to examine the reliability, validity, utility and scalability of FlowShadow, we implement FlowShadow on the OVS and conduct numerous experiments with different settings to measure the performance of FlowShadow. The experimental results demonstrate that FlowShadow achieves a lookup speed of 75 million packets per second on a commodity PC under the real backbone traces; the system with FlowShadow speeds up 3.4× times of the original OVS; and FlowShadow also shows high update performance and good scalability at different update speeds and with different numbers of flow tables.
{"title":"FlowShadow: Keeping update consistency in software-based OpenFlow switches","authors":"Yi Wang, Dongzhe Tai, Ting Zhang, Bin Liu","doi":"10.1109/IWQoS.2016.7590393","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590393","url":null,"abstract":"The fast path, as the cache of exact-match rules in the slow path, is applied in software-based OpenFlow switches to improve the forwarding performance. A microflow in the fast path is the specification of its corresponding rules in the slow path, i.e., every field is explicit in a microflow. A rule can generate multiple microflows in the fast path, and a microflow can be generated from multiple rules since there are multiple flow tables in an OpenFlow switch. Due to the many-to-many mapping relationship between the microflows and the rules, the update consistency between the slow path and the fast path becomes a big challenge in software switches, e.g., Open vSwitch (OVS). In this paper, we propose a cache-based scheme (named FlowShadow) to achieve high update performance while keeping update consistency in OVS. In order to examine the reliability, validity, utility and scalability of FlowShadow, we implement FlowShadow on the OVS and conduct numerous experiments with different settings to measure the performance of FlowShadow. The experimental results demonstrate that FlowShadow achieves a lookup speed of 75 million packets per second on a commodity PC under the real backbone traces; the system with FlowShadow speeds up 3.4× times of the original OVS; and FlowShadow also shows high update performance and good scalability at different update speeds and with different numbers of flow tables.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"44 4 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":"131192300","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 this paper, we take a close look to understand the cloud-based file synchronization and collaboration systems. Using the popular Dropbox as a case study, our measurement reveals its cascaded computation and communication operations that are far more complicated than those in conventional file hosting. We show that this serial design is necessary for the cloud deployment, which effectively avoids the possible task interference inside the computation cloud; yet it also leads to higher service variance across users. Even worse, in a collaborative file editing session, users' updates would be discarded without any warning. The drop rate is unfortunately related to the slowest collaborator, which severely hinders the system scalability and user satisfaction. We further investigate the root causes of this phenomenon as well as other performance bottlenecks and offer hints for practical improvement.
{"title":"Diving into cloud-based file synchronization with user collaboration","authors":"Haiyang Wang, Xiaoqiang Ma, Feng Wang, Jiangchuan Liu, Bharath Kumar Bommana, Xin Liu","doi":"10.1109/IWQoS.2016.7590396","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590396","url":null,"abstract":"In this paper, we take a close look to understand the cloud-based file synchronization and collaboration systems. Using the popular Dropbox as a case study, our measurement reveals its cascaded computation and communication operations that are far more complicated than those in conventional file hosting. We show that this serial design is necessary for the cloud deployment, which effectively avoids the possible task interference inside the computation cloud; yet it also leads to higher service variance across users. Even worse, in a collaborative file editing session, users' updates would be discarded without any warning. The drop rate is unfortunately related to the slowest collaborator, which severely hinders the system scalability and user satisfaction. We further investigate the root causes of this phenomenon as well as other performance bottlenecks and offer hints for practical improvement.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"338 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":"133491731","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.7590427
Dongliang Xie, Xin Wang, Qingtao Wang
With the rapid shift from end-to-end communications to content-based data retrieval, there are increasing interests in exploiting Content-centric Networks (CCN) to deliver data. As the special characteristics of CCN, in-network caching and naming-based routing make traditional TCP-like transmission control protocol unsuitable. Although there are some existing efforts on improving the congestion control in CCN, the big issue of redundant transmissions caused by multiple sources has received little attention. To eliminate the redundancy and speed up the transmission, we propose a complete Network Codes-based Multi-Source Transmission Control Protocol (MSTCP), which provides an efficient and controllable multi-source content retrieval service over CCN. MSTCP takes advantage of random network coding to make full use of the coded data responded by different sources to speed up decoding and data receiving at the request side. Moreover, we design a scheduling algorithm based on a simple Expected Reception Deadline (ERD) to efficiently control the number of coded packets to send at each source. This not only effectively eliminates the redundant transmissions in CCN, but also helps to significantly speed up the information retrieval. Extensive simulations show that our mechanism greatly reduces the redundancy while speeding up the content retrievals by the network users.
{"title":"Network Codes-based Multi-Source Transmission Control Protocol for Content-centric Networks","authors":"Dongliang Xie, Xin Wang, Qingtao Wang","doi":"10.1109/IWQoS.2016.7590427","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590427","url":null,"abstract":"With the rapid shift from end-to-end communications to content-based data retrieval, there are increasing interests in exploiting Content-centric Networks (CCN) to deliver data. As the special characteristics of CCN, in-network caching and naming-based routing make traditional TCP-like transmission control protocol unsuitable. Although there are some existing efforts on improving the congestion control in CCN, the big issue of redundant transmissions caused by multiple sources has received little attention. To eliminate the redundancy and speed up the transmission, we propose a complete Network Codes-based Multi-Source Transmission Control Protocol (MSTCP), which provides an efficient and controllable multi-source content retrieval service over CCN. MSTCP takes advantage of random network coding to make full use of the coded data responded by different sources to speed up decoding and data receiving at the request side. Moreover, we design a scheduling algorithm based on a simple Expected Reception Deadline (ERD) to efficiently control the number of coded packets to send at each source. This not only effectively eliminates the redundant transmissions in CCN, but also helps to significantly speed up the information retrieval. Extensive simulations show that our mechanism greatly reduces the redundancy while speeding up the content retrievals by the network users.","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":"123557240","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
扫码关注我们
求助内容：
应助结果提醒方式：