Dynamic graph query primitives for SDN-based cloudnetwork management
暂无分享,去创建一个
[1] Valerie King,et al. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[2] Christos D. Zaroliagis,et al. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms , 2000, Algorithmica.
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Giuseppe F. Italiano,et al. Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.
[5] Jennifer Rexford,et al. The "Platform as a Service" Model for Networking , 2010, INM/WREN.
[6] Vasileios Pappas,et al. Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.
[7] Christos D. Zaroliagis,et al. Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms , 1998, Theor. Comput. Sci..
[8] Fang Wei-Kleiner,et al. TEDI: Efficient Shortest Path Query Answering on Graphs , 2010, Graph Data Management.
[9] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .
[10] Dinkar Sitaram,et al. Platform as a Service , 2012, CloudCom 2012.
[11] Michael J. Freedman,et al. Serval: An End-Host Stack for Service-Centric Networking , 2012, NSDI.
[12] Anees Shaikh,et al. CloudNaaS: a cloud networking platform for enterprise applications , 2011, SoCC.
[13] Martín Casado,et al. Onix: A Distributed Control Platform for Large-scale Production Networks , 2010, OSDI.
[14] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[15] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..