Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies最新文献

P-Rex: fast verification of MPLS networks with multiple link failures P-Rex:支持MPLS网络多链路故障的快速验证

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281432

Jesper Stenbjerg Jensen, Troels Beck Krøgh, J. Madsen, S. Schmid, J. Srba, Marc Tom Thorgersen

{"title":"P-Rex: fast verification of MPLS networks with multiple link failures","authors":"Jesper Stenbjerg Jensen, Troels Beck Krøgh, J. Madsen, S. Schmid, J. Srba, Marc Tom Thorgersen","doi":"10.1145/3281411.3281432","DOIUrl":"https://doi.org/10.1145/3281411.3281432","url":null,"abstract":"Future communication networks are expected to be highly automated, disburdening human operators of their most complex tasks. However, while first powerful and automated network analysis tools are emerging, existing tools provide only limited (and inefficient) support of reasoning about failure scenarios. We present P-Rex, a fast what-if analysis tool, that allows us to test important reachability and policy-compliance properties even under an arbitrary number of failures, in polynomial-time, i.e., without enumerating all failure scenarios (the usual approach today, if supported at all). P-Rex targets networks based on Multiprotocol Label Switching (MPLS) and its Segment Routing (SR) extension and comes with an expressive query language based on regular expressions. It takes into account the actual router tables, and is hence well-suited for debugging. We also report on an industrial case study and demonstrate that P-Rex supports rich queries, performing what-if analyses in less than 70 minutes in most cases, in a 24-router network with over 100,000 MPLS forwarding rules.","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122967630","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}

引用次数: 32

DenseVLC

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281423

Jona Beysens, Ander Galisteo, Qing Wang, Diego Juara, D. Giustiniano, S. Pollin

{"title":"DenseVLC","authors":"Jona Beysens, Ander Galisteo, Qing Wang, Diego Juara, D. Giustiniano, S. Pollin","doi":"10.1145/3281411.3281423","DOIUrl":"https://doi.org/10.1145/3281411.3281423","url":null,"abstract":"LED luminaries are now deployed densely in indoor areas to provide uniform illumination. Visible Light Communication (VLC) can also benefit from this dense LED infrastructure. In this paper, we propose DenseVLC, a cell-free massive MIMO system enabled by densely distributed LEDs, that forms different beamspots to serve multiple receivers simultaneously. Given a power budget for communication, DenseVLC can optimize the system throughput by properly assigning the power budget among the distributed LEDs. We formulate an optimization problem to derive the optimal policy for the power allocation. Our insights from the optimal policies allow us to simplify DenseVLC's system design and propose a heuristic algorithm that can reduce the complexity by 99.96%. Besides, we propose a novel synchronization method using non-line-of-sight VLC to synchronize all the transmitters that will form a beamspot to serve the same receiver. We implement DenseVLC with off-the-shelf devices, solve practical challenges in the system design, and evaluate it with extensive and realistic experiments in a system of 36 transmitters and 4 receivers in an area of 3 m x 3 m. Our results show that DenseVLC can improve the average system throughput by 45%, or improve the average power efficiency by 2.3 times, while maintaining the requirement for uniform illumination.","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114173538","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}

引用次数: 6

P4Visor

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281436

Peng Zheng, Theophilus A. Benson, Chengchen Hu

{"title":"P4Visor","authors":"Peng Zheng, Theophilus A. Benson, Chengchen Hu","doi":"10.1145/3281411.3281436","DOIUrl":"https://doi.org/10.1145/3281411.3281436","url":null,"abstract":"Programmable data planes, PDPs, enable an unprecedented level of flexibility and have emerged as a promising alternative to existing data planes. Despite the rapid development and prototyping cycles that PDPs promote, the existing PDP ecosystem lacks appropriate abstractions and algorithms to support these rapid testing and deployment life-cycles. In this paper, we propose P4Visor, a lightweight virtualization abstraction that provides testing primitives as a first-order citizen of the PDP ecosystem. P4Visor can efficiently support multiple PDP programs through a combination of compiler optimizations and program analysis-based algorithms. P4Visor s algorithm improves over state-of-the-art techniques by significantly reducing the resource overheads associated with embedding numerous versions of a PDP program into hardware. To demonstrate the efficiency and viability of P4Visor, we implemented and evaluated P4Visor on both a software switch and an FPGA-based hardware switch using fourteen different PDP programs. Our results demonstrate that P4Visor introduces minimal overheads (less than 1%) and is one order of magnitude more efficient than existing PDPs primitives for concurrently supporting multiple programs.","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128537476","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}

引用次数: 5

Wireless CSI-based head tracking in the driver seat 在驾驶座上安装了基于犯罪现场调查系统的无线头部追踪系统

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281414

Xiufeng Xie, K. Shin, Hamed Yousefi, Suining He

{"title":"Wireless CSI-based head tracking in the driver seat","authors":"Xiufeng Xie, K. Shin, Hamed Yousefi, Suining He","doi":"10.1145/3281411.3281414","DOIUrl":"https://doi.org/10.1145/3281411.3281414","url":null,"abstract":"In recent years, augmented reality (AR) has drawn significant attention in the automotive industry and shown great potential for a variety of driver-assistance applications. Tracking the driver's head is vital to seamlessly merge the AR content in the driver's view but still remains an open problem. Specifically, most existing in-vehicle AR solutions rely on cameras for head tracking, which suffer from low sampling rate, weak performance at night, and even high computation costs. Wearing a dedicated headset, on the other hand, is intrusive and inconvenient for daily driving. To overcome these limitations, we propose ViHOT, a novel wireless CSI-based predictive & device-free head tracking system for in-vehicle use. Given that drivers usually mount phones on the dashboard for navigation, ViHOT leverages the CSI of the phone's WiFi signal to track the driver's head, with a light-weight design suited for real-time driving assistance. Thanks to the high WiFi frame rate, ViHOT achieves more than 10x sampling rate over conventional camera-based approaches and thus eliminates motion blur. Moreover, ViHOT's novel tracking algorithm accurately translates CSI phase readings to head orientations (merely 4° -10° median error) without relying on any head-mounted device.","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129915770","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}

引用次数: 22

REINFORCE: achieving efficient failure resiliency for network function virtualization based services 强化:为基于网络功能虚拟化的服务实现有效的故障恢复能力

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281441

Sameer G. Kulkarni, Guyue Liu, K. Ramakrishnan, M. Arumaithurai, Timothy Wood, Xiaoming Fu

{"title":"REINFORCE: achieving efficient failure resiliency for network function virtualization based services","authors":"Sameer G. Kulkarni, Guyue Liu, K. Ramakrishnan, M. Arumaithurai, Timothy Wood, Xiaoming Fu","doi":"10.1145/3281411.3281441","DOIUrl":"https://doi.org/10.1145/3281411.3281441","url":null,"abstract":"Ensuring high availability (HA) for software-based networks is a critical design feature that will help the adoption of software-based network functions (NFs) in production networks. It is important for NFs to avoid outages and maintain mission-critical operations. However, HA support for NFs on the critical data path can result in unacceptable performance degradation. We present REINFORCE, an integrated framework to support efficient resiliency for NFs and NF service chains. REINFORCE includes timely failure detection and consistent failover mechanisms. REINFORCE replicates state to standby NFs (local and remote) while enforcing correctness. It minimizes the number of state transfers by exploiting the concept of external synchrony, and leverages opportunistic batching and multi-buffering to optimize performance. Experimental results show that, even at line-rate packet processing (10 Gbps), REINFORCE achieves chain-level failover across servers in a LAN (or within the same node) within 10ms (100/μs), incurring less than 10% (1%) performance overhead, and adds average latency of only ~400/μs (5/μs), with a worst-case latency of less than 1ms (10/μs).","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"16 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130133708","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}

引用次数: 45

Robustly disjoint paths with segment routing 具有分段路由的鲁棒不相交路径

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281424

François Aubry, Stefano Vissicchio, O. Bonaventure, Y. Deville

引用次数: 17

Scylla “锡拉”

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281412

Hassan Iqbal, Muhammad Hamad Alizai, I. Qazi, O. Landsiedel, Z. Uzmi

引用次数: 6

The eXpress data path: fast programmable packet processing in the operating system kernel eXpress数据路径:操作系统内核中的快速可编程数据包处理

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281443

Toke Høiland-Jørgensen, J. D. Brouer, Daniel Borkmann, John Fastabend, T. Herbert, David Ahern, David Miller

{"title":"The eXpress data path: fast programmable packet processing in the operating system kernel","authors":"Toke Høiland-Jørgensen, J. D. Brouer, Daniel Borkmann, John Fastabend, T. Herbert, David Ahern, David Miller","doi":"10.1145/3281411.3281443","DOIUrl":"https://doi.org/10.1145/3281411.3281443","url":null,"abstract":"Programmable packet processing is increasingly implemented using kernel bypass techniques, where a userspace application takes complete control of the networking hardware to avoid expensive context switches between kernel and userspace. However, as the operating system is bypassed, so are its application isolation and security mechanisms; and well-tested configuration, deployment and management tools cease to function. To overcome this limitation, we present the design of a novel approach to programmable packet processing, called the eXpress Data Path (XDP). In XDP, the operating system kernel itself provides a safe execution environment for custom packet processing applications, executed in device driver context. XDP is part of the mainline Linux kernel and provides a fully integrated solution working in concert with the kernel's networking stack. Applications are written in higher level languages such as C and compiled into custom byte code which the kernel statically analyses for safety, and translates into native instructions. We show that XDP achieves single-core packet processing performance as high as 24 million packets per second, and illustrate the flexibility of the programming model through three example use cases: layer-3 routing, inline DDoS protection and layer-4 load balancing.","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130264411","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}

引用次数: 228

Workload adaptive flow scheduling 工作负载自适应流调度

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281429

Abdullah Bin Faisal, Hafiz Mohsin Bashir, I. Qazi, Z. Uzmi, Fahad R. Dogar

{"title":"Workload adaptive flow scheduling","authors":"Abdullah Bin Faisal, Hafiz Mohsin Bashir, I. Qazi, Z. Uzmi, Fahad R. Dogar","doi":"10.1145/3281411.3281429","DOIUrl":"https://doi.org/10.1145/3281411.3281429","url":null,"abstract":"Existing flow scheduling schemes for data center networks optimize for a specific workload and performance metric. In this paper, we present 2D, a new scheduling policy that offers robustness across performance metrics and changing workloads - a ground existing scheduling policies are unable to cover. 2D combines basic scheduling building blocks of multiplexing and serialization in a principled way, ensuring tail optimal performance across workloads while also improving the average (and lower percentiles) completion times. To implement 2D for flow-level scheduling in a distributed setting, we break-up the scheduling decision into two parts: coarse time-scale decisions based on workload and load changes are made by a centralized controller while per-flow serialization decisions are made in a distributed fashion, involving the end-points and sequencer(s). Our testbed experiments show that, for realistic cloud workloads, 2D provides consistent gains at the tail and average flow completion times compared to basic scheduling techniques (e.g., FIFO and processor sharing) as well as heuristic-based schedulers (e.g., Aalo and Baraat).","PeriodicalId":384586,"journal":{"name":"Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125072361","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}

引用次数: 8

Proteus 普罗透斯

Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies Pub Date : 2018-12-04 DOI: 10.1145/3281411.3281422

J. Ren, Xiaoming Wang, Jianbin Fang, Yansong Feng, Dongxiao Zhu, Zhunchen Luo, Jie Zheng, Zheng Wang

引用次数: 23