An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Computer
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Network Virtualization Environments have great potential for overcoming the current ossification of the Internet, fostering innovation, and allowing several concurrent architectures to run on the same physical network. This paper presents a novel physically inspired algorithm for efficiently solving the virtual network embedding problem of placing a virtual network over a substrate network. Compared to a reference heuristic, our algorithm shows lower rejection rates and improved substrate network utilization.