F. Bronzino, C. Han, Yang Chen, K. Nagaraja, Xiaowei Yang, I. Seskar, D. Raychaudhuri
{"title":"In-Network Compute Extensions for Rate-Adaptive Content Delivery in Mobile Networks","authors":"F. Bronzino, C. Han, Yang Chen, K. Nagaraja, Xiaowei Yang, I. Seskar, D. Raychaudhuri","doi":"10.1109/ICNP.2014.81","DOIUrl":"https://doi.org/10.1109/ICNP.2014.81","url":null,"abstract":"Traffic from mobile wireless networks has been growing at a fast pace in recent years and is expected to surpass wired traffic very soon. Service providers face significant challenges at such scales including providing seamless mobility, efficient data delivery, security, and provisioning capacity at the wireless edge. In the Mobility First project, we have been exploring clean slate enhancements to the network protocols that can inherently provide support for at-scale mobility and trustworthiness in the Internet. An extensible data plane using pluggable compute-layer services is a key component of this architecture. We believe these extensions can be used to implement in-network services to enhance mobile end-user experience by either off-loading work and/or traffic from mobile devices, or by enabling en-route service-adaptation through context-awareness (e.g., Knowing contemporary access bandwidth). In this work we present details of the architectural support for in-network services within Mobility First, and propose protocol and service-API extensions to flexibly address these pluggable services from end-points. As a demonstrative example, we implement an in network service that does rate adaptation when delivering video streams to mobile devices that experience variable connection quality. We present details of our deployment and evaluation of the non-IP protocols along with compute-layer extensions on the GENI test bed, where we used a set of programmable nodes across 7 distributed sites to configure a Mobility First network with hosts, routers, and in-network compute services.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126039608","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}
Luke McHale, C. Casey, Paul V. Gratz, A. Sprintson
{"title":"Stochastic Pre-classification for SDN Data Plane Matching","authors":"Luke McHale, C. Casey, Paul V. Gratz, A. Sprintson","doi":"10.1109/ICNP.2014.95","DOIUrl":"https://doi.org/10.1109/ICNP.2014.95","url":null,"abstract":"The Software Defined Networking (SDN) approach has numerous advantages, including the ability to program the network through simple abstractions, provide a centralized view of network state, and respond to changing network conditions. One of the main challenges in designing SDN enabled switches is efficient packet classification in the data plane. As the complexity of SDN applications increases, the data plane becomes more susceptible to Denial of Service (DoS) attacks, which can result in increased delays and packet loss. Accordingly, there is a strong need for network architectures that operate efficiently in the presence of malicious traffic. In particular, there is a need to protect authorized flows from DoS attacks. In this work we utilize a probabilistic data structure to pre-classify traffic with the aim of decoupling likely legitimate traffic from malicious traffic by leveraging the locality of packet flows. We validate our approach by examining a fundamental SDN application: software defined network firewall. For this application, our architecture dramatically reduces the impact of unknown/malicious flows on established/legitimate flows. We explore the effect of stochastic pre-classification in prioritizing data plane classification. We show how pre-classification can be used to increase the effective Quality of Service (QoS) for established flows and reduce the impact of adversarial traffic.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127048230","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}
{"title":"Virtual Duplex: Scaling Dense WLANS and Eliminating Contention Asymmetry","authors":"Adriana B. Flores, E. Knightly","doi":"10.1109/ICNP.2014.96","DOIUrl":"https://doi.org/10.1109/ICNP.2014.96","url":null,"abstract":"In this paper, we propose \"Virtual Duplex,\" a wireless architecture which, like Frequency Division Duplex (FDD), divides spectrum resources into two sub-bands. However, in contrast to FDD, both bands in Virtual Duplex are physically bidirectional, and transmissions are allocated to the bands according to whether they correspond to download or upload traffic. The \"download data channel\" carries data originating from the AP and that data's associated reversed-direction acknowledgements, and vice-versa for the \"upload data channel.\" Thus, Virtual Duplex separates upload and download traffic at the link layer so that MAC layer Data-ACK handshakes are allocated into one of the two (physical) independent and asynchronous bi-directional channels. The spectrum division can be equal (as is typical with FDD) or weighted with a configurable bandwidth allocated to each channel to guarantee a spectrum share independent of client density. We show that the logical division and spectrum isolation between upload and download Data-ACK handshakes increases spectral efficiency, eliminates contention asymmetry and provides scalability to traffic asymmetry. Experimental and simulation results demonstrate that Virtual Duplex matches download vs. Upload throughput to demand ratio within 1% under any client density and traffic load. This matching capability offers unbounded download gains as congestion increases, minimizing and in some cases eliminating retransmissions and contention time.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115227117","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}
J. Elias, F. Martignon, Stefano Paris, Jianping Wang
{"title":"Optimization Models for Congestion Mitigation in Virtual Networks","authors":"J. Elias, F. Martignon, Stefano Paris, Jianping Wang","doi":"10.1109/ICNP.2014.70","DOIUrl":"https://doi.org/10.1109/ICNP.2014.70","url":null,"abstract":"Virtualization of network functions and services can significantly reduce capital and operational expenditures of telecommunication operators through the sharing of a single network infrastructure. However, the utilization of the same resources can increase their congestion due to the spatio-temporal correlation of traffic demands and computational loads. In this paper, we propose novel orchestration mechanisms to optimally control and reduce the resource congestion of a physical infrastructure based on the NFV paradigm. In particular, we formulate the network functions composition problem as a nonlinear optimization model to accurately capture the congestion of the physical resources. In order to meet both efficiency and load balancing goals of the physical operator, we introduce two variants of such model to minimize the total and the maximum congestion in the network. Our models allow us to efficiently compute the optimal solution in a short computing time. Numerical results, obtained with real ISP topologies and network instances, show that the proposed approach represents an efficient and practical solution to control the congestion in virtual networks. Furthermore, they indicate that a holistic approach that optimizes the virtual system by jointly considering all elements/components would further improve the performance.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115363388","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}
{"title":"An OpenFlow-Based Prototype of SDN-Oriented Stateful Hardware Firewalls","authors":"J. Collings, Jun Liu","doi":"10.1109/ICNP.2014.83","DOIUrl":"https://doi.org/10.1109/ICNP.2014.83","url":null,"abstract":"This paper describes an Open Flow-based prototype of a SDN-oriented stateful hardware firewall. The prototype of a SDN-oriented stateful hardware firewall includes an Open Flow-enabled switch and a firewall controller. The security rules are specified in the flow table in both the Open Flow-enabled switch and the firewall controller. The firewall controller is in charge of making control decisions on regulating the unidentified traffic flows. A communication channel is needed between a firewall controller and an Open Flow enabled switch. Through this channel, a switch sends to the controller with the information of unidentified flows, and the controller sends to the switch with the control decisions. Constraining this communication overhead is important to the applicability of the prototype because a high communication overhead could disturb the performance evaluation on the operation of a SDN-oriented stateful hardware firewall.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442442","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}
Jinsong Han, H. Ding, Chen Qian, Dan Ma, Wei Xi, Zhi Wang, Zhiping Jiang, Longfei Shangguan
{"title":"CBID: A Customer Behavior Identification System Using Passive Tags","authors":"Jinsong Han, H. Ding, Chen Qian, Dan Ma, Wei Xi, Zhi Wang, Zhiping Jiang, Longfei Shangguan","doi":"10.1109/ICNP.2014.26","DOIUrl":"https://doi.org/10.1109/ICNP.2014.26","url":null,"abstract":"Different from online shopping, in-store shopping has few ways to collect the customer behaviors before purchase. In this paper, we present the design and implementation of an on-site Customer Behavior Identification system based on passive RFID tags, named CBID. By collecting and analyzing wireless signal features, CBID can detect and track tag movements and further infer corresponding customer behaviors. We model three main objectives of behavior identification by concrete problems and solve them using novel protocols and algorithms. The design innovations of this work include a Doppler effect based protocol to detect tag movements, an accurate Doppler frequency estimation algorithm, a multi-RSS based tag localization protocol, and a tag clustering algorithm using cosine similarity. We have implemented a prototype of CBID in which all components are built by off-the-shelf devices. We have deployed CBID in real environments and conducted extensive experiments to demonstrate the accuracy and efficiency of CBID in customer behavior identification.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965286","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}
{"title":"Semi-synchronous Channel Access for Full-Duplex Wireless Networks","authors":"Xiufeng Xie, Xinyu Zhang","doi":"10.1109/ICNP.2014.41","DOIUrl":"https://doi.org/10.1109/ICNP.2014.41","url":null,"abstract":"Full-duplex radios are often envisioned to double wireless link capacity. Substantial work has focused on redesigning the radio hardware to achieve this theoretical gain. From a network-protocol perspective, however, it remains an open problem how to exploit full-duplex radio, and how much gain it can achieve in practical multi-cell wireless LANs. In this paper, we propose FuMAC, a channel access protocol tailored for full-duplex radios to optimally exploit their unique capabilities. FuMAC addresses a unique trade off between PHY-layer full duplex transmission and MAC-level spatial reuse, through a semi synchronous channel access principle. Its design is enabled by a novel self-interference cancellation mechanism called Active Antenna Cancellation. We verify FuMAC using software-radio implementation combined with large scale simulation. The results demonstrate that conventional MAC protocols severely underutilize full-duplex's potential. In contrast, FuMAC can achieve more-than-doubled throughput gain over half-duplex wireless LANs and significantly outperform alternative full-duplex MAC designs, while maintaining a much higher level of fairness.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133142042","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}
{"title":"Disincentivizing/Incentivizing Malicious/Honest Behavior on the Internet via Privacy-Preserving Appcoins","authors":"Karim M. El Defrawy, Joshua Lampkins","doi":"10.1109/ICNP.2014.100","DOIUrl":"https://doi.org/10.1109/ICNP.2014.100","url":null,"abstract":"In this paper we argue that privacy-preserving digital coins with low computation and communication overhead can be utilized as micropayments to harden online applications and services. We call such digital coins App Coins, and the applications that use them App Coins-hardened applications. Our thesis is that App Coins-hardened applications can greatly increase the financial cost (to the attackers) of large classes of malicious behavior on the Internet. App Coins can also be used to incentivize and reward cooperative and honest online behavior. We develop cryptographic protocols for such privacy-preserving non-malleable and double-spending resistant App Coins. We show how to modify two sample applications, email and onion routing, to utilize such App Coins. Our performance analysis demonstrates that our protocols are practical and can be easily implemented using commodity hardware.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131875274","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}
{"title":"Polylogarithmic Competitive Algorithm for Energy Minimization in Optical WDM Networks","authors":"Yangguang Shi, Fa Zhang, Zhiyong Liu","doi":"10.1109/ICNP.2014.39","DOIUrl":"https://doi.org/10.1109/ICNP.2014.39","url":null,"abstract":"We study the energy minimization problem (EMP) in the optical WDM networks with arbitrary topologies. It is assumed that the traffic requests can arrive at and depart from the network arbitrarily, and idle network devices can be dynamically switched off to save energy. For each traffic request R, we need to specify a wavelength λR and a fiber in each link along its path to carry λR. The objective is to minimize the energy consumption incurred by the active devices over the entire network for any time period [0, t]. In this paper, a randomized online algorithm is proposed for EMP. Particularly, for each traffic request, our algorithm only needs O(1)-time to determine the wavelength, and the fiber allocation procedure can be performed in a fully distributed manner in each link with polynomial time. The competitive ratio of our algorithm is bounded by O(log μ · log hmax), where μ represents the number of wavelengths carried by each fiber and hmax represents the holding time of the longest traffic request.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793539","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. Dua, Thai Bui, Tien Le, N. Huynh, Wu-chang Feng
{"title":"MetaCAPTCHA: A Metamorphic Throttling Service for the Web","authors":"A. Dua, Thai Bui, Tien Le, N. Huynh, Wu-chang Feng","doi":"10.1109/ICNP.2014.106","DOIUrl":"https://doi.org/10.1109/ICNP.2014.106","url":null,"abstract":"Spam is a problem that refuses to go away. An immense amount of time and money is currently devoted to hiding spam, but not enough is devoted to effectively preventing it. CAPTCHAs are a prevalent spam prevention mechanism, but are getting harder for humans to solve and easier for programs to \"break\". CAPTCHAs also cannot prevent spam from hijacked accounts since they are mostly used during account creation. Proof-of-work approaches are gaining popularity, but current implementations are not effective enough and cannot be used by generic web applications. We present MetaCAPTCHA, an application-agnostic spam prevention service for web applications. MetaCAPTCHA dynamically issues CAPTCHAs and proof-of-work \"puzzles\" while ensuring that more malicious users solve \"harder\" puzzles. In order to support its operation, MetaCAPTCHA implements a novel secure protocol -- for authenticating web sites and validating proof-of-work solutions -- that allows for seamless integration across a variety of web applications.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"557 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133419081","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}