Benoit Pit-Claudel, Yoann Desmouceaux, P. Pfister, M. Townsley, T. Clausen
{"title":"Stateless Load-Aware Load Balancing in P4","authors":"Benoit Pit-Claudel, Yoann Desmouceaux, P. Pfister, M. Townsley, T. Clausen","doi":"10.1109/icnp.2018.00058","DOIUrl":"https://doi.org/10.1109/icnp.2018.00058","url":null,"abstract":"Leveraging the performance opportunities offered by programmable hardware, stateless load-balancing architectures allowing line-rate processing are appealing. Moreover, it has been demonstrated that significantly fairer load-balancing can be achieved by an architecture that considers the actual load of application instances when dispatching connection requests. Architectures which maintain per-connection state for resiliency and/or track application load state for fairness are, however, at odds with hardware-imposed memory constraints. Thus, a desirable load-balancer for programmable hardware would be both stateless and able to dispatch queries to application instances according to their current load. This paper presents SHELL, a stateless application-aware load-balancer combining (i) a power-of-choices scheme using IPv6 Segment Routing to dispatch new flows to a suitable application instance from among multiple candidates, and (ii) the use of a covert channel to record/report which flow was assigned to which candidate in a stateless fashion. In addition, consistent hashing versioning is used to ensure that connections are maintained to the correct application instance, using Segment Routing to \"browse\" through the history when needed. The stateless design of SHELL makes it suitable for hardware implementation, and this paper describes the implementation of a P4-NetFPGA prototype. A performance evaluation of this SHELL implementation demonstrates throughput and latency characteristics comparable to other stateless load-balancing implementations, while enabling application instance-load-aware dispatching and significantly increasing per-connection consistency resiliency.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594774","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":"pcube: Primitives for Network Data Plane Programming","authors":"Rinku Shah, Aniket Shirke, Akash Trehan, Mythili Vutukuru, Purushottam Kulkarni","doi":"10.1109/ICNP.2018.00060","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00060","url":null,"abstract":"P4 is a domain specific language to configure packet processing pipelines in programmable dataplane switches, and is a powerful idea towards realizing the goal of flexible software-defined networks. This paper presents pcube, a framework that provides a set of primitives to simplify the development of P4-based dataplane applications. pcube provides primitives for loops, summations, and other common operations on indexed state variables, which can be embedded within P4 code and unrolled by the pcube preprocessor. pcube also provides primitives to synchronize state variables across switches in distributed dataplane applications, which are automatically translated into P4 code to send and receive synchronization messages across multiple switches by pcube. We build example dataplane applications such as a distributed load balancer in our framework, and show that using pcube reduces the programming effort (in term of lines of code) significantly—by a factor of up to 5.4x.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124172953","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":"Sybil Detection in Social-Activity Networks: Modeling, Algorithms and Evaluations","authors":"Xiaoying Zhang, Hong Xie, John C.S. Lui","doi":"10.1109/ICNP.2018.00015","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00015","url":null,"abstract":"Detecting fake accounts (sybils) in online social networks (OSNs) is vital to protect OSN operators and their users from various malicious activities. Typical graph-based sybil detection (a mainstream methodology) assumes that sybils can make friends with only a limited (or small) number of honest users. However, recent evidences showed that this assumption does not hold in real-world OSNs, leading to low detection accuracy. To address this challenge, we explore users' activities to assist sybil detection. The intuition is that honest users are much more selective in choosing who to interact with than to befriend with. We first develop the social and activity network (SAN), a two-layer hyper-graph that unifies users' friendships and their activities, to fully utilize users' activities. We also propose a more practical sybil attack model, where sybils can launch both friendship attacks and activity attacks. We then design Sybil SAN to detect sybils via coupling three random walk-based algorithms on the SAN, and prove the convergence of Sybil SAN. We develop an efficient iterative algorithm to compute the detection metric for Sybil SAN, and derive the number of rounds needed to guarantee the convergence. We use \"matrix perturbation theory\" to bound the detection error when sybils launch many friendship attacks and activity attacks. Extensive experiments on both synthetic and real-world datasets show that Sybil SAN is highly robust against sybil attacks, and can detect sybils accurately under practical scenarios, where current state-of-art sybil defenses have low accuracy.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126624154","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":"Cuttlefish: Hierarchical SDN Controllers with Adaptive Offload","authors":"Rinku Shah, Mythili Vutukuru, Purushottam Kulkarni","doi":"10.1109/ICNP.2018.00029","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00029","url":null,"abstract":"Offloading computation to local controllers (closer to switches) has been a popular approach to designing scalable SDN controllers. We observe that, in addition to the offload of local switch-specific state, a subset of global state can also be offloaded to, and accessed at local controllers with suitable synchronization. We present the design and implementation of Cuttlefish, an SDN controller framework that adaptively offloads a portion of the application state (and computation) to local controllers. Cuttlefish uses developer-specified input to identify control messages that can be correctly processed at local controllers, and makes offloading decisions based on the cost of synchronizing the offloaded state across controllers. SDN applications use the Cuttlefish API to access the offloaded state, and Cuttlefish transparently manages the state synchronization, and redirection of control messages to the appropriate (central or local) controller. We have implemented Cuttlefish using the Floodlight SDN controller. Our evaluation shows that Cuttlefish applications achieve ~2X higher control plane throughput and ~50% lower control plane latency as compared to the traditional SDN design.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126965325","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}
Ahmed Saeed, M. Ammar, E. Zegura, Khaled A. Harras
{"title":"If you can't Beat Them, Augment Them: Improving Local WiFi with Only Above-Driver Changes","authors":"Ahmed Saeed, M. Ammar, E. Zegura, Khaled A. Harras","doi":"10.1109/ICNP.2018.00053","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00053","url":null,"abstract":"The basic MAC mechanisms in IEEE 802.11 (WiFi) have remained largely unchanged for over 20 years. In this paper, we argue that the prevalence of WiFi makes it almost impossible to improve its performance through changes that require modifying hardware, firmware, or drivers. New applications, however, continue to exert novel performance demands. We suggest that changes should be developed as augmentation-only solutions through above-driver, kernel-level software modifications. An augmentation-only solution needs to maintain inter-operability and afford transparency in performance to existing WiFi devices, as well as enable minimum overhead upgradability. Our goal is to demonstrate the feasibility of MAC augmentation according to these principles. To this end, we leverage soft scheduling, where nodes are asked for a best-effort attempt to adhere to a given schedule. We allow the soft scheduler to coexist with and work at a different time scale from WiFi's Distributed Coordination Function (DCF); allowing it to reduce the time nodes spend contending for the medium while allowing DCF to handle only missed schedule slots and schedule divergence. We present a new Soft Token Passing Protocol (STPP) as an instance of this family of Soft Scheduling Protocols. We then show how STPP can be made part of a MAC protocol with specific performance improvement goals by developing the Wireless Low-Latency Local Links (WL4) system. We evaluate WL4 on a five node microbenchmark and quantify the system's overhead on network throughput and latency. We show that soft scheduling, via STPP, enables WL4 to adhere to our augmentation principles while improving the latency within the system.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124232257","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}
Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, David Yakira
{"title":"A Fair Consensus Protocol for Transaction Ordering","authors":"Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, David Yakira","doi":"10.1109/ICNP.2018.00016","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00016","url":null,"abstract":"We present Helix, a blockchain-based consensus protocol for fair ordering of transactions among nodes in a distributed network. Helix advances in rounds, where in each round, the primary node (elected among the network nodes) proposes a potential block (a successive set of transactions). In order to be included in the blockchain, a block must pass validation by an elected committee of nodes. Helix nodes are presumed to have two primary preferences. They prefer to be elected as committee members. Additionally, because each transaction is associated with one of the network nodes, they prefer to prioritize their own transactions over those of others. In light of these individual preferences, our definition of fairness incorporates three key elements. First, the process of electing nodes to committees is random and unpredictable. Second, a correlated sampling scheme is used in order to guarantee random selection and ordering of pending transactions in blocks. Third, transactions are encrypted in order to hide their associations with their respective nodes and prevent censorship. Through the corresponding threshold decryption process we obtain an unpredictable and non-manipulable randomness beacon, which serves both the election process and the correlated sampling scheme. We define a quantitative measure of fairness in the protocol, prove theoretically that fairness manipulation in Helix is significantly limited, and present experiments evaluating fairness in practice.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125774345","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}
Zhengzheng Liu, J. Bi, Yu Zhou, Yangyang Wang, Yunsenxiao Lin
{"title":"NetVision: Towards Network Telemetry as a Service","authors":"Zhengzheng Liu, J. Bi, Yu Zhou, Yangyang Wang, Yunsenxiao Lin","doi":"10.1109/ICNP.2018.00036","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00036","url":null,"abstract":"In-band Network Telemetry (INT) can provide fine-grained and accurate device-level telemetry metrics. Nonetheless, INT can track only a small ratio of devices and links and embedding telemetry data into normal packets brings high overhead and high operation complexity. Hence, we present NetVision, a powerful proactive network telemetry platform with high coverage and high scalability.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121405241","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":"Model-Less Approach of Network Traffic for Accurate Packet Loss Simulations","authors":"M. Terauchi, Kohei Watabe, K. Nakagawa","doi":"10.1109/ICNP.2018.00038","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00038","url":null,"abstract":"It is important to accurately model network traffic when we evaluate Quality of Service (QoS) of networks through simulations. However, for traffic in real networks, it is a tough task to select an appropriate traffic model and tune its parameters. Even if the accurate traffic modeling is achieved, it is also difficult to accurately estimate QoS regarding rare events, such as a packet loss rate in the modern Internet. In this paper, we propose a model-less approach to accurately estimate a packet loss rate through a simulation without directly modeling traffic including real network traffic. We also show the effectiveness of the approach in a simple queueing system as a first step in our development.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134565073","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":"Using P4 to Enable Scalable Intents in Software Defined Networks","authors":"B. Lewis, L. Fawcett, M. Broadbent, N. Race","doi":"10.1109/ICNP.2018.00064","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00064","url":null,"abstract":"When designing Software Defined Networks (SDNs), there is a risk that the additional abstractions available can result in reduced scalability and performance. One such abstraction, intents, are a way in which network administrators can express policies rather than having to define specific forwarding rules. This provides a benefit to administrators in allowing automatic network reconfiguration and fault tolerance. In this paper, we highlight the performance overheads associated with the intents framework from a popular SDN controller, ONOS. We propose a novel prototype that leverages source-based routing and programmable data planes using P4 in order to reduce the overheads of intent-based forwarding","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133851296","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":"Networking Support For Physical-Layer Cross-Technology Communication","authors":"Shuai Wang, Zhimeng Yin, Zhijun Li, T. He","doi":"10.1109/ICNP.2018.00042","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00042","url":null,"abstract":"Recent research on physical layer cross technology communication (PHY-CTC) brings a timely answer for escalated wireless coexistence and open spectrum movement. PHY-CTC achieves direct communication among heterogeneous wireless technologies (e.g.,WiFi, Bluetooth, and ZigBee) in physical layer and thus brings communication support for coexistence service such as spectrum management and IoT device control. To put PHY-CTC into service, however, there still exists a gap due to its transmission failure and asymmetric link (i.e., one-way PHYCTC) issues. In this paper, we propose NetCTC – the first networking support design for PHY-CTC to establish feedbacks (e.g., ACKs) and thus meet the upper layer networking requirements in heterogeneous unicast, multicast and broadcast. The core design of NetCTC is a real-time interaction mechanism which achieves reliable, transmission efficient and parallel interactive communication among heterogeneous devices. We implement and evaluate NetCTC on commodity devices (Laptops with Atheros AR2425 WiFi NIC, smart phones with Broadcom BCM4330 WiFi chip and MicaZ CC2420) and the USRP-N210 platform. Our extensive evaluation demonstrates that NetCTC achieves reliable bidirectional cross technology communication under a full range of wireless configurations including stationary, mobile and dutycycled settings.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257770","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}