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

Formal Modeling and Systematic Black-Box Testing of SDN Data Plane SDN数据平面形式化建模与系统黑盒测试

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

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

{"title":"Formal Modeling and Systematic Black-Box Testing of SDN Data Plane","authors":"Jiangyuan Yao, Zhiliang Wang, Xia Yin, Xingang Shi, Jianping Wu","doi":"10.1109/ICNP.2014.37","DOIUrl":"https://doi.org/10.1109/ICNP.2014.37","url":null,"abstract":"Existing tools for Software-Defined Networking (SDN) data plane testing can be classified into two classes: white box and black-box. For the former, all or part of source codes should be accessed. But for testers outside the manufacturers, the accessing of source code is impossible or very difficult in most cases, especially for hardware devices. For the latter, test cases are manually developed, which cannot ensure the coverage. In this paper, we present a model based black-box systematic testing method for SDN data plane. We propose a new model, Pipelined Extended Finite State Machine (Pi-EFSM), to specify the multiple-level pipeline of SDN data plane. For the Pi-EFSM model, we present a 3-phase systematic test generation approach. By using a hierarchical test generation strategy, the proposed test generation method can alleviate state space explosion to some extent. Our test generation method can achieve the systematic coverage towards the elements of the model. We apply our method in the testing of Open Flow switches (specification version 1.3.0). We build a Pi-EFSM model for Open Flow switches and derive the executable test sequences. Some implementation faults and specification confusions are exposed when we test two switches, Open switch 2.1.0 and CPqD Open Flow 1.3 Software Switch.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"154 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":"114446249","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

Obstacle Shadowing Influences in VANET Safety 障碍物遮蔽对VANET安全性的影响

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

Scott E. Carpenter

{"title":"Obstacle Shadowing Influences in VANET Safety","authors":"Scott E. Carpenter","doi":"10.1109/ICNP.2014.72","DOIUrl":"https://doi.org/10.1109/ICNP.2014.72","url":null,"abstract":"Wireless communications between vehicles enables both safety applications, such as accident avoidance, and nonsafety applications, such as traffic congestion alerts [1] with the intent of improving safety in driving conditions. Because cost limited test-bed environments constrain prototype testing, VANET researchers often turn instead to simulation toolsets from which a rich set of environmental scenarios are modeled. However, despite the availability of such tools, results are inconsistent. While VANET investigators often model propagation loss deterministically dependent upon transmitter receiver distance, fading and shadowing effects are often modeled stochastically, leading to probabilistic results which are independent of the actual environment and thus fail to consider realistic road topologies and the presence of obstacles [2]. In this work, we implement for ns-3 [3] the empirically-validated obstacle shadowing model from [4] by leveraging building data from Open Street Map (OSM) [5] to deterministically evaluate line of sight propagation effects using techniques from computational geometry, and we further extend results to evaluate safety performance assessments. The impact to safety performance measurement of obstacles in VANET simulations motivates the following research objective: The goal of this research is to show quantitatively how accurate, deterministic obstacle fading models impact the performance assessment of VANET safety applications. Deterministic shadowing compares differently than stochastic fading and failing to account for the effects of obstacles in safety assessment can inaccurately or even greatly overstate the performance of VANET safety applications. Including realistic obstacle shadowing in VANET simulation modeling improves VANET assessment and strengthens safety, thus supporting one of the primary goals of connected vehicle systems.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"24 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":"128520758","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}

引用次数: 21

Forwarding Programming in Protocol-Oblivious Instruction Set 协议无关指令集中的转发编程

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

Jingzhou Yu, Xiaozhong Wang, Jian Song, Yuanming Zheng, Haoyu Song

引用次数: 23

Software Switch Performance Factors in Network Virtualization Environment 网络虚拟化环境下软件交换机性能因素分析

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

Yimeng Zhao, L. Iannone, M. Riguidel

引用次数: 12

On Measuring One-Way Path Metrics from a Web Server 关于从Web服务器测量单向路径度量

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

Xiapu Luo, Lei Xue, Cong Shi, Yuru Shao, Chenxiong Qian, Edmond W. W. Chan

引用次数: 5

Extending Openflow for Service Insertion and Payload Inspection 扩展Openflow用于服务插入和负载检查

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

Robinson Udechukwu, R. Dutta

{"title":"Extending Openflow for Service Insertion and Payload Inspection","authors":"Robinson Udechukwu, R. Dutta","doi":"10.1109/ICNP.2014.94","DOIUrl":"https://doi.org/10.1109/ICNP.2014.94","url":null,"abstract":"Software Defined Networking (SDN) offers traffic characterization and resource allocation policies to change dynamically, while avoiding the obsolescence of specialized forwarding equipment. Open Flow, a SDN standard, is currently the only standard that explicitly focuses on multi-vendor openness. Unfortunately, it only provides for traffic engineering on an integrated basis for L2-L4. The obvious approaches to expand Open Flow's reach to L7, would be to enhance the data path flow table, or to utilize the controller for deep packet inspection, both introduces significant scalability barriers. We propose and prototype an enhancement to Open Flow based on the idea of an External Processing Box (EPB) optionally attached to forwarding engines, however, we use existing protocol extension constructs to control the EPB as an integrated part of the Open Flow data path. This provides network operators with the ability to use L7-based policies to control service insertion and traffic steering, without breaking the open paradigm. This novel yet eminently practical augmentation of Open Flow provides added value critical for realistic networking practice. Retention of multi-vendor openness for such an approach has not been previously reported in literature to the best of our knowledge. We report numerical results from our prototype, characterizing the performance and practicality of this prototype by implementing a video reconditioning application on this platform.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"81 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":"122701097","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}

引用次数: 7

On the MAC for Power-Line Communications: Modeling Assumptions and Performance Tradeoffs 电力线通信的MAC:建模假设和性能权衡

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

C. Vlachou, A. Banchs, J. Herzen, Patrick Thiran

{"title":"On the MAC for Power-Line Communications: Modeling Assumptions and Performance Tradeoffs","authors":"C. Vlachou, A. Banchs, J. Herzen, Patrick Thiran","doi":"10.1109/ICNP.2014.68","DOIUrl":"https://doi.org/10.1109/ICNP.2014.68","url":null,"abstract":"Power-line communications are becoming a key component in home networking. The dominant MAC protocol for high data-rate power-line communications, IEEE 1901, employs a CSMA/CA mechanism similar to the back off process of 802.11. Existing performance evaluation studies of this protocol assume that the back off processes of the stations are independent (the so-called decoupling assumption). However, in contrast to 802.11, 1901 stations can change their state after sensing the medium busy, which introduces strong coupling between the stations and, as a result, makes existing analyses inaccurate. In this paper, we propose a new performance model for 1901, which does not rely on the decoupling assumption. We prove that our model admits a unique solution. We confirm the accuracy of our model using both test bed experiments and simulations, and we show that it surpasses current models based on the decoupling assumption. Furthermore, we study the trade off between delay and throughput existing with 1901. We show that this protocol can be configured to accommodate different throughput and jitter requirements, and we give systematic guidelines for its configuration.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"247 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":"114359473","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}

引用次数: 30

Preferential Link Tomography: Monitor Assignment for Inferring Interesting Link Metrics 优先链路断层扫描:用于推断感兴趣的链路度量的监视器分配

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

Yi Gao, Wenbin Wu, Wei Dong, Chun Chen, Xiangyang Li, Jiajun Bu

{"title":"Preferential Link Tomography: Monitor Assignment for Inferring Interesting Link Metrics","authors":"Yi Gao, Wenbin Wu, Wei Dong, Chun Chen, Xiangyang Li, Jiajun Bu","doi":"10.1109/ICNP.2014.36","DOIUrl":"https://doi.org/10.1109/ICNP.2014.36","url":null,"abstract":"We study the problem of identifying additive and static link metrics of a set of interesting links in a communication network, by using end-to-end cycle-free path measurements among selected monitors. To uniquely identify the metrics of these interesting links, three questions should be addressed: monitor assignment (which nodes should serve as monitors), paths selection (which cycle-free paths connecting each pair of monitors will be used), and link metric calculation. Since assigning a node as a monitor usually requires non-negligible operational cost, we focus on assigning the minimum number of monitors (i.e., Optimal monitor assignment) to identify all interesting links. By modeling the network as a connected graph, we propose Scalpel, an efficient preferential link tomography approach. Scalpel trims the original graph by a two-stage graph trimming algorithm and reuses existing method to assign monitors in the trimmed graph. We theoretically prove Scalpel has several key properties: 1) the graph trimming algorithm in Scalpel is minimal in the sense that further trimming the graph cannot reduce the number of monitors, 2) the obtained assignment is able to identify all interesting links in the original graph, and 3) an optimal monitor assignment in the graph after trimming is also an optimal monitor assignment in the original graph. Extensive simulations based on both synthetic topologies and real network topologies show the effectiveness of Scalpel. Compared with state-of-the-art, our approach reduces the number of monitors by 39.0%~98.6% when 50%~1% of all links are interesting links.","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":"123096991","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

Freeway: Adaptively Isolating the Elephant and Mice Flows on Different Transmission Paths 高速公路:自适应隔离不同传播路径上的象流和鼠流

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

Wei Wang, Yi Sun, K. Zheng, M. Kâafar, Dan-dan Li, Zhongcheng Li

{"title":"Freeway: Adaptively Isolating the Elephant and Mice Flows on Different Transmission Paths","authors":"Wei Wang, Yi Sun, K. Zheng, M. Kâafar, Dan-dan Li, Zhongcheng Li","doi":"10.1109/ICNP.2014.59","DOIUrl":"https://doi.org/10.1109/ICNP.2014.59","url":null,"abstract":"The network resource competition of today' data enters is extremely intense between long-lived elephant flows and latency-sensitive mice flows. Achieving both goals of high throughput and low latency respectively for the two types of flows requires compromise, which recent research has not successfully solved mainly due to the transfer of elephant and mice flows on shared links without any differentiation. However, current data enters usually adopt clos-based topology, e.g. Fat-tree/VL2, so there exist multiple shortest paths between any pair of source and destination. In this paper, we leverage on this observation to propose a flow scheduling scheme, Freeway, to adaptively partition the transmission paths into low latency paths and high throughput paths respectively for the two types of flows. An algorithm is proposed to dynamically adjust the number of the two types of paths according to the real-time traffic. And based on these separated transmission paths, we propose different flow type-specific scheduling and forwarding methods to make full utilization of the bandwidth. Our simulation results show that Freeway significantly reduces the delay of mice flow by 85.8% and achieves 9.2% higher throughput compared with Hedera.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"286 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":"121305796","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}

引用次数: 29

Collaborative Verification of Forward and Reverse Reachability in the Internet Data Plane Internet数据平面中正向和反向可达性的协同验证

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

Hongkun Yang, S. Lam

{"title":"Collaborative Verification of Forward and Reverse Reachability in the Internet Data Plane","authors":"Hongkun Yang, S. Lam","doi":"10.1109/ICNP.2014.54","DOIUrl":"https://doi.org/10.1109/ICNP.2014.54","url":null,"abstract":"To debug reach ability problems, a network operator often asks operators of other networks for help by telephone or email. We present a new protocol, COVE, for automating the exchange of data plane reach ability information between networks in a business relationship. A network deploys COVE in a host (its local verifier) which can construct both forward and reverse reach ability trees in the Internet data plane for the network's provider/customer cone. Each edge in a tree is annotated by a set of packets that can traverse the edge. COVE was designed with partial deployment in mind. Reachable networks that do not deploy COVE are leaf nodes in reach ability trees. Partial trees are useful. We constructed an Internet dataset of 2, 649 ASes and performed experiments in which up to 170 workstations ran COVE as local verifiers to construct forward and reverse provider (also customer) trees for ASes. The results of these experiments demonstrate scalability of COVE to very large ASes in the Internet. We illustrate applications of COVE to solve the following network management problems: evaluating inbound load balancing policies, what-if analysis before adding a new provider, finding additional paths, configuring default routes as backup, black hole detection, and persistent forwarding loop detection.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"94 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":"122967389","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