Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117563
Hanhua Chen, Liangyi Liao, Hai Jin, Jie Wu
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.
{"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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117539
Gongming Zhao, Hongli Xu, Shigang Chen, Liusheng Huang, Pengzhan Wang
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.
SDN (Software Defined Networking)是一种将控制平面与数据平面分离的网络技术，可以简化网络管理并提供更灵活的报文路由。控制平面通过每个交换机上的转发表(通常包括流表和组表)与数据平面进行交互。由于三元内容可寻址存储器(TCAM)的高成本和高功耗，商品交换机只能支持有限大小的流/组表，这对SDN扩展到大型网络提出了严峻的挑战。解决可伸缩性问题的一种有希望的方法是部署由通配符转发规则指定的聚合默认路径。然而，在众多系统参数和性能/可伸缩性考虑因素之间的多维交互使得在所有交换机上设置流/组表以实现默认路径的最佳总体布局的问题非常具有挑战性。本文研究了大型sdn复杂设置下的流/群表联合优化问题。我们将这个问题化为一个整数线性规划，并证明了它的np -硬度。提出了一种具有有界近似因子的有效算法来解决这一问题。对算法的性质进行了形式化分析。我们在SDN测试平台上实现了所提出的算法进行实验研究，并使用模拟进行大规模调查。实验结果和仿真结果表明了该算法的有效性。
{"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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117540
Mario Hock, R. Bless, M. Zitterbart
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.
{"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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117568
Zeqi Lai, Yong Cui, Yimin Jiang, Xiaomeng Chen, Y. C. Hu, Kun Tan, Minglong Dai, Kai Zheng
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.
{"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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117572
Sibendu Paul, A. Seetharam, A. Mukherjee, M. K. Naskar
With the growth of Internet-of-Things, mobile data traffic is expected to increase exponentially. To support this rapid growth, heterogeneous cellular networks comprising of femtocells with storage capabilities along with macrocell base stations have been proposed. In this paper, we first investigate the performance impact of a simple randomized cache pollution attack, where the attacker pollutes the cache at the femtocell by requesting unpopular content. We then adopt a principled approach based on the characteristic time of a content in a cache to design an optimized attack strategy. Our experiments show that the proposed attack strategy outperforms the randomized attack with the same attack rate.
{"title":"Investigating the impact of cache pollution attacks in heterogeneous cellular networks","authors":"Sibendu Paul, A. Seetharam, A. Mukherjee, M. K. Naskar","doi":"10.1109/ICNP.2017.8117572","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117572","url":null,"abstract":"With the growth of Internet-of-Things, mobile data traffic is expected to increase exponentially. To support this rapid growth, heterogeneous cellular networks comprising of femtocells with storage capabilities along with macrocell base stations have been proposed. In this paper, we first investigate the performance impact of a simple randomized cache pollution attack, where the attacker pollutes the cache at the femtocell by requesting unpopular content. We then adopt a principled approach based on the characteristic time of a content in a cache to design an optimized attack strategy. Our experiments show that the proposed attack strategy outperforms the randomized attack with the same attack rate.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"105 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89917855","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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117530
Ye Yu, D. Belazzougui, Chen Qian, Qin Zhang
Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous network technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little memory to support ultra-fast lookups of network names. Othello Hashing and Concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of Concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented Concise on three platforms. Experimental results show that Concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.
转发信息库(Forwarding information base, FIB)的可扩展性及其查找速度是许多使用位置无关网络名称的网络技术的基本问题。在本文中，我们提出了一种新的网络算法，奥赛罗哈希，以及它的应用FIB设计称为简洁，它使用很少的内存来支持超快速查找网络名称。奥赛罗哈希和简明使用最小完美哈希，并依赖于可编程网络框架来支持动态更新。我们在概念上的贡献是优化数据平面的内存效率和查询速度，将相对复杂的构造和更新组件移动到资源丰富的控制平面。我们在三个平台上执行了《简明》。实验结果表明，与现有的网络名称查找解决方案相比，该方法使用了更小的内存，实现了更快的查询速度。
{"title":"A concise forwarding information base for scalable and fast name lookups","authors":"Ye Yu, D. Belazzougui, Chen Qian, Qin Zhang","doi":"10.1109/ICNP.2017.8117530","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117530","url":null,"abstract":"Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous network technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little memory to support ultra-fast lookups of network names. Othello Hashing and Concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of Concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented Concise on three platforms. Experimental results show that Concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"2001 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":"82538103","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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117593
K. Suleiman, O. Basir
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.
{"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}
Multiple SDN applications can make several harmful interferences unintentionally, although each individual application may be properly developed. This paper proposes a Multiple SDN Applications Interference Detector (MSAID). To bridge the gap between the source code of applications and the actual interferences, we leverage symbolic execution and constraint solving to obtain how the event handler handles the input messages. We then analyze the complex interaction of multiple applications and present novel methods to identify the interferences. Finally, we evaluate its correctness and prove its usefulness with a series of SDN applications.
{"title":"MSAID: Automated interference detection for multiple SDN applications","authors":"Yahui Li, Zhiliang Wang, Jiangyuan Yao, Xia Yin, Xingang Shi, Jianping Wu","doi":"10.1109/ICNP.2017.8117575","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117575","url":null,"abstract":"Multiple SDN applications can make several harmful interferences unintentionally, although each individual application may be properly developed. This paper proposes a Multiple SDN Applications Interference Detector (MSAID). To bridge the gap between the source code of applications and the actual interferences, we leverage symbolic execution and constraint solving to obtain how the event handler handles the input messages. We then analyze the complex interaction of multiple applications and present novel methods to identify the interferences. Finally, we evaluate its correctness and prove its usefulness with a series of SDN applications.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"504 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76705121","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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117581
Huazhe Wang, Xin Li, Chen Qian
Outsourcing middleboxes brings threats to the enterprise's private information including the trafflc and rules of middleboxes. We present a secure and dynamic middlebox outsourcing framework SICS, short for Secure In-Cloud Service. SICS encrypts each packet header and uses a label for in-cloud rule matching, which enables the cloud to perform its functionalities correctly with minimum header information leakage.
{"title":"SICS: Secure and dynamic middlebox outsourcing","authors":"Huazhe Wang, Xin Li, Chen Qian","doi":"10.1109/ICNP.2017.8117581","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117581","url":null,"abstract":"Outsourcing middleboxes brings threats to the enterprise's private information including the trafflc and rules of middleboxes. We present a secure and dynamic middlebox outsourcing framework SICS, short for Secure In-Cloud Service. SICS encrypts each packet header and uses a label for in-cloud rule matching, which enables the cloud to perform its functionalities correctly with minimum header information leakage.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"6 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85557975","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}
Pub Date : 2017-10-01DOI: 10.1109/ICNP.2017.8117577
Yoji Yamamoto, Junji Takemasa, Y. Koizumi, T. Hasegawa
On the one hand packet-level caching of Information-Centric Networking (ICN) is a key to accommodating Video on Demand (VoD) movies thanks to its fine granularity caching, but on the other hand it would cause degradation in cache hit probability because each of packets constituting a content object is dealt individually. This paper analytically reveals that caching large content objects by using packet-level caching degrades caching hit probability.
{"title":"On an impact of large content on packet-level caching of information centric networking","authors":"Yoji Yamamoto, Junji Takemasa, Y. Koizumi, T. Hasegawa","doi":"10.1109/ICNP.2017.8117577","DOIUrl":"https://doi.org/10.1109/ICNP.2017.8117577","url":null,"abstract":"On the one hand packet-level caching of Information-Centric Networking (ICN) is a key to accommodating Video on Demand (VoD) movies thanks to its fine granularity caching, but on the other hand it would cause degradation in cache hit probability because each of packets constituting a content object is dealt individually. This paper analytically reveals that caching large content objects by using packet-level caching degrades caching hit probability.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"43 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88694729","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：