2018 IEEE 26th International Conference on Network Protocols (ICNP)最新文献_第6页

Shifter: A Consistent Multicast Routing Update Scheme in Software-Defined Networks Shifter:软件定义网络中的一致组播路由更新方案

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00050

Guanhao Wu, Xiaofeng Gao, Tao Chen, Hao Zhou, L. Kong, Guihai Chen

{"title":"Shifter: A Consistent Multicast Routing Update Scheme in Software-Defined Networks","authors":"Guanhao Wu, Xiaofeng Gao, Tao Chen, Hao Zhou, L. Kong, Guihai Chen","doi":"10.1109/ICNP.2018.00050","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00050","url":null,"abstract":"Consistent routing update based on Software-Defined Networks (SDN) is a complicated problem due to the asynchronous and distributed data plane. Existing ordered update approaches mostly focus on the consistent routing update problem for unicast other than multicast, which should guarantee two consistencies, drop-freeness and duplicate-freeness. In this paper, we propose Shifter, a novel dynamic ordered update scheme for consistent multicast routing update based on SDN to guarantee both consistencies. Shifter advocates configuring inport match field in the forwarding rules to avoid duplicate. In order to guarantee drop-freeness, Shifter employs a dependency graph to dynamically schedule update operations, and uses a greedy solution to solve a subproblem named Replace Operation Tree Migration Problem (ROTMP). We conduct simulations to evaluate Shifter and find that Shifter can give a near optimal solution of ROTMP with very few rounds and little runtime for multicast routing update scenarios. To the best of our knowledge, Shifter is the first ordered update scheme to guarantee the two consistencies simultaneously.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"25 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":"133679381","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}

引用次数: 3

In Search of the Lost Nodes in BANs 寻找ban中丢失的节点

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00037

C. Michaelides, Maria Iloridou, F. Pavlidou

引用次数: 2

ICN Performance Enhancing Proxies for the Global Content Distribution 面向全局内容分发的ICN性能增强代理

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00039

Kazuaki Ueda, A. Tagami

引用次数: 2

Efficient Measurement on Programmable Switches Using Probabilistic Recirculation 基于概率再循环的可编程开关的有效测量

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-08-10 DOI: 10.1109/ICNP.2018.00047

R. Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich

