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

The dynamic cuckoo filter 动态杜鹃滤波器

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117563

Hanhua Chen, Liangyi Liao, Hai Jin, Jie Wu

{"title":"The dynamic cuckoo filter","authors":"Hanhua Chen, Liangyi Liao, Hai Jin, Jie Wu","doi":"10.1109/ICNP.2017.8117563","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117563","url":null,"abstract":"The emergence of large-scale dynamic sets in real applications creates stringent requirements for approximate set representation structures: 1) the capacity of the set representation structures should support flexibly extending or reducing to cope with dynamically changing of set size; 2) the set representation structures should support reliable delete operation. Existing techniques for approximate set representation, e.g., the cuckoo filter, the Bloom filter and its variants cannot meet both the requirements of a dynamic set. To solve the problem, in this paper we propose the dynamic cuckoo filter (DCF) to support reliable delete operation and elastic capacity for dynamic set representation and membership testing. Two factors contribute to the efficiency of the DCF design. First, the data structure of a DCF is extendable, making the representation of a dynamic set space efficient. Second, a DCF utilizes a monopolistic fingerprint for representing an item and guarantees reliable delete operation. Experiment results show that compared to the existing state-of-the-art designs, DCF achieves 75% reduction in memory cost, 50% improvement in construction speed, and 80% improvement in speed of membership query. We implement a prototype file backup system and use DCF for data deduplication. Comprehensive experiment results demonstrate the efficiency of our DCF design compared to existing schemes.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"41 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72848456","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}

引用次数: 33

Deploying default paths by joint optimization of flow table and group table in SDNs 通过sdn中流表和组表的联合优化部署默认路径

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117539

Gongming Zhao, Hongli Xu, Shigang Chen, Liusheng Huang, Pengzhan Wang

{"title":"Deploying default paths by joint optimization of flow table and group table in SDNs","authors":"Gongming Zhao, Hongli Xu, Shigang Chen, Liusheng Huang, Pengzhan Wang","doi":"10.1109/ICNP.2017.8117539","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117539","url":null,"abstract":"Software Defined Networking (SDN) separates the control plane from the data plane to ease network management and provide flexibility in packet routing. The control plane interacts with the data plane through the forwarding tables, usually including a flow table and a group table, at each switch. Due to high cost and power consumption of Ternary Content Addressable Memory (TCAM), commodity switches can only support flow/group tables of limited size, which presents serious challenge for SDN to scale to large networks. One promising approach to address the scalability problem is to deploy aggregate default paths specified by wildcard forwarding rules. However, the multi-dimensional interaction among numerous system parameters and performance/scalability considerations makes the problem of setting up the flow/group tables at all switches for optimal overall layout of default paths very challenging. This paper studies the joint optimization of flow/group tables in the complex setting of large-scale SDNs. We formulate this problem as an integer linear program, and prove its NP-Hardness. An efficient algorithm with bounded approximation factors is proposed to solve the problem. The properties of our algorithm are formally analyzed. We implement the proposed algorithm on an SDN testbed for experimental studies and use simulations for large-scale investigation. The experimental results and simulation results demonstrate high efficiency of our proposed algorithm.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"89 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85318870","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}

引用次数: 9

Experimental evaluation of BBR congestion control BBR拥塞控制的实验评价

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117540

Mario Hock, R. Bless, M. Zitterbart

{"title":"Experimental evaluation of BBR congestion control","authors":"Mario Hock, R. Bless, M. Zitterbart","doi":"10.1109/ICNP.2017.8117540","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117540","url":null,"abstract":"BBR is a recently proposed congestion control. Instead of using packet loss as congestion signal, like many currently used congestion controls, it uses an estimate of the available bottleneck link bandwidth to determine its sending rate. BBR tries to provide high link utilization while avoiding to create queues in bottleneck buffers. The original publication of BBR shows that it can deliver superior performance compared to Cubic TCP in some environments. This paper provides an independent and extensive experimental evaluation of BBR at higher speeds. The experimental setup uses BBR's Linux kernel 4.9 implementation and typical data rates of 10Gbit/s and 1 Gbit/s at the bottleneck link. The experiments vary the flows' round-trip times, the number of flows, and buffer sizes at the bottleneck. The evaluation considers throughput, queuing delay, packet loss, and fairness. On the one hand, the intended behavior of BBR could be observed with our experiments. On the other hand, some severe inherent issues such as increased queuing delays, unfairness, and massive packet loss were also detected. The paper provides an in-depth discussion of BBR's behavior in different experiment setups.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"2 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82476513","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}

引用次数: 171

