Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs
暂无分享,去创建一个
Roger Wattenhofer | Klaus-Tycho Foerster | Jochen Seidel | Thomas Luedi | Roger Wattenhofer | J. Seidel | Klaus-Tycho Foerster | Thomas Luedi
[1] Shlomi Dolev,et al. Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..
[2] Boaz Patt-Shamir,et al. Randomized Proof-Labeling Schemes , 2015, PODC.
[3] Stefano Vissicchio,et al. FLIP the (Flow) table: Fast lightweight policy-preserving SDN updates , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.
[4] Xin Jin,et al. Dynamic scheduling of network updates , 2014, SIGCOMM.
[5] Pierre Fraigniaud,et al. On the Impact of Identifiers on Local Decision , 2012, OPODIS.
[6] Moti Yung,et al. The Local Detection Paradigm and Its Application to Self-Stabilization , 1997, Theor. Comput. Sci..
[7] Shay Kutten,et al. Proof labeling schemes , 2005, PODC '05.
[8] Roger Wattenhofer,et al. On consistent migration of flows in SDNs , 2016 .
[9] Boaz Patt-Shamir,et al. On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms , 2014, SSS.
[10] Arne Ludwig,et al. Scheduling Loop-free Network Updates: It's Good to Relax! , 2015, PODC.
[11] Min Zhu,et al. B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.
[12] Olivier Bonaventure,et al. Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.
[13] Marina Thottan,et al. Measuring control plane latency in SDN-enabled switches , 2015, SOSR.
[14] Boaz Patt-Shamir,et al. Self-Stabilization by Local Checking and Global Reset (Extended Abstract) , 1994, WDAG.
[15] Martín Casado,et al. Abstractions for software-defined networks , 2014, Commun. ACM.
[16] Ronald Fagin,et al. Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[17] Arne Ludwig,et al. Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies , 2014, HotNets.
[18] Pierre Fraigniaud,et al. Randomized distributed decision , 2012, Distributed Computing.
[19] David Walker,et al. Abstractions for network update , 2012, SIGCOMM '12.
[20] Boaz Patt-Shamir,et al. Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[21] Stefan Schmid,et al. Exploiting locality in distributed SDN control , 2013, HotSDN '13.
[22] Pierre Fraigniaud,et al. What can be decided locally without identifiers? , 2013, PODC '13.
[23] Arne Ludwig,et al. Transiently Secure Network Updates , 2016, SIGMETRICS.
[24] Laurent Vanbever,et al. Destroying networks for fun (and profit) , 2015, HotNets.
[25] Ratul Mahajan,et al. Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes , 2016, 2016 IFIP Networking Conference (IFIP Networking) and Workshops.
[26] Pavol Cerný,et al. Optimal Consistent Network Updates in Polynomial Time , 2016, DISC.
[27] Maciej Kuźniar,et al. What You Need to Know About SDN Flow Tables , 2015, PAM.
[28] Srikanth Kandula,et al. Achieving high utilization with software-driven WAN , 2013, SIGCOMM.
[29] Andrzej Pelc,et al. Local Decision and Verification with Bounded-Size Outputs , 2013, SSS.
[30] Pierre Fraigniaud,et al. Towards a complexity theory for local distributed computing , 2013, JACM.
[31] Moni Naor,et al. What can be computed locally? , 1993, STOC.
[32] Shay Kutten,et al. Distributed verification of minimum spanning trees , 2007, Distributed Computing.
[33] Roger Wattenhofer,et al. The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration , 2016, 2016 25th International Conference on Computer Communication and Networks (ICCCN).
[34] Roger Wattenhofer,et al. Anonymous networks: randomization = 2-hop coloring , 2014, PODC.
[35] Catriel Beeri,et al. Bounds on the propagation of selection into logic programs , 1987, J. Comput. Syst. Sci..
[36] Roger Wattenhofer,et al. Local checkability, no strings attached , 2016, ICDCN.
[37] Arne Ludwig,et al. Transiently Consistent SDN Updates: Being Greedy is Hard , 2016, SIROCCO.
[38] Mika Göös,et al. Locally checkable proofs , 2011, PODC '11.
[39] Ratul Mahajan,et al. On consistent updates in software defined networks , 2013, HotNets.
[40] B. Awerbuch,et al. Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[41] Heger Arfaoui,et al. Distributedly Testing Cycle-Freeness , 2014, WG.
[42] Roger Wattenhofer,et al. On consistent migration of flows in SDNs , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.