{"title":"Efficient Measurement on Programmable Switches Using Probabilistic Recirculation","authors":"R. Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich","doi":"10.1109/ICNP.2018.00047","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00047","url":null,"abstract":"Programmable network switches promise flexibility and high throughput, enabling applications such as load balancing and traffic engineering. Network measurement is a fundamental building block for such applications, including tasks such as the identification of heavy hitters (largest flows) or the detection of traffic changes. However, high-throughput packet processing architectures place certain limitations on the programming model, such as restricted branching, limited capability for memory access, and a limited number of processing stages. These limitations restrict the types of measurement algorithms that can run on programmable switches. In this paper, we focus on the RMT programmable high-throughput switch architecture, and carefully examine its constraints on designing measurement algorithms. We demonstrate our findings while solving the heavy hitter problem. We introduce PRECISION, an algorithm that uses Probabilistic Recirculation to find top flows on a programmable switch. By recirculating a small fraction of packets, PRECISION simplifies the access to stateful memory to conform with RMT limitations and achieves higher accuracy than previous heavy hitter detection algorithms that avoid recirculation. We also analyze the effect of each architectural constraint on the measurement accuracy and provide insights for measurement algorithm designers.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115251839","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}

引用次数: 71

Quantifying Deployability & Evolvability of Future Internet Architectures via Economic Models 通过经济模型量化未来互联网架构的可部署性和可演化性

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-08-06 DOI: 10.1109/ICNP.2018.00048

Li Ye, Hong Xie, John C.S. Lui

{"title":"Quantifying Deployability & Evolvability of Future Internet Architectures via Economic Models","authors":"Li Ye, Hong Xie, John C.S. Lui","doi":"10.1109/ICNP.2018.00048","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00048","url":null,"abstract":"Emerging new applications demand the current Internet to provide new functionalities. Although many future Internet architectures and protocols have been proposed to fulfill such needs, ISPs have been reluctant to deploy these architectures. We believe technical issues are not the main reasons as many of these new proposals are technically sound. In this paper, we take an economic perspective and seek to answer: Why most new Internet architectures failed to be deployed? What makes a new architecture easier to deploy? We develop a game-theoretic model to characterize the outcome of an architecture's deployment through the equilibrium of ISP's decisions. We also use our model to explain the deploying outcomes of IPv6, DiffServ, CDN, etc., and the \"Internet flattening phenomenon\". Furthermore, one can use our model to predict the deployability of new architectures such as NDN, XIA, and compare the deployability of competing architectures. Our study also suggests that the architectures which try to make a fresh start may have a low deployability, unless they have efficient incremental deployment mechanisms or one introduces a centralized coordinator to help the deployment.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116449521","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}

引用次数: 1

Welcome Message from the TPC Chairs TPC主席的欢迎辞

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-08-01 DOI: 10.1109/smartiot.2018.00006

引用次数: 0

One for All, All for One: A Heterogeneous Data Plane for Flexible P4 Processing 我为人人，人人为我:用于灵活P4处理的异构数据平面

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-07-24 DOI: 10.1109/ICNP.2018.00063

Jeferson Santiago da Silva, Thibaut Stimpfling, Thomas Luinaud, Bachir Fradj, Bochra Boughzala

{"title":"One for All, All for One: A Heterogeneous Data Plane for Flexible P4 Processing","authors":"Jeferson Santiago da Silva, Thibaut Stimpfling, Thomas Luinaud, Bachir Fradj, Bochra Boughzala","doi":"10.1109/ICNP.2018.00063","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00063","url":null,"abstract":"The P4 community has recently put significant effort to increase the diversity of targets on which P4 programs can be implemented. These include fixed function and programmable ASICs, FPGAs, NICs, and CPUs. However, P4 programs are written according to the set of functionalities supported by the target for which they are compiled. For instance, a P4 program targeting a programmable ASIC cannot be extended with user-defined processing modules, which limits the flexibility and the abstraction of P4 programs. To address these shortcomings, we propose a heterogeneous P4 programmable data plane comprised of different targets that together appear as a single logical unit. The proposed data plane broadens the range of functionalities available to P4 programmers by combining the strength of each target. We demonstrate the feasibility of the proposed P4 data plane by coupling an FPGA with a soft switch which emulates a programmable ASIC. The proposed data plane is demonstrated with the implementation of a simplified L2 switch. The emulated ASIC match-table capacity is extended by the FPGA by an order of magnitude.The FPGA also integrates a proprietary module using a P4 extern.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125468988","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

Dynamic Heterogeneity-Aware Coded Cooperative Computation at the Edge 边缘动态异构感知编码协同计算

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-01-13 DOI: 10.1109/ICNP.2018.00013

Yasaman Keshtkarjahromi, Yuxuan Xing, H. Seferoglu

{"title":"Dynamic Heterogeneity-Aware Coded Cooperative Computation at the Edge","authors":"Yasaman Keshtkarjahromi, Yuxuan Xing, H. Seferoglu","doi":"10.1109/ICNP.2018.00013","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00013","url":null,"abstract":"Cooperative computation is a promising approach for localized data processing at the edge, e.g., for Internet of Things (IoT). Cooperative computation advocates that computationally intensive tasks in a device could be divided into sub-tasks, and offloaded to other devices or servers in close proximity. However, exploiting the potential of cooperative computation is challenging mainly due to the heterogeneous and time-varying nature of edge devices. Coded computation, which advocates mixing data in sub-tasks by employing erasure codes and offloading these sub-tasks to other devices for computation, is recently gaining interest, thanks to its higher reliability, smaller delay, and lower communication costs. In this paper, we develop a coded cooperative computation framework, which we name Coded Cooperative Computation Protocol (C3P), by taking into account the heterogeneous resources of edge devices. C3P dynamically offloads coded sub-tasks to helpers and is adaptive to time-varying resources. We show that (i) task completion delay of C3P is very close to optimal coded cooperative computation solutions, (ii) the efficiency of C3P in terms of resource utilization is higher than 99%, (iii) C3P improves task completion delay significantly as compared to baselines via both simulations and in a test-bed consisting of real Android-based smartphones.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"146 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114050301","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}

引用次数: 39