Dynamic graph query primitives for SDN-based cloud network management

HotSDN'12 - Proceedings of the 1st ACM International Workshop on Hot Topics in Software Defined Networks

Volumn , Issue , 2012, Pages 97-102

  Raghavendra, Ramya ^a   Lobo, Jorge ^a   Lee, Kang Won ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

graph; naas

Indexed keywords

ALL-PAIR SHORTEST PATH; COMPUTATION TIME; COMPUTING ENVIRONMENTS; DYNAMIC GRAPH; GRAPH; MANAGEMENT FUNCTIONALITY; MANAGEMENT OPERATION; MULTIPLE DEVICES; NAAS; REAL TIME NETWORK; UNDERLYING GRAPHS; VIRTUAL NETWORKS;

COMPUTER SYSTEMS;

NETWORK MANAGEMENT;

EID: 84866508634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2342441.2342461     Document Type: Conference Paper

References (13)

1. T. Benson et al. CloudNaaS: a cloud networking platform for enterprise applications. In Proceedings of ACM SOCC, 2011.
2. H. L. Bodlaender. A Tourist Guide through Treewidth. Acta Cybernetica, 11:1-23, 1993.
3. S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. part i: Sequential algorithms. Algorithmica, 27:212-226, 1995.
4. S. Chaudhuri and C. D. Zaroliagis. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, 27:212-226, 2000.
5. C. Demetrescu and G. F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms, 2(4), Oct. 2006.
6. E. W. Dijkstra. A note on two problems in connexion with graphs. NUMERISCHE MATHEMATIK, 1(1):269-271, 1959.
7. E. Keller and J. Rexford. The "Platform as a service" model for networking. In Proceedings of INM/WREN, 2010.
8. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of FOCS, 1999.
9. T. Koponen et al. Onix: A distributed control platform for large-scale production networks. In In Proc. OSDI, 2010.
10. X. Meng et al. Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement. In Proceedings of IEEE Infocom, march 2010.
11. E. Nordstrom et al. Serval: An End-Host Stack for Service-Centric Networking. In Proceedings of Usenix NSDI, 2012.
12. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms, 21(2), Sept. 1996.
13. F. Wei. TEDI: efficient shortest path query answering on graphs. In Proceedings of SIGMOD, 2010.