Feng Qian, V. Gopalakrishnan, Emir Halepovic, S. Sen, O. Spatscheck
A primary design decision in HTTP/2, the successor of HTTP/1.1, is object multiplexing. While multiplexing improves web performance in many scenarios, it still has several drawbacks due to complex cross-layer interactions. In this paper, we propose a novel multiplexing architecture called TM3 that overcomes many of these limitations. TM3 strategically leverages multiple concurrent multiplexing pipes in a transparent manner, and eliminates various types of head-of-line blocking that can severely impact user experience. TM3 works beyond HTTP over TCP and applies to a wide range of application and transport protocols. Extensive evaluations on LTE and wired networks show that TM3 substantially improves performance e.g., reduces web page load time by an average of 24% compared to SPDY, which is the basis for HTTP/2. For lossy links and concurrent transfers, the improvements are more pronounced: compared to SPDY, TM3 achieves up to 42% of average PLT reduction under losses and up to 90% if concurrent transfers exist.
{"title":"TM3: flexible transport-layer multi-pipe multiplexing middlebox without head-of-line blocking","authors":"Feng Qian, V. Gopalakrishnan, Emir Halepovic, S. Sen, O. Spatscheck","doi":"10.1145/2716281.2836088","DOIUrl":"https://doi.org/10.1145/2716281.2836088","url":null,"abstract":"A primary design decision in HTTP/2, the successor of HTTP/1.1, is object multiplexing. While multiplexing improves web performance in many scenarios, it still has several drawbacks due to complex cross-layer interactions. In this paper, we propose a novel multiplexing architecture called TM3 that overcomes many of these limitations. TM3 strategically leverages multiple concurrent multiplexing pipes in a transparent manner, and eliminates various types of head-of-line blocking that can severely impact user experience. TM3 works beyond HTTP over TCP and applies to a wide range of application and transport protocols. Extensive evaluations on LTE and wired networks show that TM3 substantially improves performance e.g., reduces web page load time by an average of 24% compared to SPDY, which is the basis for HTTP/2. For lossy links and concurrent transfers, the improvements are more pronounced: compared to SPDY, TM3 achieves up to 42% of average PLT reduction under losses and up to 90% if concurrent transfers exist.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116760213","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}
Vincent Liu, Danyang Zhuo, Simon Peter, A. Krishnamurthy, T. Anderson
As network demand increases, data center network operators face a number of challenges including the need to add capacity to the network. Unfortunately, network upgrades can be an expensive proposition, particularly at the edge of the network where most of the network's cost lies. This paper presents a quantitative study of alternative ways of wiring multiple server links into a data center network. In it, we propose and evaluate Subways, a new approach to wiring servers and Top-of-Rack (ToR) switches that provides an inexpensive incremental upgrade path as well as decreased network congestion, better load balancing, and improved fault tolerance. Our simulation-based results show that Subways significantly improves performance compared to alternative ways of wiring the same number of links and switches together. For example, we show that Subways offers up to 3.1× better performance on a MapReduce shuffle workload compared to an equivalent capacity network.
{"title":"Subways: a case for redundant, inexpensive data center edge links","authors":"Vincent Liu, Danyang Zhuo, Simon Peter, A. Krishnamurthy, T. Anderson","doi":"10.1145/2716281.2836112","DOIUrl":"https://doi.org/10.1145/2716281.2836112","url":null,"abstract":"As network demand increases, data center network operators face a number of challenges including the need to add capacity to the network. Unfortunately, network upgrades can be an expensive proposition, particularly at the edge of the network where most of the network's cost lies. This paper presents a quantitative study of alternative ways of wiring multiple server links into a data center network. In it, we propose and evaluate Subways, a new approach to wiring servers and Top-of-Rack (ToR) switches that provides an inexpensive incremental upgrade path as well as decreased network congestion, better load balancing, and improved fault tolerance. Our simulation-based results show that Subways significantly improves performance compared to alternative ways of wiring the same number of links and switches together. For example, we show that Subways offers up to 3.1× better performance on a MapReduce shuffle workload compared to an equivalent capacity network.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609351","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}
Nanxi Kang, Monia Ghobadi, J. Reumann, A. Shraer, J. Rexford
Traffic often needs to be split over multiple equivalent backend servers, links, paths, or middleboxes. For example, in a load-balancing system, switches distribute requests of online services to backend servers. Hash-based approaches like Equal-Cost Multi-Path (ECMP) have low accuracy due to hash collision and incur significant churn during update. In a Software-Defined Network (SDN) the accuracy of traffic splits can be improved by crafting a set of wildcard rules for switches that better match the actual traffic distribution. The drawback of existing SDN-based traffic-splitting solutions is poor scalability as they generate too many rules for small rule-tables on switches. In this paper, we propose Niagara, an SDN-based traffic-splitting scheme that achieves accurate traffic splits while being extremely efficient in the use of rule-table space available on commodity switches. Niagara uses an incremental update strategy to minimize the traffic churn given an update. Experiments demonstrate that Niagara (1) achieves nearly optimal accuracy using only 1.2%--37% of the rule space of the current state-of-art, (2) scales to tens of thousands of services with the constrained rule-table capacity and (3) offers nearly minimum churn.
{"title":"Efficient traffic splitting on commodity switches","authors":"Nanxi Kang, Monia Ghobadi, J. Reumann, A. Shraer, J. Rexford","doi":"10.1145/2716281.2836091","DOIUrl":"https://doi.org/10.1145/2716281.2836091","url":null,"abstract":"Traffic often needs to be split over multiple equivalent backend servers, links, paths, or middleboxes. For example, in a load-balancing system, switches distribute requests of online services to backend servers. Hash-based approaches like Equal-Cost Multi-Path (ECMP) have low accuracy due to hash collision and incur significant churn during update. In a Software-Defined Network (SDN) the accuracy of traffic splits can be improved by crafting a set of wildcard rules for switches that better match the actual traffic distribution. The drawback of existing SDN-based traffic-splitting solutions is poor scalability as they generate too many rules for small rule-tables on switches. In this paper, we propose Niagara, an SDN-based traffic-splitting scheme that achieves accurate traffic splits while being extremely efficient in the use of rule-table space available on commodity switches. Niagara uses an incremental update strategy to minimize the traffic churn given an update. Experiments demonstrate that Niagara (1) achieves nearly optimal accuracy using only 1.2%--37% of the rule space of the current state-of-art, (2) scales to tens of thousands of services with the constrained rule-table capacity and (3) offers nearly minimum churn.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122475661","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}
Tong Meng, Fan Wu, Aijing Li, Guihai Chen, N. Vaidya
The surge of proximity-based applications on mobile devices has promoted the need for effective neighbor discovery protocols in mobile wireless networks. In contrast to existing works, which can achieve energy efficient neighbor discovery with bounded latency only in the scenario without strong interference, we aim at designing techniques for practical and robust neighbor discovery. We propose ReCorder to achieve robust neighbor discovery in mobile wireless networks despite the "noisy" communication media. Specifically, we exploit the cross-correlation property of pseudo-random sequences to eliminate the necessity of beacon decoding in existing neighbor discovery protocols. In ReCorder, a neighbor discovery message can be detected through cross-correlation on an RCover preamble, and contains a ReCord identity signature, which is unique for each of the nodes. We also design algorithms for RCover detection and ReCord recognization. The performance of ReCorder has been evalueated using the USRP-N210 testbed. Our evaluation results show that ReCorder can achieve robust neighbor discovery at an SINR lower than the existing beaconing and decoding based neighbor discovery protocols by almost 10dB. Furthermore, ReCorder can avoid degrading the decoding of background IEEE 802.11a/g transmissions with BPSK modulation, which is important for its co-existence with concurrent wireless streams.
{"title":"On robust neighbor discovery in mobile wireless networks","authors":"Tong Meng, Fan Wu, Aijing Li, Guihai Chen, N. Vaidya","doi":"10.1145/2716281.2836123","DOIUrl":"https://doi.org/10.1145/2716281.2836123","url":null,"abstract":"The surge of proximity-based applications on mobile devices has promoted the need for effective neighbor discovery protocols in mobile wireless networks. In contrast to existing works, which can achieve energy efficient neighbor discovery with bounded latency only in the scenario without strong interference, we aim at designing techniques for practical and robust neighbor discovery. We propose ReCorder to achieve robust neighbor discovery in mobile wireless networks despite the \"noisy\" communication media. Specifically, we exploit the cross-correlation property of pseudo-random sequences to eliminate the necessity of beacon decoding in existing neighbor discovery protocols. In ReCorder, a neighbor discovery message can be detected through cross-correlation on an RCover preamble, and contains a ReCord identity signature, which is unique for each of the nodes. We also design algorithms for RCover detection and ReCord recognization. The performance of ReCorder has been evalueated using the USRP-N210 testbed. Our evaluation results show that ReCorder can achieve robust neighbor discovery at an SINR lower than the existing beaconing and decoding based neighbor discovery protocols by almost 10dB. Furthermore, ReCorder can avoid degrading the decoding of background IEEE 802.11a/g transmissions with BPSK modulation, which is important for its co-existence with concurrent wireless streams.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484647","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}
Peter Xiang Gao, Akshay Narayan, Gautam Kumar, R. Agarwal, S. Ratnasamy, S. Shenker
The importance of minimizing flow completion times (FCT) in datacenters has led to a growing literature on new network transport designs. Of particular note is pFabric, a protocol that achieves near-optimal FCTs. However, pFabric's performance comes at the cost of generality, since pFabric requires specialized hardware that embeds a specific scheduling policy within the network fabric, making it hard to meet diverse policy goals. Aiming for generality, the recent Fastpass proposal returns to a design based on commodity network hardware and instead relies on a centralized scheduler. Fastpass achieves generality, but (as we show) loses many of pFabric's performance benefits. We present pHost, a new transport design aimed at achieving both: the near-optimal performance of pFabric and the commodity network design of Fastpass. Similar to Fastpass, pHost keeps the network simple by decoupling the network fabric from scheduling decisions. However, pHost introduces a new distributed protocol that allows end-hosts to directly make scheduling decisions, thus avoiding the overheads of Fastpass's centralized scheduler architecture. We show that pHost achieves performance on par with pFabric (within 4% for typical conditions) and significantly outperforms Fastpass (by a factor of 3.8×) while relying only on commodity network hardware.
{"title":"pHost: distributed near-optimal datacenter transport over commodity network fabric","authors":"Peter Xiang Gao, Akshay Narayan, Gautam Kumar, R. Agarwal, S. Ratnasamy, S. Shenker","doi":"10.1145/2716281.2836086","DOIUrl":"https://doi.org/10.1145/2716281.2836086","url":null,"abstract":"The importance of minimizing flow completion times (FCT) in datacenters has led to a growing literature on new network transport designs. Of particular note is pFabric, a protocol that achieves near-optimal FCTs. However, pFabric's performance comes at the cost of generality, since pFabric requires specialized hardware that embeds a specific scheduling policy within the network fabric, making it hard to meet diverse policy goals. Aiming for generality, the recent Fastpass proposal returns to a design based on commodity network hardware and instead relies on a centralized scheduler. Fastpass achieves generality, but (as we show) loses many of pFabric's performance benefits. We present pHost, a new transport design aimed at achieving both: the near-optimal performance of pFabric and the commodity network design of Fastpass. Similar to Fastpass, pHost keeps the network simple by decoupling the network fabric from scheduling decisions. However, pHost introduces a new distributed protocol that allows end-hosts to directly make scheduling decisions, thus avoiding the overheads of Fastpass's centralized scheduler architecture. We show that pHost achieves performance on par with pFabric (within 4% for typical conditions) and significantly outperforms Fastpass (by a factor of 3.8×) while relying only on commodity network hardware.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129537556","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}
We present an algorithm that takes measurements of the packet Reorder Density (RD) metric and generates reordering sequences. These sequences can be used by a simulator or emulator to precisely and repeatably reorder packets in a way that recreates the original RD. We show that our algorithm is efficient for a range of realistic reordering scenarios, and present an extension to the Dummynet emulator that uses makes use of it.
{"title":"Realistic packet reordering for network emulation and simulation","authors":"Aisha Syed, R. Ricci","doi":"10.1145/2716281.2836110","DOIUrl":"https://doi.org/10.1145/2716281.2836110","url":null,"abstract":"We present an algorithm that takes measurements of the packet Reorder Density (RD) metric and generates reordering sequences. These sequences can be used by a simulator or emulator to precisely and repeatably reorder packets in a way that recreates the original RD. We show that our algorithm is efficient for a range of realistic reordering scenarios, and present an extension to the Dummynet emulator that uses makes use of it.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122019789","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}
A. Atya, K. Sundaresan, S. Krishnamurthy, M. Khojastepour, S. Rangarajan
Power line communications (PLC) offer an immediate means of providing high bandwidth connectivity in settings where there is no in-built network infrastructure. While there is recent work on understanding physical and MAC layer artifacts of PLC, its applicability and performance in multi-flow settings is not well understood. We first undertake an extensive measurement study that sheds light on the properties of PLC that significantly affect performance in multi-flow settings. Using the understanding gained, we design BOLT, a framework that adopts a learning-based approach to effectively manage and orchestrate flows in a PLC network. BOLT is flexible and is agnostic to standards; it can be used to implement scheduling algorithms that target different performance goals. We implement BOLT on three different testbeds using off-the-shelf PLC adapters and showcase its ability to effectively manage flows, delivering several folds throughput improvement over state-of-the-art solutions.
{"title":"BOLT: realizing high throughput power line communication networks","authors":"A. Atya, K. Sundaresan, S. Krishnamurthy, M. Khojastepour, S. Rangarajan","doi":"10.1145/2716281.2836124","DOIUrl":"https://doi.org/10.1145/2716281.2836124","url":null,"abstract":"Power line communications (PLC) offer an immediate means of providing high bandwidth connectivity in settings where there is no in-built network infrastructure. While there is recent work on understanding physical and MAC layer artifacts of PLC, its applicability and performance in multi-flow settings is not well understood. We first undertake an extensive measurement study that sheds light on the properties of PLC that significantly affect performance in multi-flow settings. Using the understanding gained, we design BOLT, a framework that adopts a learning-based approach to effectively manage and orchestrate flows in a PLC network. BOLT is flexible and is agnostic to standards; it can be used to implement scheduling algorithms that target different performance goals. We implement BOLT on three different testbeds using off-the-shelf PLC adapters and showcase its ability to effectively manage flows, delivering several folds throughput improvement over state-of-the-art solutions.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132287801","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}
Danilo Cicalese, J. Augé, D. Joumblatt, T. Friedman, D. Rossi
This paper provides a comprehensive picture of IP-layer anycast adoption in the current Internet. We carry on multiple IPv4 anycast censuses, relying on latency measurement from PlanetLab. Next, we leverage our novel technique for anycast detection, enumeration, and geolocation [17] to quantify anycast adoption in the Internet. Our technique is scalable and, unlike previous efforts that are bound to exploiting DNS, is protocol-agnostic. Our results show that major Internet companies (including tier-1 ISPs, over-the-top operators, Cloud providers and equipment vendors) use anycast: we find that a broad range of TCP services are offered over anycast, the most popular of which include HTTP and HTTPS by anycast CDNs that serve websites from the top-100k Alexa list. Additionally, we complement our characterization of IPv4 anycast with a description of the challenges we faced to collect and analyze large-scale delay measurements, and the lessons learned.
{"title":"Characterizing IPv4 anycast adoption and deployment","authors":"Danilo Cicalese, J. Augé, D. Joumblatt, T. Friedman, D. Rossi","doi":"10.1145/2716281.2836101","DOIUrl":"https://doi.org/10.1145/2716281.2836101","url":null,"abstract":"This paper provides a comprehensive picture of IP-layer anycast adoption in the current Internet. We carry on multiple IPv4 anycast censuses, relying on latency measurement from PlanetLab. Next, we leverage our novel technique for anycast detection, enumeration, and geolocation [17] to quantify anycast adoption in the Internet. Our technique is scalable and, unlike previous efforts that are bound to exploiting DNS, is protocol-agnostic. Our results show that major Internet companies (including tier-1 ISPs, over-the-top operators, Cloud providers and equipment vendors) use anycast: we find that a broad range of TCP services are offered over anycast, the most popular of which include HTTP and HTTPS by anycast CDNs that serve websites from the top-100k Alexa list. Additionally, we complement our characterization of IPv4 anycast with a description of the challenges we faced to collect and analyze large-scale delay measurements, and the lessons learned.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124810600","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}
Nimantha Thushan Baranasuriya, Vishnu Navda, V. Padmanabhan, Seth Gilbert
Mobile communication is often frustratingly slow. When a user encounters poor performance, and perhaps even "confirms" the same by running a speed test, the tendency is to ascribe blame to the user's last-mile provider. However, as we argue in this paper, a more nuanced approach is needed to identify the location of the bottleneck responsible for the poor performance. Specifically, we focus on the question of whether the bottleneck lies in the cellular last hop (3G or LTE link) or elsewhere in the WAN path. We present QProbe, a tool that takes advantage of the proportional fair (PF) scheduler employed in cellular networks to determine whether queuing is happening at the cellular link. After validating QProbe through simulations and controlled experiments, we present our findings from a measurement study conducted over a 2 month period involving over 600 real-world users across 51 operator networks in 33 countries. We find that, for example, the cellular last-hop link is the bottleneck in 68.9% and 25.7% of the total bottleneck cases for 3G and LTE clients, respectively, suggesting that there is a significant fraction of cases where the poor performance experienced by the user is due to the WAN and could potentially be routed around. Moreover, we show that QProbe detects the bottleneck link location with greater than 85% accuracy for both 3G and LTE clients in our measurement study.
{"title":"QProbe: locating the bottleneck in cellular communication","authors":"Nimantha Thushan Baranasuriya, Vishnu Navda, V. Padmanabhan, Seth Gilbert","doi":"10.1145/2716281.2836118","DOIUrl":"https://doi.org/10.1145/2716281.2836118","url":null,"abstract":"Mobile communication is often frustratingly slow. When a user encounters poor performance, and perhaps even \"confirms\" the same by running a speed test, the tendency is to ascribe blame to the user's last-mile provider. However, as we argue in this paper, a more nuanced approach is needed to identify the location of the bottleneck responsible for the poor performance. Specifically, we focus on the question of whether the bottleneck lies in the cellular last hop (3G or LTE link) or elsewhere in the WAN path. We present QProbe, a tool that takes advantage of the proportional fair (PF) scheduler employed in cellular networks to determine whether queuing is happening at the cellular link. After validating QProbe through simulations and controlled experiments, we present our findings from a measurement study conducted over a 2 month period involving over 600 real-world users across 51 operator networks in 33 countries. We find that, for example, the cellular last-hop link is the bottleneck in 68.9% and 25.7% of the total bottleneck cases for 3G and LTE clients, respectively, suggesting that there is a significant fraction of cases where the poor performance experienced by the user is due to the WAN and could potentially be routed around. Moreover, we show that QProbe detects the bottleneck link location with greater than 85% accuracy for both 3G and LTE clients in our measurement study.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125582488","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}
Preservation of user privacy is paramount in the publication of datasets that contain fine-grained information about individuals. The problem is especially critical in the case of mobile traffic datasets collected by cellular operators, as they feature high subscriber trajectory uniqueness and they are resistant to anonymization through spatiotemporal generalization. In this work, we first unveil the reasons behind such undesirable features of mobile traffic datasets, by leveraging an original measure of the anonymizability of users' mobile fingerprints. Building on such findings, we propose GLOVE, an algorithm that grants k-anonymity of trajectories through specialized generalization. We evaluate our methodology on two nationwide mobile traffic datasets, and show that it achieves k-anonymity while preserving a substantial level of accuracy in the data.
{"title":"Hiding mobile traffic fingerprints with GLOVE","authors":"M. Gramaglia, M. Fiore","doi":"10.1145/2716281.2836111","DOIUrl":"https://doi.org/10.1145/2716281.2836111","url":null,"abstract":"Preservation of user privacy is paramount in the publication of datasets that contain fine-grained information about individuals. The problem is especially critical in the case of mobile traffic datasets collected by cellular operators, as they feature high subscriber trajectory uniqueness and they are resistant to anonymization through spatiotemporal generalization. In this work, we first unveil the reasons behind such undesirable features of mobile traffic datasets, by leveraging an original measure of the anonymizability of users' mobile fingerprints. Building on such findings, we propose GLOVE, an algorithm that grants k-anonymity of trajectories through specialized generalization. We evaluate our methodology on two nationwide mobile traffic datasets, and show that it achieves k-anonymity while preserving a substantial level of accuracy in the data.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566852","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
扫码关注我们
求助内容：
应助结果提醒方式：