No abstract

No abstract

An algorithm for mapping requests onto physical resources for data centers with a unified scheduler for different types of resources-computational, network, and data storage ones-is con sidered. The algorithm is based on a "compact" assignment of requested resources for the creation of a virtual network in the data center. The desired balance between the computational complexity and quality of the resultant maps can be specified by limiting the maximally acceptable search depth. The oretical and experimental results of the investigation of this algorithm's properties are presented.

Abstract. In this paper we propose a model of a datacenter that provides an ability to describe a wide class of data center architectures. The resource allocation problem is considered that supports replication of data storage elements. Replication procedure provides a way of congestion elimination on channels connected to data storages with low write rates and high read rates. Experimental investigation that was held with different resource allocation algorithms is showing replication procedure to be able to increase the number of allocated requests.

No abstract