2014 IEEE 22nd International Conference on Network Protocols最新文献_第8页

Meta-algorithms for Software-Based Packet Classification 基于软件的包分类元算法

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.53

Peng He, Gaogang Xie, Kave Salamatian, L. Mathy

{"title":"Meta-algorithms for Software-Based Packet Classification","authors":"Peng He, Gaogang Xie, Kave Salamatian, L. Mathy","doi":"10.1109/ICNP.2014.53","DOIUrl":"https://doi.org/10.1109/ICNP.2014.53","url":null,"abstract":"We observe that a same rule set can induce very different memory requirement, as well as varying classification performance, when using various well known decision tree based packet classification algorithms. Worse, two similar rule sets, in terms of types and number of rules, can give rise to widely differing performance behaviour for a same classification algorithms. We identify the intrinsic characteristics of rule sets that yield such performance differences, allowing us to understand and predict the performance behaviour of a rule set for various modern packet classification algorithms. Indeed, from our observations, we are able to derive a memory consumption model and an offline algorithm capable of quickly identifying which packet classification is suited to a give rule set. By splitting a large rule set in several subsets and using different packet classification algorithms for different subsets, our Smart Split algorithm is shown to be capable of configuring a multi-component packet classification system that exhibits up to 11 times less memory consumption, as well as up to about 4× faster classification speed, than the state-of-art work [20] for large rule sets. Our Auto PC framework obtains further performance gain by avoiding splitting large rule sets if the memory size of the built decision tree is shown by the memory consumption model to be small.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133106332","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}

引用次数: 43

OrthCredential: A New Network Capability Design for High-Performance Access Control 正交凭据:一种高性能访问控制的新网络能力设计

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.44

Hao Cai, Xinming Chen, T. Wolf

{"title":"OrthCredential: A New Network Capability Design for High-Performance Access Control","authors":"Hao Cai, Xinming Chen, T. Wolf","doi":"10.1109/ICNP.2014.44","DOIUrl":"https://doi.org/10.1109/ICNP.2014.44","url":null,"abstract":"Network architectures for the future Internet envision a variety of novel network services for transmitting, processing, and storaging of data. These network services may involve costly resources that need to be allocated by a service provider. Thus, an important problem is to limit access to authorized users (e.g., Those who have paid for a particular network service). In addition, these resources need to be protected from denial-of-service attacks or attempts to circumvent this access control. Most existing authentication approaches are based on cryptographic techniques. However, the high computational cost of cryptographic operations makes these techniques unsuitable for the data plane of the network, where potentially every packet needs to be checked at Gigabit per second link rates. In this paper, we describe a novel design for data plane capabilities, called OrthCredential, that solves this problem. The main idea is to use a set of orthogonal sequences as credentials that can be verified easily to protect the data plane against various attacks. These orthogonal sequences can be constructed by a Hadamard transform. Our evaluation of a prototype implementation shows that 64-bit credentials only require less than 300 processor cycles for verification, much less than existing access control schemes such as HMAC. And it provides reasonable security properties (e.g., Less than 10 -- 8 probability of successful attack).","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132926257","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

Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks 猎户座:大规模网络中软件定义网络的混合层次控制平面

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.91

Yonghong Fu, J. Bi, K. Gao, Zejia Chen, Jianping Wu, Bin Hao

{"title":"Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks","authors":"Yonghong Fu, J. Bi, K. Gao, Zejia Chen, Jianping Wu, Bin Hao","doi":"10.1109/ICNP.2014.91","DOIUrl":"https://doi.org/10.1109/ICNP.2014.91","url":null,"abstract":"The decoupled architecture and the fine-grained flow control feature of SDN limit the scalability of SDN network. In order to address this problem, some studies construct the flat control plane architecture, other studies build the hierarchical control plane architecture to improve the scalability of SDN. However, the two kinds of structure still have unresolved issues: the flat control plane structure can not solve the super-linear computational complexity growth of the control plane when SDN network scales to large size, the centralized abstracted hierarchical control plane structure brings path stretch problem. To address the two issues, we propose Orion, a hybrid hierarchical control plane for large-scale networks. Orion can effectively reduce the computational complexity growth of SDN control plane from super-linear to linear. Meanwhile, we design an abstracted hierarchical routing method to solve the path stretch problem. Further, Orion is implemented to verify the feasibility of the hybrid hierarchical approach. Finally, we verify the effectiveness of Orion both from the theoretical and experimental aspects.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130029885","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}

引用次数: 63

Cross-VM Covert Channel Risk Assessment for Cloud Computing: An Automated Capacity Profiler 云计算跨虚拟机隐蔽通道风险评估:一个自动容量分析器

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.24

Rui Zhang, Wen Qi, Jianping Wang

{"title":"Cross-VM Covert Channel Risk Assessment for Cloud Computing: An Automated Capacity Profiler","authors":"Rui Zhang, Wen Qi, Jianping Wang","doi":"10.1109/ICNP.2014.24","DOIUrl":"https://doi.org/10.1109/ICNP.2014.24","url":null,"abstract":"Cross-VM covert channels leverage physical resources shared between co-resident virtual machines, like CPU cache, memory bus, and disk bus, to leak information. The capacity of cross-VM covert channels varies on different cloud platforms. Thus, it is hard for cloud service providers to estimate the risk of information leakage caused by cross-VM covert channels on their own platforms. In this paper, we develop an Auto Profiling Framework of Covert Channel Capacity (APFC3) to automatically profile the maximum capacities of various cross-VM covert channels on different cloud platforms. The framework consists of automated parameter tuning for various cross-VM covert channels to achieve high data rate and automated capacity estimation of those cross-VM covert channels. We evaluate the proposed framework by constructing fine-tuned cross-VM covert channels on different virtualization platforms and comparing the optimized achievable data rate with the estimated maximum capacity computed using the proposed framework. The experiments show that in most cases, the capacity estimated using APFC3 is very close to the achieved data rate of constructed covert channels with fine-tuned parameters.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130486571","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}

引用次数: 4

Stochastic Planning for Content Delivery: Unveiling the Benefits of Network Functions Virtualization 内容交付的随机规划:揭示网络功能虚拟化的好处

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.56

M. Mangili, F. Martignon, A. Capone

引用次数: 24

Deconstructing MPTCP Performance 解构MPTCP性能

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.47

Behnaz Arzani, Alexander J. T. Gurney, Sitian Cheng, R. Guérin, B. T. Loo

引用次数: 30

TCP Performance over Mobile Networks in High-Speed Mobility Scenarios 高速移动场景下移动网络的TCP性能

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.49

Qingyang Xiao, Ke Xu, Dan Wang, Li Li, Yifeng Zhong

{"title":"TCP Performance over Mobile Networks in High-Speed Mobility Scenarios","authors":"Qingyang Xiao, Ke Xu, Dan Wang, Li Li, Yifeng Zhong","doi":"10.1109/ICNP.2014.49","DOIUrl":"https://doi.org/10.1109/ICNP.2014.49","url":null,"abstract":"Recently, the performance of mobile data networks has been evaluated from many aspects, e.g., TCP/IP protocols, comparison with WiFi or even satellite communication, under different movements within a metropolis area. Nevertheless, the result is still unknown in high-speed mobility scenarios and in a scale that crosses different metropolis and geographic areas. To fill in this blank, we carry out a comprehensive measurement study on the performance of mobile data networks under high-speed mobility, i.e., 300 km/h or above. Such speed is the current de facto standard of the China Railway High speed (CRH) network, the largest commercial high-speed railway network in the world so far. We first present an overview on the TCP performance over LTE networks. We observe that decent throughput may exist under high-speed mobility. However, comparing to the stationary and driving (100 km/h) scenarios, the throughput and RTT not only are worse, but also have a large variance. We then take an in-depth investigation into two key factors affecting the performance, i.e., The wireless channel and handoff. We believe our study on these factors is useful not only for TCP, but also for other upper-layer protocols.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842355","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}

引用次数: 36

Secgras: Security Group Analysis as a Cloud Service Secgras:作为云服务的安全组分析

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.42

Cheng Jin, Abhinav Srivastava, Yu Jin, Zhi-Li Zhang

引用次数: 4

Wireless Rate Adaptation via Smart Pilot 通过智能导频进行无线速率调整

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-01 DOI: 10.1109/ICNP.2014.64

Lu Wang, Xiaoke Qi, Jiang Xiao, Kaishun Wu, M. Hamdi, Qian Zhang

{"title":"Wireless Rate Adaptation via Smart Pilot","authors":"Lu Wang, Xiaoke Qi, Jiang Xiao, Kaishun Wu, M. Hamdi, Qian Zhang","doi":"10.1109/ICNP.2014.64","DOIUrl":"https://doi.org/10.1109/ICNP.2014.64","url":null,"abstract":"Rate adaptation is an essential component in today's wireless standards, for its ability to adaptively approach the channel capacity, and maximize the system throughput. The difficulty in rate adaptation stems from estimating the optimal data rate in a fluctuated channel. Previous wisdoms leverage PHY layer information for rate estimation, such as Soft PHY hints or Channel State Information. These information solely comes from one same layer, which are insufficient to track the optimal data rate. We observe that by investigating the information in both PHY layer decoder and upper layer protocol headers, more pilots can be exploited to estimate the optimal data rate across both time and frequency domain. These smart pilots help remove the residual channel effect and calibrate the CSI with minimum overhead. Based on the calibrated CSI, we propose a novel greedy rate selection algorithm to harness frequency diversity, which obtains the optimal data rate over all the subcarriers. Our experiments on GNU radio test bed show that Smart Pilot quickly tracks the link variance, and reduces the residual channel effect by 87%. Further, the trace driven simulation reveals that greedy rate selection algorithm predicts the data rate as good as the optimal rate adaptation algorithms for 802.11 standards.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615267","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

Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously 压缩IP转发表:同时实现信息论空间边界和快速查找

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-01 DOI: 10.1109/ICNP.2014.55

Attila Korösi, János Tapolcai, Bence Mihálka, Gábor Mészáros, G. Rétvári

{"title":"Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously","authors":"Attila Korösi, János Tapolcai, Bence Mihálka, Gábor Mészáros, G. Rétvári","doi":"10.1109/ICNP.2014.55","DOIUrl":"https://doi.org/10.1109/ICNP.2014.55","url":null,"abstract":"The Internet routing ecosystem is facing compelling scalability challenges, manifested primarily in the rapid growth of IP packet forwarding tables. The forwarding table, implemented at the data plane fast path of Internet routers to drive the packet forwarding process, currently contains about half a million entries and counting. Meanwhile, it needs to support millions of complex queries and updates per second. In this paper, we make the curious observation that the entropy of IP forwarding tables is very small and, what is more, seems to increase at a lower pace than the size of the network. This suggests that a sophisticated compression scheme may effectively and persistently reduce the memory footprint of IP forwarding tables, shielding operators from scalability matters at least temporarily. Our main contribution is such a compression scheme which, for the first time, admits both the required information-theoretical size bounds and attains fast lookups, thanks to aggressive level compression. Although we find the underlying optimization problem NP-complete, we can still give a lightweight heuristic algorithm with firm approximation guarantees. This allows us to squeeze real IP forwarding tables, comprising almost 500, 000 prefixes, to just about 140-200 KBytes of memory within a factor of 2-3 of the entropy bound, so that forwarding decisions take only 8-10 memory accesses on average and updates are supported efficiently. Our compression scheme may be of more general interest, as it is applicable to essentially any prefix tree.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133775058","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}

引用次数: 12