Wireless network instabilities in the wild: Prevalence, App (non)resilience, and OS remedy 野外无线网络的不稳定性:流行，应用程序(非)弹性和操作系统补救

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117568

Zeqi Lai, Yong Cui, Yimin Jiang, Xiaomeng Chen, Y. C. Hu, Kun Tan, Minglong Dai, Kai Zheng

{"title":"Wireless network instabilities in the wild: Prevalence, App (non)resilience, and OS remedy","authors":"Zeqi Lai, Yong Cui, Yimin Jiang, Xiaomeng Chen, Y. C. Hu, Kun Tan, Minglong Dai, Kai Zheng","doi":"10.1109/ICNP.2017.8117568","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117568","url":null,"abstract":"While the bandwidth and latency improvement of both WiFi and cellular data networks in the past decade are plenty evident, the extent of signal strength fluctuation and network disruptions (unexpected switching or disconnections) experienced by mobile users in today's network deployment remains less clear. This paper makes three contributions. First, we conduct the first extensive measurement of network disruptions and signal strength fluctuations (together denoted as instabilities) experienced by 2000 smartphones in the wild. Our results show that network disruptions and signal strength fluctuations remain prevalent as we moved into the 4G era. Second, we study how well popular mobile apps today handle such network instabilities. Our results show that even some of the most popular mobile apps do not implement any disruption-tolerant mechanisms. Third, we present JANUS, an intelligent interface management framework that exploits the multiple interfaces on a handset to transparently handle network disruptions and improve apps' QoE. We have implemented JANUS on Android and our evaluation using a set of popular apps shows that Janus can (1) transparently and efficiently handle network disruptions, (2) reduce video stalls by 2.9 times and increase 31% of the time of good voice quality compared to naive solutions.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"85 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80663853","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

Investigating the impact of cache pollution attacks in heterogeneous cellular networks 研究异构蜂窝网络中缓存污染攻击的影响

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117572

Sibendu Paul, A. Seetharam, A. Mukherjee, M. K. Naskar

引用次数: 0

A concise forwarding information base for scalable and fast name lookups 一个简明的转发信息库，用于可扩展和快速的名称查找

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117530

Ye Yu, D. Belazzougui, Chen Qian, Qin Zhang

引用次数: 11

Analyzing public transportation mobility data for networking purposes 为网络目的分析公共交通移动数据

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117593

K. Suleiman, O. Basir

{"title":"Analyzing public transportation mobility data for networking purposes","authors":"K. Suleiman, O. Basir","doi":"10.1109/ICNP.2017.8117593","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117593","url":null,"abstract":"Utilizing vehicles for networking purposes has always been a challenge. This is mainly due to the minimum density of connected-vehicles required. The locations of these vehicles should be shareable and reasonably predictable for efficient position-based routing protocols to be implemented. Their Vehicle-to-Vehicle (V2V) communication cooperation should be well-incentivized for efficient networking to be realized. Regular vehicles struggle to have all of these properties. Public transportation vehicles, on the other hand, are well-positioned in this regard; their number is proportional to the number of city residents while being uniformly distributed throughout the day, their locations have no privacy concerns while being highly predictable and their V2V communication cooperation is easily enforceable by the single administration authority they usually have. With efficient networking, public transportation vehicles can become the reliable communication backbone for other vehicle categories. In order to investigate their networking potential, we present for the firs time, in this paper, a data analysis study of realistic public transportation mobility datasets representing the Grand River Transit bus service offered throughout the Region of Waterloo, Ontario, Canada. We show both the data preprocessing and processing phases. The processing phase is mainly based on discovering bus groups using hierarchical clustering. This is done while varying the minimum degree of intra-cluster connectivity and the maximum intra-cluster communication range. Based on this data analysis approach, we show the promising networking potential of public transportation vehicles and provide design guidelines for future networking solutions utilizing them.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"56 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80205714","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}

引用次数: 0

MSAID: Automated interference detection for multiple SDN applications MSAID:用于多个SDN应用的自动干扰检测

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117575

Yahui Li, Zhiliang Wang, Jiangyuan Yao, Xia Yin, Xingang Shi, Jianping Wu

引用次数: 2

SICS: Secure and dynamic middlebox outsourcing 安全、动态的中间盒外包

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117581

Huazhe Wang, Xin Li, Chen Qian

引用次数: 2

On an impact of large content on packet-level caching of information centric networking 大内容对信息中心网络的包级缓存的影响

2017 IEEE 25th International Conference on Network Protocols (ICNP) Pub Date : 2017-10-01 DOI: 10.1109/ICNP.2017.8117577

Yoji Yamamoto, Junji Takemasa, Y. Koizumi, T. Hasegawa

引用次数: 1