We present bandwidth hopping spread spectrum (BHSS), a novel technique to improve the jamming resistance of wireless communications. In BHSS, the bandwidth of a signal is hopped rapidly in a manner that is unpredictable to the jammer. We show in this work that by combining bandwidth hopping at the transmitter with adaptive filtering at the receiver, BHSS is able to improve the jamming resistance of the communication beyond the processing gain of conventional spread spectrum techniques such as DSSS and FHSS without an increase in RF spectrum requirements. We have designed and implemented a BHSS transmitter and receiver system on off-the-shelf software-defined radios. Our experimental results with different hopping patterns show that BHSS is able to boost the power advantage of spread spectrum communication by 8 to 20 dB for jammers of fixed bandwidth. When both transmitter and jammer hop randomly, the average power advantage we achieve with our system is 11.4 dB.
{"title":"Jamming mitigation by randomized bandwidth hopping","authors":"Marc Liechti, Vincent Lenders, D. Giustiniano","doi":"10.1145/2716281.2836096","DOIUrl":"https://doi.org/10.1145/2716281.2836096","url":null,"abstract":"We present bandwidth hopping spread spectrum (BHSS), a novel technique to improve the jamming resistance of wireless communications. In BHSS, the bandwidth of a signal is hopped rapidly in a manner that is unpredictable to the jammer. We show in this work that by combining bandwidth hopping at the transmitter with adaptive filtering at the receiver, BHSS is able to improve the jamming resistance of the communication beyond the processing gain of conventional spread spectrum techniques such as DSSS and FHSS without an increase in RF spectrum requirements. We have designed and implemented a BHSS transmitter and receiver system on off-the-shelf software-defined radios. Our experimental results with different hopping patterns show that BHSS is able to boost the power advantage of spread spectrum communication by 8 to 20 dB for jammers of fixed bandwidth. When both transmitter and jammer hop randomly, the average power advantage we achieve with our system is 11.4 dB.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"74 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":"124596179","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}
Yeon-sup Lim, Yung-chih Chen, E. Nahum, D. Towsley, R. Gibbens, E. Cecchet
Multi-Path TCP (MPTCP) is a new transport protocol that enables systems to exploit available paths through multiple network interfaces. MPTCP is particularly useful for mobile devices, which usually have multiple wireless interfaces. However, these devices have limited power capacity and thus judicious use of these interfaces is required. In this work, we design, implement, and evaluate an energy-aware variant called eMPTCP, which seeks to reduce power consumption compared to standard MPTCP, with minimal impact on download latency. eMPTCP uses a combination of power-aware subflow management and delayed subflow establishment to accomplish its goals. Power-aware subflow management allows eMPTCP to choose paths dynamically to maximize per-byte energy efficiency, using runtime measurements and a parameterized energy consumption model that accounts for multiple interfaces. Delayed subflow establishment lets eMPTCP avoid heavy power consumptions in cellular interfaces for small transfers. We implement eMPTCP on Android mobile devices and evaluate it across several scenarios, both in the lab and in the wild. We measure both energy consumption and download times, varying network bandwidth, background traffic, user mobility, client and server location, and download size. Our results show that eMPTCP reduces power consumption compared to MPTCP by up to 90% for small file downloads and up to 50% for large file downloads.
{"title":"Design, implementation, and evaluation of energy-aware multi-path TCP","authors":"Yeon-sup Lim, Yung-chih Chen, E. Nahum, D. Towsley, R. Gibbens, E. Cecchet","doi":"10.1145/2716281.2836115","DOIUrl":"https://doi.org/10.1145/2716281.2836115","url":null,"abstract":"Multi-Path TCP (MPTCP) is a new transport protocol that enables systems to exploit available paths through multiple network interfaces. MPTCP is particularly useful for mobile devices, which usually have multiple wireless interfaces. However, these devices have limited power capacity and thus judicious use of these interfaces is required. In this work, we design, implement, and evaluate an energy-aware variant called eMPTCP, which seeks to reduce power consumption compared to standard MPTCP, with minimal impact on download latency. eMPTCP uses a combination of power-aware subflow management and delayed subflow establishment to accomplish its goals. Power-aware subflow management allows eMPTCP to choose paths dynamically to maximize per-byte energy efficiency, using runtime measurements and a parameterized energy consumption model that accounts for multiple interfaces. Delayed subflow establishment lets eMPTCP avoid heavy power consumptions in cellular interfaces for small transfers. We implement eMPTCP on Android mobile devices and evaluate it across several scenarios, both in the lab and in the wild. We measure both energy consumption and download times, varying network bandwidth, background traffic, user mobility, client and server location, and download size. Our results show that eMPTCP reduces power consumption compared to MPTCP by up to 90% for small file downloads and up to 50% for large file downloads.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"45 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":"129253559","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}
Benjamin Hesmans, G. Detal, S. Barré, R. Bauduin, O. Bonaventure
Multipath TCP was designed and implemented as a backward compatible replacement for TCP. For this reason, it exposes the standard socket API to the applications that cannot control the utilisation of the different paths. This is a key feature for applications that are unaware of the multipath nature of the network. On the contrary, this is a limitation for applications that could benefit from specific knowledge to use multiple paths in a way that fits their needs. As the specific knowledge of an application can not be known in advance, we propose a Multipath TCP path manager that delegates the management of the paths to the applications. This path manager enables applications to control how the different paths are used to transfer data. We implement this path manager above the Linux Multipath TCP kernel. It is composed of a kernel part that exposes events and commands to an userspace application that controls the key functions of Multipath TCP such as the creation/suppression of subflows or reactions to retransmissions. We demonstrate the benefits of this path manager on different use cases.
{"title":"SMAPP: towards smart multipath TCP-enabled applications","authors":"Benjamin Hesmans, G. Detal, S. Barré, R. Bauduin, O. Bonaventure","doi":"10.1145/2716281.2836113","DOIUrl":"https://doi.org/10.1145/2716281.2836113","url":null,"abstract":"Multipath TCP was designed and implemented as a backward compatible replacement for TCP. For this reason, it exposes the standard socket API to the applications that cannot control the utilisation of the different paths. This is a key feature for applications that are unaware of the multipath nature of the network. On the contrary, this is a limitation for applications that could benefit from specific knowledge to use multiple paths in a way that fits their needs. As the specific knowledge of an application can not be known in advance, we propose a Multipath TCP path manager that delegates the management of the paths to the applications. This path manager enables applications to control how the different paths are used to transfer data. We implement this path manager above the Linux Multipath TCP kernel. It is composed of a kernel part that exposes events and commands to an userspace application that controls the key functions of Multipath TCP such as the creation/suppression of subflows or reactions to retransmissions. We demonstrate the benefits of this path manager on different use cases.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"28 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":"126108827","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 ask the following question in this paper: Can the goals of centralized WiFi scheduling be achieved using purely distributed operations? We present a solution called Look Who's Talking (LWT) that allows for arbitrary schedules to be distributed to nodes in a WiFi network. The nodes in the network then use purely local and distributed operations to achieve the prescribed schedule. The scope of LWT in this paper is restricted to a single collision domain (single or multiple cells), but we discuss how LWT can be extended to multiple collision domains. We use both experimental evaluations (using a WARP-based testbed) and simulation-based analysis (using ns3) to evaluate LWT.
{"title":"Look who's talking: a practical approach for achieving scheduled wifi in a single collision domain","authors":"Chao-Fang Shih, Yubing Jian, Raghupathy Sivakumar","doi":"10.1145/2716281.2836116","DOIUrl":"https://doi.org/10.1145/2716281.2836116","url":null,"abstract":"We ask the following question in this paper: Can the goals of centralized WiFi scheduling be achieved using purely distributed operations? We present a solution called Look Who's Talking (LWT) that allows for arbitrary schedules to be distributed to nodes in a WiFi network. The nodes in the network then use purely local and distributed operations to achieve the prescribed schedule. The scope of LWT in this paper is restricted to a single collision domain (single or multiple cells), but we discuss how LWT can be extended to multiple collision domains. We use both experimental evaluations (using a WARP-based testbed) and simulation-based analysis (using ns3) to evaluate LWT.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"23 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":"124692261","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}
Shenglin Zhang, Y. Liu, Dan Pei, Yu Chen, Xianping Qu, Shimin Tao, Zhi Zang
The detection of performance changes in software change roll-outs in Internet-based services is crucial for an operations team, because it allows timely roll-back of a software change when performance degrades unexpectedly. However, it is infeasible to manually investigate millions of performance measurements of many roll-outs. In this paper, we present an automated tool, FUNNEL, for rapid and robust impact assessment of software changes in large Internet-based services. FUNNEL automatically collects the related performance measurements for each software change. To detect significant performance behavior changes, FUNNEL adopts singular spectrum transform (SST) algorithm as the core algorithm, uses various techniques to improve its robustness and reduce its computational cost, and applies a difference-in-difference (DiD) method to differentiate the true causality from the random correlations between the performance change and the software change. Evaluation through historical data in real-word services shows that FUNNEL achieves an accuracy of more than 99.8%. Compared with previous methods, FUNNEL's detection delay is 38.02% to 64.99% shorter, and its computation speed is 4.59 - 7098 times faster. In real deployment, FUNNEL achieves a 98.21% precision, high robustness, fast detection speed, and shows its capability in detecting unexpected performance changes.
{"title":"Rapid and robust impact assessment of software changes in large internet-based services","authors":"Shenglin Zhang, Y. Liu, Dan Pei, Yu Chen, Xianping Qu, Shimin Tao, Zhi Zang","doi":"10.1145/2716281.2836087","DOIUrl":"https://doi.org/10.1145/2716281.2836087","url":null,"abstract":"The detection of performance changes in software change roll-outs in Internet-based services is crucial for an operations team, because it allows timely roll-back of a software change when performance degrades unexpectedly. However, it is infeasible to manually investigate millions of performance measurements of many roll-outs. In this paper, we present an automated tool, FUNNEL, for rapid and robust impact assessment of software changes in large Internet-based services. FUNNEL automatically collects the related performance measurements for each software change. To detect significant performance behavior changes, FUNNEL adopts singular spectrum transform (SST) algorithm as the core algorithm, uses various techniques to improve its robustness and reduce its computational cost, and applies a difference-in-difference (DiD) method to differentiate the true causality from the random correlations between the performance change and the software change. Evaluation through historical data in real-word services shows that FUNNEL achieves an accuracy of more than 99.8%. Compared with previous methods, FUNNEL's detection delay is 38.02% to 64.99% shorter, and its computation speed is 4.59 - 7098 times faster. In real deployment, FUNNEL achieves a 98.21% precision, high robustness, fast detection speed, and shows its capability in detecting unexpected performance changes.","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":"133476961","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}
U. Moravapalle, Shruti Sanadhya, Abhinav Parate, Kyu-Han Kim
With the great success of LTE(-A) outdoor, LTE-based small cell technology has become popular and is penetrating indoor enterprise environment, co-existing with WiFi networks, to provide better user experience or Quality-of-Experience (QoE). However, accurate estimation of LTE links is challenging and critical to continue providing QoE for many enterprise applications (e.g., video/audio) and services (network selection). While prior work on LTE link throughput estimation depends mostly on a single factor (e.g., link rate), we argue that it needs to consider more factors to improve the estimation to meet increasing demands on QoE. In this paper, we propose a new metric, called Pulsar (Per-user LTE ShAre of Resources), that estimates per flow throughput in LTE networks by leveraging both underlying channel information and application traffic characteristics. Our extensive evaluation study through ns-3 shows that Pulsar reduces the estimation error more than 92%, compared to prior work, in various scenarios, while keeping estimation overhead low.
{"title":"Pulsar: improving throughput estimation in enterprise LTE small cells","authors":"U. Moravapalle, Shruti Sanadhya, Abhinav Parate, Kyu-Han Kim","doi":"10.1145/2716281.2836105","DOIUrl":"https://doi.org/10.1145/2716281.2836105","url":null,"abstract":"With the great success of LTE(-A) outdoor, LTE-based small cell technology has become popular and is penetrating indoor enterprise environment, co-existing with WiFi networks, to provide better user experience or Quality-of-Experience (QoE). However, accurate estimation of LTE links is challenging and critical to continue providing QoE for many enterprise applications (e.g., video/audio) and services (network selection). While prior work on LTE link throughput estimation depends mostly on a single factor (e.g., link rate), we argue that it needs to consider more factors to improve the estimation to meet increasing demands on QoE. In this paper, we propose a new metric, called Pulsar (Per-user LTE ShAre of Resources), that estimates per flow throughput in LTE networks by leveraging both underlying channel information and application traffic characteristics. Our extensive evaluation study through ns-3 shows that Pulsar reduces the estimation error more than 92%, compared to prior work, in various scenarios, while keeping estimation overhead low.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"438 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":"132207117","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}
Pengfei Hu, P. Pathak, Xiaotao Feng, Hao Fu, P. Mohapatra
LED-to-camera communication allows LEDs deployed for illumination purposes to modulate and transmit data which can be received by camera sensors available in mobile devices like smartphones, wearable smart-glasses etc. Such communication has a unique property that a user can visually identify a transmitter (i.e. LED) and specifically receive information from the transmitter. It can support a variety of novel applications such as augmented reality through mobile devices, navigation using smart signs, fine-grained location specific advertisement etc. However, the achievable data rate in current LED-to-camera communication techniques remains very low (≈ 12 bytes per second) to support any practical application. In this paper, we present ColorBars, an LED-to-camera communication system that utilizes Color Shift Keying (CSK) to modulate data using different colors transmitted by the LED. It exploits the increasing popularity of Tri-LEDs (RGB) that can emit a wide range of colors. We show that commodity cameras can efficiently and accurately demodulate the color symbols. ColorBars ensures flicker-free and reliable communication even in the presence of inter-frame loss and diversity of rolling shutter cameras. We implement ColorBars on embedded platform and evaluate it with Android and iOS smartphones as receivers. Our evaluation shows that ColorBars can achieve a data rate of 5.2 Kbps on Nexus 5 and 2.5 Kbps on iPhone 5S, which is significantly higher than previous approaches. It is also shown that lower CSK modulations (e.g. 4 and 8 CSK) provide extremely low symbol error rates (< 10--3), making them a desirable choice for reliable LED-to-camera communication.
{"title":"ColorBars: increasing data rate of LED-to-camera communication using color shift keying","authors":"Pengfei Hu, P. Pathak, Xiaotao Feng, Hao Fu, P. Mohapatra","doi":"10.1145/2716281.2836097","DOIUrl":"https://doi.org/10.1145/2716281.2836097","url":null,"abstract":"LED-to-camera communication allows LEDs deployed for illumination purposes to modulate and transmit data which can be received by camera sensors available in mobile devices like smartphones, wearable smart-glasses etc. Such communication has a unique property that a user can visually identify a transmitter (i.e. LED) and specifically receive information from the transmitter. It can support a variety of novel applications such as augmented reality through mobile devices, navigation using smart signs, fine-grained location specific advertisement etc. However, the achievable data rate in current LED-to-camera communication techniques remains very low (≈ 12 bytes per second) to support any practical application. In this paper, we present ColorBars, an LED-to-camera communication system that utilizes Color Shift Keying (CSK) to modulate data using different colors transmitted by the LED. It exploits the increasing popularity of Tri-LEDs (RGB) that can emit a wide range of colors. We show that commodity cameras can efficiently and accurately demodulate the color symbols. ColorBars ensures flicker-free and reliable communication even in the presence of inter-frame loss and diversity of rolling shutter cameras. We implement ColorBars on embedded platform and evaluate it with Android and iOS smartphones as receivers. Our evaluation shows that ColorBars can achieve a data rate of 5.2 Kbps on Nexus 5 and 2.5 Kbps on iPhone 5S, which is significantly higher than previous approaches. It is also shown that lower CSK modulations (e.g. 4 and 8 CSK) provide extremely low symbol error rates (< 10--3), making them a desirable choice for reliable LED-to-camera communication.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"11 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":"132524128","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}
Thomas Nitsche, Guillermo Bielsa, Irene Tejado, Adrian Loch, J. Widmer
The performance of current consumer-grade devices for 60 GHz wireless networks is limited. While such networks promise both high data rates and uncomplicated spatial reuse, we find that commercially available devices based on the WiHD and WiGig standards may suffer from their cost-effective design. Very similar mechanisms are used in upcoming devices based on the IEEE 802.11ad standard. Hence, understanding them well is crucial to improve the efficiency and performance of next generation millimeter wave networks. In this paper, we present the first in-depth beamforming, interference, and frame level protocol analysis of off-the-shelf millimeter wave systems with phased antenna arrays. We focus on (a) the interference due to the lack of directionality of consumer-grade antennas, and (b) the degree of data aggregation of current devices. Regarding (a), our beam pattern measurements show strong side lobes that challenge the common conception of high spatial reuse in 60 GHz networks. We also show that reflections in realistic settings worsen this effect. Further, we measure weak directionality when beamforming towards the boundary of the transmission area of an antenna array. Regarding (b), we observe that devices only aggregate data if connections require high bandwidth, thus increasing medium usage time otherwise.
{"title":"Boon and bane of 60 GHz networks: practical insights into beamforming, interference, and frame level operation","authors":"Thomas Nitsche, Guillermo Bielsa, Irene Tejado, Adrian Loch, J. Widmer","doi":"10.1145/2716281.2836102","DOIUrl":"https://doi.org/10.1145/2716281.2836102","url":null,"abstract":"The performance of current consumer-grade devices for 60 GHz wireless networks is limited. While such networks promise both high data rates and uncomplicated spatial reuse, we find that commercially available devices based on the WiHD and WiGig standards may suffer from their cost-effective design. Very similar mechanisms are used in upcoming devices based on the IEEE 802.11ad standard. Hence, understanding them well is crucial to improve the efficiency and performance of next generation millimeter wave networks. In this paper, we present the first in-depth beamforming, interference, and frame level protocol analysis of off-the-shelf millimeter wave systems with phased antenna arrays. We focus on (a) the interference due to the lack of directionality of consumer-grade antennas, and (b) the degree of data aggregation of current devices. Regarding (a), our beam pattern measurements show strong side lobes that challenge the common conception of high spatial reuse in 60 GHz networks. We also show that reflections in realistic settings worsen this effect. Further, we measure weak directionality when beamforming towards the boundary of the transmission area of an antenna array. Regarding (b), we observe that devices only aggregate data if connections require high bandwidth, thus increasing medium usage time otherwise.","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":"114160816","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}
Huazhe Wang, Chen Qian, Ye Yu, Hongkun Yang, S. Lam
Identifying the network-wide forwarding behaviors of a packet is essential for many network management applications, including rule verification, policy enforcement, attack detection, traffic engineering, and fault localization. Current tools that can perform packet behavior identification either incur large time and memory costs or do not support real-time updates. In this paper we present AP Classifier, a control plane tool for packet behavior identification. AP Classifier is developed based on the concept of atomic predicates which can be used to characterize the forwarding behaviors of packets. Experiments using the data plane network state of two real networks show that the processing speed of AP Classifier is faster than existing tools by at least an order of magnitude. Furthermore, AP Classifier uses very small memory and is able to support real-time updates.
{"title":"Practical network-wide packet behavior identification by AP classifier","authors":"Huazhe Wang, Chen Qian, Ye Yu, Hongkun Yang, S. Lam","doi":"10.1145/2716281.2836095","DOIUrl":"https://doi.org/10.1145/2716281.2836095","url":null,"abstract":"Identifying the network-wide forwarding behaviors of a packet is essential for many network management applications, including rule verification, policy enforcement, attack detection, traffic engineering, and fault localization. Current tools that can perform packet behavior identification either incur large time and memory costs or do not support real-time updates. In this paper we present AP Classifier, a control plane tool for packet behavior identification. AP Classifier is developed based on the concept of atomic predicates which can be used to characterize the forwarding behaviors of packets. Experiments using the data plane network state of two real networks show that the processing speed of AP Classifier is faster than existing tools by at least an order of magnitude. Furthermore, AP Classifier uses very small memory and is able to support real-time updates.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"58 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":"125097204","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, Ori Rottenstreich, Sanjay G. Rao, J. Rexford
In enterprise networks, policies (e.g., QoS or security) are often defined based on the categorization of hosts along dimensions such as the organizational role of the host (faculty vs. student), and department (engineering vs. sales). While current best practices (VLANs) help when hosts are categorized along a single dimension, policy may often need to be expressed along multiple orthogonal dimensions. In this paper, we make three contributions. First, we argue for Attribute-Carrying IPs (ACIPs), where the IP address allocation process in enterprises considers attributes of a host along all policy dimensions. ACIPs enable flexible policy specification in a manner that may not otherwise be feasible owing to the limited size of switch rule-tables. Second, we present Alpaca, algorithms for realizing ACIPs under practical constraints of limited-length IP addresses. Our algorithms can be applied to different switch architectures, and we provide bounds on their performance. Third, we demonstrate the importance and viability of ACIPs on data collected from real campus networks.
{"title":"Alpaca: compact network policies with attribute-carrying addresses","authors":"Nanxi Kang, Ori Rottenstreich, Sanjay G. Rao, J. Rexford","doi":"10.1145/2716281.2836092","DOIUrl":"https://doi.org/10.1145/2716281.2836092","url":null,"abstract":"In enterprise networks, policies (e.g., QoS or security) are often defined based on the categorization of hosts along dimensions such as the organizational role of the host (faculty vs. student), and department (engineering vs. sales). While current best practices (VLANs) help when hosts are categorized along a single dimension, policy may often need to be expressed along multiple orthogonal dimensions. In this paper, we make three contributions. First, we argue for Attribute-Carrying IPs (ACIPs), where the IP address allocation process in enterprises considers attributes of a host along all policy dimensions. ACIPs enable flexible policy specification in a manner that may not otherwise be feasible owing to the limited size of switch rule-tables. Second, we present Alpaca, algorithms for realizing ACIPs under practical constraints of limited-length IP addresses. Our algorithms can be applied to different switch architectures, and we provide bounds on their performance. Third, we demonstrate the importance and viability of ACIPs on data collected from real campus networks.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"90 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":"121326503","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
扫码关注我们
求助内容：
应助结果提醒方式：