Filters








119 Hits in 5.5 sec

Transiently Consistent SDN Updates: Being Greedy is Hard [article]

Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
2016 arXiv   pre-print
This paper revisits the problem of updating an SDN in a transiently consistent, loop-free manner.  ...  First, we rigorously prove that computing a maximum (greedy) loop-free network update is generally NP-hard; this result has implications for the classic maximum acyclic subgraph problem (the dual feedback  ...  The greedy network update problem is NP-hard. Our reduction is from the NP-hard Minimum Hitting Set problem.  ... 
arXiv:1605.03158v1 fatcat:dul45znjlre43plrexvh6v7apm

Transiently Consistent SDN Updates: Being Greedy is Hard [chapter]

Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
2016 Lecture Notes in Computer Science  
This paper revisits the problem of how to update an SDN in a transiently consistent, loop-free manner.  ...  In Section 3, we prove that computing greedy updates is NP-hard, both for strong and for relaxed loop-freedom. Section 4 describes polynomial-time (approximation) algorithms.  ...  However, problems on bounded directed path-width graphs may be solvable efficiently: none of the negative results for bounded degree graphs on graphs of bounded directed treewidth seem to be extendable  ... 
doi:10.1007/978-3-319-48314-6_25 fatcat:26acr5kqc5afzamviw6lhvu4iq

Survey of Consistent Software-Defined Network Updates

Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio
2018 IEEE Communications Surveys and Tutorials  
While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new  ...  In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency  ...  for consistent updates within SDN controllers.  ... 
doi:10.1109/comst.2018.2876749 fatcat:wcegero4tvbmrkfogpqw6ze3ce

Safe Update of Hybrid SDN Networks

Stefano Vissicchio, Laurent Vanbever, Luca Cittadini, Geoffrey G. Xie, Olivier Bonaventure
2017 IEEE/ACM Transactions on Networking  
Moreover, it can be applied to update networks running any combination of centralized and distributed control-planes, including different families of IGPs, OpenFlow or other SDN protocols, and hybrid SDN  ...  Our approach always finds an operational sequence that provably guarantees strong consistency throughout the update, with very limited overhead.  ...  This is hard for many reasons. First, guaranteeing strong consistency during an update is challenging.  ... 
doi:10.1109/tnet.2016.2642586 fatcat:t4rknsohjjhprdubmnytctpbfy

Chronus: Consistent Data Plane Updates in Timed SDNs

Jiaqi Zheng, Guihai Chen, Stefan Schmid, Haipeng Dai, Jie Wu
2017 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)  
Motivated by the advent of tightly synchronized SDNs, we in this paper initiate the study of algorithms for consistent network updates in "timed SDNs"-SDNs in which individual node updates can be scheduled  ...  Accordingly, the consistent network update problem has recently received much attention.  ...  The work is partly  ... 
doi:10.1109/icdcs.2017.96 dblp:conf/icdcs/ZhengCSD017 fatcat:74bayehrofditgr2fblzpnova4

Loop-Free Route Updates for Software-Defined Networks

Klaus-Tycho Foerster, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
2018 IEEE/ACM Transactions on Networking  
Our Contributions This paper initiates the study of scheduling fast loop-free network updates, i.e., updates which require a minimal number of controller interactions while providing transient consistency  ...  The 2PC protocol ensures a strong per-packet consistency [3]: each packet will be forwarded according to r 1 (exclusive-)or r 2 , and loops are avoided.  ...  Klaus-Tycho Foerster is supported by the Danish Villum Foundation.  ... 
doi:10.1109/tnet.2017.2778426 fatcat:gxjngodhnjat3n3kixowvukroy

Max progressive network update

Yang Chen, Jie Wu
2017 2017 IEEE International Conference on Communications (ICC)  
In this paper, we prove finding a feasible update plan with the minimum number of rate-limiting flows when deadlocks occur is NP-hard.  ...  However, the quality of service can be easily reduced by unexpected transient link congestion, which may be caused by variable link transmission latency during flow migration.  ...  We prove that the buffer deployment problem is NP-hard. Furthermore, we propose a heuristic greedy algorithm to efficiently choose rate-limiting flows to accomplish different system constraints.  ... 
doi:10.1109/icc.2017.7997201 dblp:conf/icc/ChenW17 fatcat:5qnboqts5fefbdqhw27kjhpjoa

Towards Decentralized Fast Consistent Updates

Thanh Dang Nguyen, Marco Chiesa, Marco Canini
2016 Proceedings of the 2016 workshop on Applied Networking Research Workshop - ANRW 16  
Software-Defined Networking (SDN) offers abstractions for updating network state while preserving consistency properties.  ...  Updating data plane state to adapt to dynamic conditions is a fundamental network control operation.  ...  This research is (in part) supported by European Union's Horizon 2020 research and innovation programme under the ENDEAVOUR project (grant agreement 644960).  ... 
doi:10.1145/2959424.2959435 fatcat:rc7vm5navjcuxmc35wsrw7ekji

Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes

Klaus-Tycho Forster, Ratul Mahajan, Roger Wattenhofer
2016 2016 IFIP Networking Conference (IFIP Networking) and Workshops  
quickly the SDN can be updated.  ...  For the basic consistency property of loop freedom, we prove that maximizing the number of loop free update rules is NP-hard for interval-based routing and longestprefix matching.  ...  AN ARCHITECTURE FOR SDN UPDATES We have argued that maintaining consistency during rule updates is a key hurdle towards realizing the promise of SDNs.  ... 
doi:10.1109/ifipnetworking.2016.7497232 dblp:conf/networking/ForsterMW16 fatcat:vtucrmyixnekfhtiijj5tiiuny

Dynamic scheduling of network updates

Xin Jin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, Roger Wattenhofer
2014 Proceedings of the 2014 ACM conference on SIGCOMM - SIGCOMM '14  
We present Dionysus, a system for fast, consistent network updates in software-defined networks.  ...  Dionysus encodes as a graph the consistency-related dependencies among updates at individual switches, and it then dynamically schedules these updates based on runtime differences in the update speeds  ...  Dionysus ensures that these updates will be fast and consistent. Conclusion Dionysus enables fast, consistent network updates in SDNs.  ... 
doi:10.1145/2619239.2626307 dblp:conf/sigcomm/JinLGKMZRW14 fatcat:jem7z25rf5g7het56s67prhnju

Dynamic scheduling of network updates

Xin Jin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, Roger Wattenhofer
2014 Computer communication review  
We present Dionysus, a system for fast, consistent network updates in software-defined networks.  ...  Dionysus encodes as a graph the consistency-related dependencies among updates at individual switches, and it then dynamically schedules these updates based on runtime differences in the update speeds  ...  Dionysus ensures that these updates will be fast and consistent. Conclusion Dionysus enables fast, consistent network updates in SDNs.  ... 
doi:10.1145/2740070.2626307 fatcat:eoxd75h4fveunpsdiz6xywfzyu

Optimal Consistent Network Updates in Polynomial Time [article]

Pavol Cerny, Nate Foster, Nilesh Jagnik, Jedidiah McClurg
2016 arXiv   pre-print
If switches can be updated in some (partial) order which guarantees that per-packet consistency is preserved, we call this order a CONSISTENT ORDER UPDATE.  ...  However, as is common in distributed systems, it can be difficult to ensure that certain consistency properties are preserved during periods of reconfiguration.  ...  a consistent state and v r can be updated.  ... 
arXiv:1607.05159v1 fatcat:nw5s64lz6nh7rb2tal7qryfbhq

Decentralized Consistent Network Updates in SDN with ez-Segway [article]

Thanh Dang Nguyen, Marco Chiesa, Marco Canini
2017 arXiv   pre-print
In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution.  ...  This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update.  ...  This research is (in part) supported by European Union's Horizon 2020 research and innovation programme under the ENDEAVOUR project (grant agreement 644960).  ... 
arXiv:1703.02149v1 fatcat:owbl274vknfn5ehfjyzo3ilwqm

Link-based fine granularity flow migration in SDNs to reduce packet loss

Yang Chen, Jie Wu
2017 2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)  
We prove that it is NP-hard to check the feasibility of a consistent flow migration. We also propose an efficient heuristic for allocating link resources to avoid deadlocks.  ...  To maximize the data center network utilization, the SDN control plane needs to frequently update the data plane via flow migration as the network conditions change dynamically.  ...  We prove the feasibility of a lossless flow migration plan is NP-hard and propose a greedy algorithm to decide a flow update order.  ... 
doi:10.1109/pccc.2017.8280432 dblp:conf/ipccc/ChenW17 fatcat:5jlknsuajvhidbixkutoomtuqi

Enabling Heterogeneous Network Function Chaining

Lin Cui, Fung Po Tso, Song Guo, Weijia Jia, Kaimin Wei, Wei Zhao
2019 IEEE Transactions on Parallel and Distributed Systems  
This observation is then used to formulate the Heterogeneous Network Policy Placement problem, which is shown to be NP-Hard. To solve the problem efficiently, an online algorithm is proposed.  ...  We first experimentally demonstrate that the processing capacity of NFBs is the dominant performance factor.  ...  The third constraint ensures that types of NFs and NFBs must be consistent. The forth constraint is the capacity constraint of all NFBs. The above problem can be easily proven to be NP-Hard: Proof.  ... 
doi:10.1109/tpds.2018.2871845 fatcat:pobvbe7qjbeytgoqiehygsmpqu
« Previous Showing results 1 — 15 out of 119 results