2019 IEEE 27th International Conference on Network Protocols (ICNP)最新文献_第9页

Optimal Strategies for Live Video Streaming in the Low-latency Regime 低延迟实时视频流的最优策略

2019 IEEE 27th International Conference on Network Protocols (ICNP) Pub Date : 2019-10-01 DOI: 10.1109/ICNP.2019.8888127

Liyang Sun, Tongyu Zong, Yong Liu, Yao Wang, Haihong Zhu

引用次数: 13

Migration Scheduling in Distributed SDN Controllers 分布式SDN控制器中的迁移调度

2019 IEEE 27th International Conference on Network Protocols (ICNP) Pub Date : 2019-10-01 DOI: 10.1109/ICNP.2019.8888045

M. A. Beiruti, Y. Ganjali

引用次数: 5

MACS: Deep Reinforcement Learning based SDN Controller Synchronization Policy Design 基于深度强化学习的SDN控制器同步策略设计

2019 IEEE 27th International Conference on Network Protocols (ICNP) Pub Date : 2019-09-19 DOI: 10.1109/ICNP.2019.8888034

Ziyao Zhang, Liang Ma, Konstantinos Poularakis, K. Leung, J. Tucker, A. Swami

{"title":"MACS: Deep Reinforcement Learning based SDN Controller Synchronization Policy Design","authors":"Ziyao Zhang, Liang Ma, Konstantinos Poularakis, K. Leung, J. Tucker, A. Swami","doi":"10.1109/ICNP.2019.8888034","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888034","url":null,"abstract":"In distributed software-defined networks (SDN), multiple physical SDN controllers, each managing a network domain, are implemented to balance centralised control, scalability, and reliability requirements. In such networking paradigms, controllers synchronize with each other, in attempts to maintain a logically centralised network view. Despite the presence of various design proposals for distributed SDN controller architectures, most existing works only aim at eliminating anomalies arising from the inconsistencies in different controllers’ network views. However, the performance aspect of controller synchronization designs with respect to given SDN applications are generally missing. To fill this gap, we formulate the controller synchronization problem as a Markov decision process (MDP) and apply reinforcement learning techniques combined with deep neural networks (DNNs) to train a smart, scalable, and fine-grained controller synchronization policy, called the Multi-Armed Cooperative Synchronization (MACS), whose goal is to maximise the performance enhancements brought by controller synchronizations. Evaluation results confirm the DNN’s exceptional ability in abstracting latent patterns in the distributed SDN environment, rendering significant superiority to MACS-based synchronization policy, which are 56% and 30% performance improvements over ONOS and greedy SDN controller synchronization heuristics.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759019","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

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification 高效网络验证的精确表达格理论框架

2019 IEEE 27th International Conference on Network Protocols (ICNP) Pub Date : 2019-08-24 DOI: 10.1109/ICNP.2019.8888144

Alex Horn, A. Kheradmand, M. Prasad

{"title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","authors":"Alex Horn, A. Kheradmand, M. Prasad","doi":"10.1109/ICNP.2019.8888144","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888144","url":null,"abstract":"Network verification promises to detect errors, such as black holes and forwarding loops, by logically analyzing the control or data plane. To do so efficiently, the state-of-the-art (e.g., Veriflow) partitions packet headers with identical forwarding behavior into the same packet equivalence class (PEC).Recently, Yang and Lam showed how to construct the minimal set of PECs, called atomic predicates. Their construction uses Binary Decision Diagrams (BDDs). However, BDDs have been shown to incur significant overhead per packet header bit, performing poorly when analyzing large-scale data centers. The overhead of atomic predicates prompted ddNF to devise a specialized data structure of Ternary Bit Vectors (TBV) instead.However, TBVs are strictly less expressive than BDDs. Moreover, unlike atomic predicates, ddNF’s set of PECs is not minimal. We show that ddNF’s non-minimality is due to empty PECs. In addition, empty PECs are shown to trigger wrong analysis results. This reveals an inherent tension between precision, expressiveness and performance in formal network verification.Our paper resolves this tension through a new lattice-theoretical PEC-construction algorithm, # PEC, that advances the field as follows: (i) # PEC can encode more kinds of forwarding rules (e.g., ip-tables) than ddNF and Veriflow, (ii) # PEC verifies a wider class of errors (e.g., shadowed rules) than ddNF, and (iii) on a broad range of real-world datasets, # PEC is 10times faster than atomic predicates. By achieving precision, expressiveness and performance, this paper answers a longstanding quest that has spanned three generations of formal network analysis techniques.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128168370","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}

引用次数: 10