Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
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
Enabling routing control in a DHT
IEEE Journal on Selected Areas in Communications
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
SecondNet: a data center network virtualization architecture with bandwidth guarantees
Proceedings of the 6th International COnference
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Designing and embedding reliable virtual infrastructures
ACM SIGCOMM Computer Communication Review
ServerSwitch: a programmable and high performance platform for data center networks
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Sharing the data center network
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Gatekeeper: supporting bandwidth guarantees for multi-tenant datacenter networks
WIOV'11 Proceedings of the 3rd conference on I/O virtualization
Towards predictable datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
CloudNaaS: a cloud networking platform for enterprise applications
Proceedings of the 2nd ACM Symposium on Cloud Computing
CyberGuarder: A virtualization security assurance architecture for green cloud computing
Future Generation Computer Systems
MOVE: A mobile personalized virtual computing environment
Future Generation Computer Systems
Internet-based Virtual Computing Environment: Beyond the data center as a computer
Future Generation Computer Systems
Editorial: Model-driven provisioning of application services in hybrid computing environments
Future Generation Computer Systems
A cost efficient framework and algorithm for embedding dynamic virtual network requests
Future Generation Computer Systems
International Journal of Web and Grid Services
| Hi-index | 0.00 |
In data center networks, resource allocation refers to mapping a large number of workloads to substrate networks. Existing heuristic mapping algorithms evaluate the resources of the nodes according to one resource factor or a product of resource factors, which will probably lead to an imbalance of the resource allocation. Furthermore, neglecting the hops of the substrate paths in the resource allocation may result in low resource utilization. In this paper, we adopt a top-k dominating model to rank the nodes, aiming at balancing these factors to improve resource allocation. Moreover, we propose a novel mapping algorithm TK-Match, which consists of a node mapping stage and link mapping stage. In the node mapping stage, TK-Match maps the virtual nodes to the substrate nodes in terms of the node ranking and the hops of the substrate paths. In the link mapping stage, TK-Match adopts the k-shortest path algorithm to map the virtual links. Extensive simulation experiments show that TK-Match can greatly increase the long-term average revenue and the acceptance ratio.